/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe022_tso_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 07:13:29,934 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 07:13:30,006 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 07:13:30,011 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 07:13:30,011 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 07:13:30,012 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 07:13:30,012 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 07:13:30,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 07:13:30,041 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 07:13:30,044 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 07:13:30,044 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 07:13:30,045 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 07:13:30,045 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 07:13:30,046 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 07:13:30,047 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 07:13:30,047 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 07:13:30,047 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 07:13:30,047 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 07:13:30,048 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 07:13:30,048 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 07:13:30,048 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 07:13:30,048 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 07:13:30,048 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 07:13:30,049 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 07:13:30,050 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 07:13:30,050 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 07:13:30,050 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 07:13:30,051 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 07:13:30,051 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 07:13:30,051 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 07:13:30,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 07:13:30,052 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 07:13:30,052 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 07:13:30,052 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 07:13:30,052 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 07:13:30,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 07:13:30,053 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 07:13:30,053 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 07:13:30,053 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 07:13:30,053 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 07:13:30,053 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 07:13:30,054 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST [2023-08-04 07:13:30,274 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 07:13:30,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 07:13:30,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 07:13:30,295 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 07:13:30,295 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 07:13:30,296 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe022_tso_bound2.i [2023-08-04 07:13:31,407 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 07:13:31,623 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 07:13:31,623 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe022_tso_bound2.i [2023-08-04 07:13:31,636 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51a4d77d0/d550713966894cdd934e816791572624/FLAG47f444559 [2023-08-04 07:13:31,647 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51a4d77d0/d550713966894cdd934e816791572624 [2023-08-04 07:13:31,650 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 07:13:31,651 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 07:13:31,652 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 07:13:31,652 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 07:13:31,654 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 07:13:31,655 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 07:13:31" (1/1) ... [2023-08-04 07:13:31,656 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d87972c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:13:31, skipping insertion in model container [2023-08-04 07:13:31,656 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 07:13:31" (1/1) ... [2023-08-04 07:13:31,695 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 07:13:31,814 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe022_tso_bound2.i[945,958] [2023-08-04 07:13:31,946 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 07:13:31,956 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 07:13:31,967 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe022_tso_bound2.i[945,958] [2023-08-04 07:13:31,976 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 07:13:31,982 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 07:13:32,003 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 07:13:32,025 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 07:13:32,025 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 07:13:32,030 INFO L206 MainTranslator]: Completed translation [2023-08-04 07:13:32,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:13:32 WrapperNode [2023-08-04 07:13:32,031 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 07:13:32,032 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 07:13:32,032 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 07:13:32,032 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 07:13:32,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:13:32" (1/1) ... [2023-08-04 07:13:32,048 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:13:32" (1/1) ... [2023-08-04 07:13:32,064 INFO L138 Inliner]: procedures = 175, calls = 40, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 75 [2023-08-04 07:13:32,064 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 07:13:32,065 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 07:13:32,065 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 07:13:32,065 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 07:13:32,070 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:13:32" (1/1) ... [2023-08-04 07:13:32,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:13:32" (1/1) ... [2023-08-04 07:13:32,073 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:13:32" (1/1) ... [2023-08-04 07:13:32,073 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:13:32" (1/1) ... [2023-08-04 07:13:32,078 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:13:32" (1/1) ... [2023-08-04 07:13:32,080 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:13:32" (1/1) ... [2023-08-04 07:13:32,081 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:13:32" (1/1) ... [2023-08-04 07:13:32,082 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:13:32" (1/1) ... [2023-08-04 07:13:32,084 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 07:13:32,084 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 07:13:32,085 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 07:13:32,085 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 07:13:32,085 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:13:32" (1/1) ... [2023-08-04 07:13:32,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 07:13:32,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:13:32,112 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 07:13:32,114 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 07:13:32,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 07:13:32,137 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 07:13:32,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 07:13:32,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 07:13:32,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 07:13:32,137 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 07:13:32,137 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 07:13:32,137 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 07:13:32,138 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 07:13:32,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 07:13:32,138 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 07:13:32,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 07:13:32,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 07:13:32,139 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 07:13:32,275 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 07:13:32,276 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 07:13:32,468 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 07:13:32,479 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 07:13:32,479 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-04 07:13:32,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 07:13:32 BoogieIcfgContainer [2023-08-04 07:13:32,482 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 07:13:32,485 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 07:13:32,485 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 07:13:32,488 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 07:13:32,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 07:13:31" (1/3) ... [2023-08-04 07:13:32,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1376de00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 07:13:32, skipping insertion in model container [2023-08-04 07:13:32,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:13:32" (2/3) ... [2023-08-04 07:13:32,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1376de00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 07:13:32, skipping insertion in model container [2023-08-04 07:13:32,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 07:13:32" (3/3) ... [2023-08-04 07:13:32,493 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_safe022_tso_bound2.i [2023-08-04 07:13:32,500 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 07:13:32,508 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 07:13:32,508 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-04 07:13:32,508 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 07:13:32,553 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 07:13:32,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 82 transitions, 174 flow [2023-08-04 07:13:32,684 INFO L124 PetriNetUnfolderBase]: 14/193 cut-off events. [2023-08-04 07:13:32,684 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:13:32,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 193 events. 14/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 558 event pairs, 0 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 110. Up to 8 conditions per place. [2023-08-04 07:13:32,691 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 82 transitions, 174 flow [2023-08-04 07:13:32,694 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 70 transitions, 146 flow [2023-08-04 07:13:32,697 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 07:13:32,710 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 70 transitions, 146 flow [2023-08-04 07:13:32,713 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 70 transitions, 146 flow [2023-08-04 07:13:32,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 70 transitions, 146 flow [2023-08-04 07:13:32,744 INFO L124 PetriNetUnfolderBase]: 10/150 cut-off events. [2023-08-04 07:13:32,744 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:13:32,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 150 events. 10/150 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 370 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 88. Up to 8 conditions per place. [2023-08-04 07:13:32,747 INFO L119 LiptonReduction]: Number of co-enabled transitions 840 [2023-08-04 07:13:34,313 INFO L134 LiptonReduction]: Checked pairs total: 1574 [2023-08-04 07:13:34,313 INFO L136 LiptonReduction]: Total number of compositions: 62 [2023-08-04 07:13:34,324 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 07:13:34,329 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;@1c19b6f8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 07:13:34,329 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 07:13:34,331 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 07:13:34,331 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2023-08-04 07:13:34,331 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:13:34,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:13:34,332 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-04 07:13:34,332 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:13:34,336 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:13:34,336 INFO L85 PathProgramCache]: Analyzing trace with hash 9127128, now seen corresponding path program 1 times [2023-08-04 07:13:34,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:13:34,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148284050] [2023-08-04 07:13:34,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:13:34,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:13:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:13:34,527 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 07:13:34,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:13:34,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148284050] [2023-08-04 07:13:34,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148284050] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:13:34,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:13:34,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 07:13:34,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899647225] [2023-08-04 07:13:34,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:13:34,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:13:34,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:13:34,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:13:34,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 07:13:34,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 144 [2023-08-04 07:13:34,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:34,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:13:34,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 144 [2023-08-04 07:13:34,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:13:34,643 INFO L124 PetriNetUnfolderBase]: 66/138 cut-off events. [2023-08-04 07:13:34,643 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:13:34,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284 conditions, 138 events. 66/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 529 event pairs, 24 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 272. Up to 130 conditions per place. [2023-08-04 07:13:34,647 INFO L140 encePairwiseOnDemand]: 140/144 looper letters, 14 selfloop transitions, 2 changer transitions 1/19 dead transitions. [2023-08-04 07:13:34,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 19 transitions, 78 flow [2023-08-04 07:13:34,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:13:34,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:13:34,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 232 transitions. [2023-08-04 07:13:34,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5370370370370371 [2023-08-04 07:13:34,664 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 232 transitions. [2023-08-04 07:13:34,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 232 transitions. [2023-08-04 07:13:34,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:13:34,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 232 transitions. [2023-08-04 07:13:34,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:34,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:34,676 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:34,677 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 40 flow. Second operand 3 states and 232 transitions. [2023-08-04 07:13:34,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 19 transitions, 78 flow [2023-08-04 07:13:34,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 19 transitions, 78 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 07:13:34,681 INFO L231 Difference]: Finished difference. Result has 24 places, 16 transitions, 46 flow [2023-08-04 07:13:34,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=46, PETRI_PLACES=24, PETRI_TRANSITIONS=16} [2023-08-04 07:13:34,687 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 3 predicate places. [2023-08-04 07:13:34,688 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 16 transitions, 46 flow [2023-08-04 07:13:34,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:34,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:13:34,688 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:13:34,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 07:13:34,689 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:13:34,690 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:13:34,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1505364692, now seen corresponding path program 1 times [2023-08-04 07:13:34,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:13:34,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546870664] [2023-08-04 07:13:34,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:13:34,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:13:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:13:34,800 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 07:13:34,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:13:34,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546870664] [2023-08-04 07:13:34,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546870664] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:13:34,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121906819] [2023-08-04 07:13:34,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:13:34,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:13:34,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:13:34,808 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 07:13:34,814 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 07:13:34,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:13:34,884 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 07:13:34,887 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:13:34,918 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 07:13:34,918 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 07:13:34,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121906819] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:13:34,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 07:13:34,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 07:13:34,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968825786] [2023-08-04 07:13:34,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:13:34,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:13:34,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:13:34,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:13:34,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:13:34,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 144 [2023-08-04 07:13:34,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 16 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:34,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:13:34,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 144 [2023-08-04 07:13:34,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:13:34,972 INFO L124 PetriNetUnfolderBase]: 62/128 cut-off events. [2023-08-04 07:13:34,973 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-04 07:13:34,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276 conditions, 128 events. 62/128 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 443 event pairs, 28 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 261. Up to 100 conditions per place. [2023-08-04 07:13:34,974 INFO L140 encePairwiseOnDemand]: 141/144 looper letters, 16 selfloop transitions, 2 changer transitions 1/21 dead transitions. [2023-08-04 07:13:34,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 21 transitions, 94 flow [2023-08-04 07:13:34,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:13:34,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:13:34,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 233 transitions. [2023-08-04 07:13:34,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5393518518518519 [2023-08-04 07:13:34,976 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 233 transitions. [2023-08-04 07:13:34,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 233 transitions. [2023-08-04 07:13:34,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:13:34,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 233 transitions. [2023-08-04 07:13:34,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:34,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:34,980 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:34,980 INFO L175 Difference]: Start difference. First operand has 24 places, 16 transitions, 46 flow. Second operand 3 states and 233 transitions. [2023-08-04 07:13:34,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 21 transitions, 94 flow [2023-08-04 07:13:34,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 21 transitions, 90 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 07:13:34,982 INFO L231 Difference]: Finished difference. Result has 25 places, 16 transitions, 50 flow [2023-08-04 07:13:34,982 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2023-08-04 07:13:34,983 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 4 predicate places. [2023-08-04 07:13:34,983 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 50 flow [2023-08-04 07:13:34,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:34,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:13:34,983 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:13:34,996 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 07:13:35,189 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 07:13:35,189 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:13:35,190 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:13:35,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1725877256, now seen corresponding path program 1 times [2023-08-04 07:13:35,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:13:35,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190541366] [2023-08-04 07:13:35,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:13:35,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:13:35,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:13:35,295 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 07:13:35,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:13:35,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190541366] [2023-08-04 07:13:35,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190541366] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:13:35,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522702675] [2023-08-04 07:13:35,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:13:35,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:13:35,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:13:35,297 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 07:13:35,298 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 07:13:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:13:35,356 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 07:13:35,357 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:13:35,386 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 07:13:35,386 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:13:35,404 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 07:13:35,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522702675] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:13:35,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:13:35,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-08-04 07:13:35,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912314734] [2023-08-04 07:13:35,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:13:35,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 07:13:35,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:13:35,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 07:13:35,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 07:13:35,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 144 [2023-08-04 07:13:35,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 50 flow. Second operand has 4 states, 4 states have (on average 72.5) internal successors, (290), 4 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:35,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:13:35,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 144 [2023-08-04 07:13:35,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:13:35,442 INFO L124 PetriNetUnfolderBase]: 4/16 cut-off events. [2023-08-04 07:13:35,443 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-04 07:13:35,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 16 events. 4/16 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 3/19 useless extension candidates. Maximal degree in co-relation 36. Up to 10 conditions per place. [2023-08-04 07:13:35,443 INFO L140 encePairwiseOnDemand]: 141/144 looper letters, 0 selfloop transitions, 0 changer transitions 10/10 dead transitions. [2023-08-04 07:13:35,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 17 places, 10 transitions, 43 flow [2023-08-04 07:13:35,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 07:13:35,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 07:13:35,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 290 transitions. [2023-08-04 07:13:35,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5034722222222222 [2023-08-04 07:13:35,448 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 290 transitions. [2023-08-04 07:13:35,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 290 transitions. [2023-08-04 07:13:35,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:13:35,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 290 transitions. [2023-08-04 07:13:35,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 72.5) internal successors, (290), 4 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:35,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 144.0) internal successors, (720), 5 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:35,454 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 144.0) internal successors, (720), 5 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:35,454 INFO L175 Difference]: Start difference. First operand has 25 places, 16 transitions, 50 flow. Second operand 4 states and 290 transitions. [2023-08-04 07:13:35,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 17 places, 10 transitions, 43 flow [2023-08-04 07:13:35,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 10 transitions, 41 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 07:13:35,455 INFO L231 Difference]: Finished difference. Result has 16 places, 0 transitions, 0 flow [2023-08-04 07:13:35,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=17, PETRI_DIFFERENCE_MINUEND_PLACES=13, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=7, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=16, PETRI_TRANSITIONS=0} [2023-08-04 07:13:35,457 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, -5 predicate places. [2023-08-04 07:13:35,457 INFO L495 AbstractCegarLoop]: Abstraction has has 16 places, 0 transitions, 0 flow [2023-08-04 07:13:35,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 4 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:35,459 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-08-04 07:13:35,471 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 07:13:35,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-08-04 07:13:35,666 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-08-04 07:13:35,668 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2023-08-04 07:13:35,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 82 transitions, 174 flow [2023-08-04 07:13:35,695 INFO L124 PetriNetUnfolderBase]: 14/193 cut-off events. [2023-08-04 07:13:35,695 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:13:35,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 193 events. 14/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 558 event pairs, 0 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 110. Up to 8 conditions per place. [2023-08-04 07:13:35,697 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 82 transitions, 174 flow [2023-08-04 07:13:35,698 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 56 transitions, 122 flow [2023-08-04 07:13:35,698 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 07:13:35,698 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 56 transitions, 122 flow [2023-08-04 07:13:35,698 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 56 transitions, 122 flow [2023-08-04 07:13:35,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 56 transitions, 122 flow [2023-08-04 07:13:35,707 INFO L124 PetriNetUnfolderBase]: 2/89 cut-off events. [2023-08-04 07:13:35,707 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:13:35,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 133 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 58. Up to 4 conditions per place. [2023-08-04 07:13:35,708 INFO L119 LiptonReduction]: Number of co-enabled transitions 492 [2023-08-04 07:13:36,912 INFO L134 LiptonReduction]: Checked pairs total: 991 [2023-08-04 07:13:36,913 INFO L136 LiptonReduction]: Total number of compositions: 45 [2023-08-04 07:13:36,914 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 07:13:36,915 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;@1c19b6f8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 07:13:36,915 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 07:13:36,917 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 07:13:36,917 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2023-08-04 07:13:36,917 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:13:36,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:13:36,918 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 07:13:36,918 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 07:13:36,918 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:13:36,918 INFO L85 PathProgramCache]: Analyzing trace with hash 326178048, now seen corresponding path program 1 times [2023-08-04 07:13:36,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:13:36,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895759230] [2023-08-04 07:13:36,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:13:36,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:13:36,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:13:36,949 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 07:13:36,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:13:36,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895759230] [2023-08-04 07:13:36,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895759230] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:13:36,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:13:36,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 07:13:36,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659687949] [2023-08-04 07:13:36,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:13:36,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:13:36,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:13:36,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:13:36,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 07:13:36,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 127 [2023-08-04 07:13:36,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 15 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:36,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:13:36,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 127 [2023-08-04 07:13:36,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:13:36,984 INFO L124 PetriNetUnfolderBase]: 24/72 cut-off events. [2023-08-04 07:13:36,985 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:13:36,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 72 events. 24/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 237 event pairs, 6 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 134. Up to 52 conditions per place. [2023-08-04 07:13:36,986 INFO L140 encePairwiseOnDemand]: 124/127 looper letters, 12 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2023-08-04 07:13:36,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 18 transitions, 74 flow [2023-08-04 07:13:36,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:13:36,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:13:36,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 228 transitions. [2023-08-04 07:13:36,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5984251968503937 [2023-08-04 07:13:36,987 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 228 transitions. [2023-08-04 07:13:36,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 228 transitions. [2023-08-04 07:13:36,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:13:36,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 228 transitions. [2023-08-04 07:13:36,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:36,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:36,989 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:36,989 INFO L175 Difference]: Start difference. First operand has 20 places, 15 transitions, 40 flow. Second operand 3 states and 228 transitions. [2023-08-04 07:13:36,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 18 transitions, 74 flow [2023-08-04 07:13:36,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 18 transitions, 74 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 07:13:36,990 INFO L231 Difference]: Finished difference. Result has 23 places, 15 transitions, 48 flow [2023-08-04 07:13:36,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=48, PETRI_PLACES=23, PETRI_TRANSITIONS=15} [2023-08-04 07:13:36,991 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 3 predicate places. [2023-08-04 07:13:36,991 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 48 flow [2023-08-04 07:13:36,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:36,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:13:36,992 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 07:13:36,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-04 07:13:36,992 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 07:13:36,992 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:13:36,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1519796090, now seen corresponding path program 1 times [2023-08-04 07:13:36,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:13:36,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836269183] [2023-08-04 07:13:36,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:13:36,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:13:37,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 07:13:37,011 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 07:13:37,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 07:13:37,038 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 07:13:37,038 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 07:13:37,038 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 07:13:37,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 07:13:37,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-04 07:13:37,039 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 07:13:37,039 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (2/2) [2023-08-04 07:13:37,040 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 07:13:37,040 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 07:13:37,059 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 07:13:37,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 96 transitions, 216 flow [2023-08-04 07:13:37,099 INFO L124 PetriNetUnfolderBase]: 30/412 cut-off events. [2023-08-04 07:13:37,100 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 07:13:37,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 412 events. 30/412 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1716 event pairs, 0 based on Foata normal form. 0/361 useless extension candidates. Maximal degree in co-relation 296. Up to 18 conditions per place. [2023-08-04 07:13:37,101 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 96 transitions, 216 flow [2023-08-04 07:13:37,103 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 84 transitions, 184 flow [2023-08-04 07:13:37,103 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 07:13:37,103 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 84 transitions, 184 flow [2023-08-04 07:13:37,103 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 84 transitions, 184 flow [2023-08-04 07:13:37,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 84 transitions, 184 flow [2023-08-04 07:13:37,128 INFO L124 PetriNetUnfolderBase]: 21/318 cut-off events. [2023-08-04 07:13:37,129 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-04 07:13:37,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 343 conditions, 318 events. 21/318 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1152 event pairs, 0 based on Foata normal form. 0/285 useless extension candidates. Maximal degree in co-relation 233. Up to 18 conditions per place. [2023-08-04 07:13:37,135 INFO L119 LiptonReduction]: Number of co-enabled transitions 2016 [2023-08-04 07:13:38,519 INFO L134 LiptonReduction]: Checked pairs total: 4286 [2023-08-04 07:13:38,520 INFO L136 LiptonReduction]: Total number of compositions: 66 [2023-08-04 07:13:38,522 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 07:13:38,522 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;@1c19b6f8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 07:13:38,522 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 07:13:38,524 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 07:13:38,524 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2023-08-04 07:13:38,524 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:13:38,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:13:38,525 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-04 07:13:38,525 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:13:38,525 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:13:38,525 INFO L85 PathProgramCache]: Analyzing trace with hash 15931322, now seen corresponding path program 1 times [2023-08-04 07:13:38,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:13:38,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463847469] [2023-08-04 07:13:38,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:13:38,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:13:38,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:13:38,551 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 07:13:38,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:13:38,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463847469] [2023-08-04 07:13:38,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463847469] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:13:38,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:13:38,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 07:13:38,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927894374] [2023-08-04 07:13:38,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:13:38,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:13:38,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:13:38,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:13:38,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 07:13:38,562 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 162 [2023-08-04 07:13:38,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:38,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:13:38,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 162 [2023-08-04 07:13:38,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:13:38,822 INFO L124 PetriNetUnfolderBase]: 1674/2803 cut-off events. [2023-08-04 07:13:38,823 INFO L125 PetriNetUnfolderBase]: For 105/105 co-relation queries the response was YES. [2023-08-04 07:13:38,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5432 conditions, 2803 events. 1674/2803 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 16427 event pairs, 1140 based on Foata normal form. 0/2616 useless extension candidates. Maximal degree in co-relation 1555. Up to 2476 conditions per place. [2023-08-04 07:13:38,836 INFO L140 encePairwiseOnDemand]: 158/162 looper letters, 22 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2023-08-04 07:13:38,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 30 transitions, 124 flow [2023-08-04 07:13:38,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:13:38,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:13:38,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 275 transitions. [2023-08-04 07:13:38,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.565843621399177 [2023-08-04 07:13:38,838 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 275 transitions. [2023-08-04 07:13:38,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 275 transitions. [2023-08-04 07:13:38,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:13:38,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 275 transitions. [2023-08-04 07:13:38,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:38,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:38,841 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:38,841 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 70 flow. Second operand 3 states and 275 transitions. [2023-08-04 07:13:38,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 30 transitions, 124 flow [2023-08-04 07:13:38,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 30 transitions, 124 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 07:13:38,843 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 80 flow [2023-08-04 07:13:38,843 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2023-08-04 07:13:38,843 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2023-08-04 07:13:38,843 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 80 flow [2023-08-04 07:13:38,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:38,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:13:38,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:13:38,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 07:13:38,844 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:13:38,845 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:13:38,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1272040559, now seen corresponding path program 1 times [2023-08-04 07:13:38,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:13:38,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139275566] [2023-08-04 07:13:38,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:13:38,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:13:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:13:38,910 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 07:13:38,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:13:38,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139275566] [2023-08-04 07:13:38,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139275566] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:13:38,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735872534] [2023-08-04 07:13:38,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:13:38,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:13:38,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:13:38,917 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 07:13:38,942 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 07:13:38,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:13:38,981 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 07:13:38,982 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:13:38,987 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 07:13:38,988 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 07:13:38,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735872534] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:13:38,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 07:13:38,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 07:13:38,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787175608] [2023-08-04 07:13:38,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:13:38,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:13:38,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:13:38,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:13:38,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:13:38,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 162 [2023-08-04 07:13:38,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:38,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:13:38,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 162 [2023-08-04 07:13:38,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:13:39,189 INFO L124 PetriNetUnfolderBase]: 1646/2693 cut-off events. [2023-08-04 07:13:39,189 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2023-08-04 07:13:39,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5300 conditions, 2693 events. 1646/2693 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 15447 event pairs, 1120 based on Foata normal form. 0/2548 useless extension candidates. Maximal degree in co-relation 5265. Up to 2299 conditions per place. [2023-08-04 07:13:39,206 INFO L140 encePairwiseOnDemand]: 159/162 looper letters, 27 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2023-08-04 07:13:39,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 35 transitions, 154 flow [2023-08-04 07:13:39,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:13:39,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:13:39,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 278 transitions. [2023-08-04 07:13:39,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5720164609053497 [2023-08-04 07:13:39,208 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 278 transitions. [2023-08-04 07:13:39,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 278 transitions. [2023-08-04 07:13:39,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:13:39,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 278 transitions. [2023-08-04 07:13:39,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:39,210 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:39,211 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:39,211 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 80 flow. Second operand 3 states and 278 transitions. [2023-08-04 07:13:39,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 35 transitions, 154 flow [2023-08-04 07:13:39,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 35 transitions, 152 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 07:13:39,215 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 90 flow [2023-08-04 07:13:39,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-08-04 07:13:39,216 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2023-08-04 07:13:39,216 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 90 flow [2023-08-04 07:13:39,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:39,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:13:39,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:13:39,224 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 07:13:39,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:13:39,422 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:13:39,422 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:13:39,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1131745422, now seen corresponding path program 1 times [2023-08-04 07:13:39,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:13:39,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341012016] [2023-08-04 07:13:39,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:13:39,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:13:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:13:39,478 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 07:13:39,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:13:39,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341012016] [2023-08-04 07:13:39,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341012016] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:13:39,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273620889] [2023-08-04 07:13:39,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:13:39,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:13:39,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:13:39,481 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 07:13:39,483 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 07:13:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:13:39,535 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 07:13:39,536 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:13:39,554 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 07:13:39,555 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:13:39,571 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 07:13:39,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273620889] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:13:39,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:13:39,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 07:13:39,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470734470] [2023-08-04 07:13:39,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:13:39,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 07:13:39,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:13:39,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 07:13:39,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:13:39,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 162 [2023-08-04 07:13:39,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 84.8) internal successors, (424), 5 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:39,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:13:39,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 162 [2023-08-04 07:13:39,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:13:39,753 INFO L124 PetriNetUnfolderBase]: 1336/2141 cut-off events. [2023-08-04 07:13:39,753 INFO L125 PetriNetUnfolderBase]: For 270/270 co-relation queries the response was YES. [2023-08-04 07:13:39,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4466 conditions, 2141 events. 1336/2141 cut-off events. For 270/270 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 11363 event pairs, 564 based on Foata normal form. 3/2143 useless extension candidates. Maximal degree in co-relation 1599. Up to 1882 conditions per place. [2023-08-04 07:13:39,766 INFO L140 encePairwiseOnDemand]: 158/162 looper letters, 26 selfloop transitions, 3 changer transitions 1/36 dead transitions. [2023-08-04 07:13:39,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 36 transitions, 166 flow [2023-08-04 07:13:39,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 07:13:39,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 07:13:39,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 358 transitions. [2023-08-04 07:13:39,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5524691358024691 [2023-08-04 07:13:39,768 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 358 transitions. [2023-08-04 07:13:39,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 358 transitions. [2023-08-04 07:13:39,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:13:39,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 358 transitions. [2023-08-04 07:13:39,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:39,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 162.0) internal successors, (810), 5 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:39,771 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 162.0) internal successors, (810), 5 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:39,771 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 90 flow. Second operand 4 states and 358 transitions. [2023-08-04 07:13:39,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 36 transitions, 166 flow [2023-08-04 07:13:39,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 36 transitions, 164 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 07:13:39,774 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 102 flow [2023-08-04 07:13:39,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=39, 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=102, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2023-08-04 07:13:39,776 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 9 predicate places. [2023-08-04 07:13:39,780 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 102 flow [2023-08-04 07:13:39,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.8) internal successors, (424), 5 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:39,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:13:39,780 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:13:39,791 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 07:13:39,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:13:39,991 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:13:39,992 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:13:39,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1223970462, now seen corresponding path program 1 times [2023-08-04 07:13:39,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:13:39,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223853304] [2023-08-04 07:13:39,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:13:39,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:13:40,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:13:40,035 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 07:13:40,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:13:40,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223853304] [2023-08-04 07:13:40,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223853304] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:13:40,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896744598] [2023-08-04 07:13:40,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:13:40,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:13:40,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:13:40,038 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 07:13:40,042 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 07:13:40,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:13:40,104 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 07:13:40,127 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:13:40,140 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 07:13:40,140 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:13:40,160 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 07:13:40,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896744598] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:13:40,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:13:40,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 07:13:40,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059969125] [2023-08-04 07:13:40,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:13:40,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 07:13:40,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:13:40,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 07:13:40,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:13:40,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 162 [2023-08-04 07:13:40,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 102 flow. Second operand has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:40,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:13:40,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 162 [2023-08-04 07:13:40,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:13:40,358 INFO L124 PetriNetUnfolderBase]: 1216/1861 cut-off events. [2023-08-04 07:13:40,358 INFO L125 PetriNetUnfolderBase]: For 252/252 co-relation queries the response was YES. [2023-08-04 07:13:40,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3986 conditions, 1861 events. 1216/1861 cut-off events. For 252/252 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 9118 event pairs, 400 based on Foata normal form. 27/1887 useless extension candidates. Maximal degree in co-relation 1421. Up to 943 conditions per place. [2023-08-04 07:13:40,369 INFO L140 encePairwiseOnDemand]: 158/162 looper letters, 34 selfloop transitions, 3 changer transitions 1/44 dead transitions. [2023-08-04 07:13:40,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 44 transitions, 210 flow [2023-08-04 07:13:40,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 07:13:40,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 07:13:40,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 366 transitions. [2023-08-04 07:13:40,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5648148148148148 [2023-08-04 07:13:40,372 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 366 transitions. [2023-08-04 07:13:40,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 366 transitions. [2023-08-04 07:13:40,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:13:40,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 366 transitions. [2023-08-04 07:13:40,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:40,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 162.0) internal successors, (810), 5 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:40,375 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 162.0) internal successors, (810), 5 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:40,375 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 102 flow. Second operand 4 states and 366 transitions. [2023-08-04 07:13:40,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 44 transitions, 210 flow [2023-08-04 07:13:40,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 44 transitions, 203 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 07:13:40,377 INFO L231 Difference]: Finished difference. Result has 46 places, 28 transitions, 109 flow [2023-08-04 07:13:40,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=41, 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=109, PETRI_PLACES=46, PETRI_TRANSITIONS=28} [2023-08-04 07:13:40,377 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 11 predicate places. [2023-08-04 07:13:40,377 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 28 transitions, 109 flow [2023-08-04 07:13:40,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:40,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:13:40,378 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:13:40,392 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 07:13:40,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:13:40,583 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:13:40,583 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:13:40,583 INFO L85 PathProgramCache]: Analyzing trace with hash 76241794, now seen corresponding path program 1 times [2023-08-04 07:13:40,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:13:40,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724787069] [2023-08-04 07:13:40,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:13:40,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:13:40,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:13:40,728 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 07:13:40,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:13:40,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724787069] [2023-08-04 07:13:40,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724787069] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:13:40,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:13:40,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 07:13:40,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588167346] [2023-08-04 07:13:40,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:13:40,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:13:40,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:13:40,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:13:40,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 07:13:40,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 162 [2023-08-04 07:13:40,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 28 transitions, 109 flow. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:40,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:13:40,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 162 [2023-08-04 07:13:40,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:13:40,855 INFO L124 PetriNetUnfolderBase]: 970/1579 cut-off events. [2023-08-04 07:13:40,856 INFO L125 PetriNetUnfolderBase]: For 1054/1054 co-relation queries the response was YES. [2023-08-04 07:13:40,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3673 conditions, 1579 events. 970/1579 cut-off events. For 1054/1054 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8073 event pairs, 244 based on Foata normal form. 9/1587 useless extension candidates. Maximal degree in co-relation 1297. Up to 1195 conditions per place. [2023-08-04 07:13:40,865 INFO L140 encePairwiseOnDemand]: 158/162 looper letters, 30 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2023-08-04 07:13:40,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 39 transitions, 219 flow [2023-08-04 07:13:40,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:13:40,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:13:40,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 283 transitions. [2023-08-04 07:13:40,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5823045267489712 [2023-08-04 07:13:40,867 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 283 transitions. [2023-08-04 07:13:40,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 283 transitions. [2023-08-04 07:13:40,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:13:40,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 283 transitions. [2023-08-04 07:13:40,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:40,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:40,869 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:40,869 INFO L175 Difference]: Start difference. First operand has 46 places, 28 transitions, 109 flow. Second operand 3 states and 283 transitions. [2023-08-04 07:13:40,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 39 transitions, 219 flow [2023-08-04 07:13:40,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 39 transitions, 207 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-04 07:13:40,871 INFO L231 Difference]: Finished difference. Result has 46 places, 30 transitions, 121 flow [2023-08-04 07:13:40,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2023-08-04 07:13:40,872 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 11 predicate places. [2023-08-04 07:13:40,872 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 30 transitions, 121 flow [2023-08-04 07:13:40,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:40,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:13:40,873 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:13:40,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-04 07:13:40,873 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:13:40,873 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:13:40,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1931472314, now seen corresponding path program 1 times [2023-08-04 07:13:40,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:13:40,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580450345] [2023-08-04 07:13:40,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:13:40,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:13:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:13:40,976 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 07:13:40,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:13:40,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580450345] [2023-08-04 07:13:40,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580450345] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:13:40,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:13:40,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 07:13:40,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399711811] [2023-08-04 07:13:40,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:13:40,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 07:13:40,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:13:40,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 07:13:40,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-04 07:13:40,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 162 [2023-08-04 07:13:40,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 30 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:40,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:13:40,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 162 [2023-08-04 07:13:40,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:13:41,405 INFO L124 PetriNetUnfolderBase]: 4298/5979 cut-off events. [2023-08-04 07:13:41,405 INFO L125 PetriNetUnfolderBase]: For 3348/3348 co-relation queries the response was YES. [2023-08-04 07:13:41,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14599 conditions, 5979 events. 4298/5979 cut-off events. For 3348/3348 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 28663 event pairs, 408 based on Foata normal form. 112/6087 useless extension candidates. Maximal degree in co-relation 10829. Up to 3649 conditions per place. [2023-08-04 07:13:41,446 INFO L140 encePairwiseOnDemand]: 154/162 looper letters, 69 selfloop transitions, 15 changer transitions 0/86 dead transitions. [2023-08-04 07:13:41,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 86 transitions, 495 flow [2023-08-04 07:13:41,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 07:13:41,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 07:13:41,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2023-08-04 07:13:41,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5753086419753086 [2023-08-04 07:13:41,448 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 466 transitions. [2023-08-04 07:13:41,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 466 transitions. [2023-08-04 07:13:41,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:13:41,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 466 transitions. [2023-08-04 07:13:41,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 93.2) internal successors, (466), 5 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:41,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 162.0) internal successors, (972), 6 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:41,452 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 162.0) internal successors, (972), 6 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:41,452 INFO L175 Difference]: Start difference. First operand has 46 places, 30 transitions, 121 flow. Second operand 5 states and 466 transitions. [2023-08-04 07:13:41,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 86 transitions, 495 flow [2023-08-04 07:13:41,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 86 transitions, 490 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 07:13:41,455 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 241 flow [2023-08-04 07:13:41,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=241, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2023-08-04 07:13:41,456 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 17 predicate places. [2023-08-04 07:13:41,456 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 241 flow [2023-08-04 07:13:41,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:41,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:13:41,457 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:13:41,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-04 07:13:41,457 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:13:41,457 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:13:41,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1364898617, now seen corresponding path program 1 times [2023-08-04 07:13:41,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:13:41,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439128284] [2023-08-04 07:13:41,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:13:41,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:13:41,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:13:41,556 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-04 07:13:41,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:13:41,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439128284] [2023-08-04 07:13:41,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439128284] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:13:41,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001257658] [2023-08-04 07:13:41,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:13:41,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:13:41,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:13:41,558 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 07:13:41,583 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 07:13:41,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:13:41,632 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-04 07:13:41,633 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:13:41,665 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 07:13:41,665 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 07:13:41,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001257658] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:13:41,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 07:13:41,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2023-08-04 07:13:41,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211809841] [2023-08-04 07:13:41,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:13:41,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:13:41,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:13:41,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:13:41,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:13:41,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 162 [2023-08-04 07:13:41,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 241 flow. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:41,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:13:41,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 162 [2023-08-04 07:13:41,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:13:41,899 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([484] L2-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_59 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_30|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_38| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_30| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_38|) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_44 0) (= v_~__unbuffered_p1_EAX~0_52 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_59)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_44, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_52} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_38|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_44, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_30|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_52, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_59} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][67], [P0Thread1of2ForFork1InUse, Black: 319#(and (= ~x~0 0) (or (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), P0Thread2of2ForFork1InUse, Black: 317#(or (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))), Black: 316#(= ~x~0 0), P1Thread1of2ForFork0InUse, 314#true, P1Thread2of2ForFork0InUse, Black: 131#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 106#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 140#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 324#true, Black: 214#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 78#L726true, 28#L741true, 76#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 311#(= ~__unbuffered_p1_EAX~0 0), 31#L738true, 22#P0EXITtrue]) [2023-08-04 07:13:41,899 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-04 07:13:41,899 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 07:13:41,899 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 07:13:41,899 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 07:13:41,916 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([484] L2-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_59 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_30|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_38| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_30| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_38|) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_44 0) (= v_~__unbuffered_p1_EAX~0_52 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_59)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_44, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_52} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_38|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_44, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_30|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_52, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_59} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][67], [P0Thread1of2ForFork1InUse, Black: 319#(and (= ~x~0 0) (or (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), P0Thread2of2ForFork1InUse, Black: 317#(or (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))), Black: 316#(= ~x~0 0), P1Thread1of2ForFork0InUse, 314#true, P1Thread2of2ForFork0InUse, Black: 131#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 106#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 140#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 324#true, Black: 214#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 78#L726true, 28#L741true, 76#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 311#(= ~__unbuffered_p1_EAX~0 0), 22#P0EXITtrue, 68#L741true]) [2023-08-04 07:13:41,917 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-04 07:13:41,917 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 07:13:41,917 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 07:13:41,917 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 07:13:41,932 INFO L124 PetriNetUnfolderBase]: 2262/3483 cut-off events. [2023-08-04 07:13:41,932 INFO L125 PetriNetUnfolderBase]: For 4675/4776 co-relation queries the response was YES. [2023-08-04 07:13:41,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10590 conditions, 3483 events. 2262/3483 cut-off events. For 4675/4776 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 18885 event pairs, 425 based on Foata normal form. 48/3347 useless extension candidates. Maximal degree in co-relation 7934. Up to 2624 conditions per place. [2023-08-04 07:13:41,958 INFO L140 encePairwiseOnDemand]: 156/162 looper letters, 49 selfloop transitions, 5 changer transitions 0/68 dead transitions. [2023-08-04 07:13:41,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 68 transitions, 477 flow [2023-08-04 07:13:41,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:13:41,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:13:41,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 283 transitions. [2023-08-04 07:13:41,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5823045267489712 [2023-08-04 07:13:41,960 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 283 transitions. [2023-08-04 07:13:41,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 283 transitions. [2023-08-04 07:13:41,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:13:41,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 283 transitions. [2023-08-04 07:13:41,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:41,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:41,962 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:41,962 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 241 flow. Second operand 3 states and 283 transitions. [2023-08-04 07:13:41,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 68 transitions, 477 flow [2023-08-04 07:13:41,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 68 transitions, 464 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 07:13:41,967 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 265 flow [2023-08-04 07:13:41,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=265, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2023-08-04 07:13:41,968 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 19 predicate places. [2023-08-04 07:13:41,968 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 265 flow [2023-08-04 07:13:41,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:41,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:13:41,968 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:13:41,975 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 07:13:42,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:13:42,173 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:13:42,173 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:13:42,173 INFO L85 PathProgramCache]: Analyzing trace with hash -524650372, now seen corresponding path program 1 times [2023-08-04 07:13:42,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:13:42,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822743249] [2023-08-04 07:13:42,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:13:42,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:13:42,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:13:42,336 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-04 07:13:42,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:13:42,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822743249] [2023-08-04 07:13:42,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822743249] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:13:42,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752214152] [2023-08-04 07:13:42,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:13:42,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:13:42,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:13:42,338 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 07:13:42,361 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 07:13:42,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:13:42,418 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-04 07:13:42,419 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:13:42,452 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-04 07:13:42,452 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:13:42,522 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-04 07:13:42,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752214152] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:13:42,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:13:42,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 6 [2023-08-04 07:13:42,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486552192] [2023-08-04 07:13:42,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:13:42,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-04 07:13:42,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:13:42,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-04 07:13:42,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-04 07:13:42,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 162 [2023-08-04 07:13:42,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 265 flow. Second operand has 7 states, 7 states have (on average 80.42857142857143) internal successors, (563), 7 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:42,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:13:42,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 162 [2023-08-04 07:13:42,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:13:42,951 INFO L124 PetriNetUnfolderBase]: 2645/4122 cut-off events. [2023-08-04 07:13:42,951 INFO L125 PetriNetUnfolderBase]: For 7032/7268 co-relation queries the response was YES. [2023-08-04 07:13:42,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14224 conditions, 4122 events. 2645/4122 cut-off events. For 7032/7268 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 23093 event pairs, 160 based on Foata normal form. 356/4440 useless extension candidates. Maximal degree in co-relation 11261. Up to 1398 conditions per place. [2023-08-04 07:13:42,994 INFO L140 encePairwiseOnDemand]: 151/162 looper letters, 101 selfloop transitions, 43 changer transitions 16/168 dead transitions. [2023-08-04 07:13:42,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 168 transitions, 1208 flow [2023-08-04 07:13:42,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-04 07:13:42,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-04 07:13:42,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 894 transitions. [2023-08-04 07:13:42,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5518518518518518 [2023-08-04 07:13:42,998 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 894 transitions. [2023-08-04 07:13:42,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 894 transitions. [2023-08-04 07:13:42,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:13:42,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 894 transitions. [2023-08-04 07:13:43,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 89.4) internal successors, (894), 10 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:43,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 162.0) internal successors, (1782), 11 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:43,003 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 162.0) internal successors, (1782), 11 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:43,003 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 265 flow. Second operand 10 states and 894 transitions. [2023-08-04 07:13:43,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 168 transitions, 1208 flow [2023-08-04 07:13:43,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 168 transitions, 1189 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-04 07:13:43,012 INFO L231 Difference]: Finished difference. Result has 68 places, 76 transitions, 590 flow [2023-08-04 07:13:43,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=590, PETRI_PLACES=68, PETRI_TRANSITIONS=76} [2023-08-04 07:13:43,013 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 33 predicate places. [2023-08-04 07:13:43,013 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 76 transitions, 590 flow [2023-08-04 07:13:43,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 80.42857142857143) internal successors, (563), 7 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:43,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:13:43,013 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] [2023-08-04 07:13:43,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-08-04 07:13:43,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:13:43,219 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:13:43,219 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:13:43,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1981940668, now seen corresponding path program 1 times [2023-08-04 07:13:43,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:13:43,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838605822] [2023-08-04 07:13:43,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:13:43,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:13:43,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:13:43,337 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 07:13:43,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:13:43,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838605822] [2023-08-04 07:13:43,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838605822] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:13:43,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423029002] [2023-08-04 07:13:43,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:13:43,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:13:43,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:13:43,340 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 07:13:43,342 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 07:13:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:13:43,416 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 23 conjunts are in the unsatisfiable core [2023-08-04 07:13:43,418 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:13:43,524 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 07:13:43,525 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:13:43,668 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 07:13:43,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423029002] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:13:43,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:13:43,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 6] total 14 [2023-08-04 07:13:43,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141173820] [2023-08-04 07:13:43,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:13:43,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-04 07:13:43,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:13:43,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-04 07:13:43,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2023-08-04 07:13:43,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 162 [2023-08-04 07:13:43,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 76 transitions, 590 flow. Second operand has 15 states, 15 states have (on average 79.33333333333333) internal successors, (1190), 15 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:43,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:13:43,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 162 [2023-08-04 07:13:43,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:13:44,549 INFO L124 PetriNetUnfolderBase]: 4439/6856 cut-off events. [2023-08-04 07:13:44,549 INFO L125 PetriNetUnfolderBase]: For 24218/24502 co-relation queries the response was YES. [2023-08-04 07:13:44,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29974 conditions, 6856 events. 4439/6856 cut-off events. For 24218/24502 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 42748 event pairs, 164 based on Foata normal form. 345/7062 useless extension candidates. Maximal degree in co-relation 29869. Up to 2680 conditions per place. [2023-08-04 07:13:44,590 INFO L140 encePairwiseOnDemand]: 151/162 looper letters, 129 selfloop transitions, 52 changer transitions 88/279 dead transitions. [2023-08-04 07:13:44,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 279 transitions, 2562 flow [2023-08-04 07:13:44,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-04 07:13:44,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-04 07:13:44,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1318 transitions. [2023-08-04 07:13:44,594 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5423868312757202 [2023-08-04 07:13:44,594 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1318 transitions. [2023-08-04 07:13:44,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1318 transitions. [2023-08-04 07:13:44,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:13:44,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1318 transitions. [2023-08-04 07:13:44,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 87.86666666666666) internal successors, (1318), 15 states have internal predecessors, (1318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:44,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 162.0) internal successors, (2592), 16 states have internal predecessors, (2592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:44,602 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 162.0) internal successors, (2592), 16 states have internal predecessors, (2592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:44,602 INFO L175 Difference]: Start difference. First operand has 68 places, 76 transitions, 590 flow. Second operand 15 states and 1318 transitions. [2023-08-04 07:13:44,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 279 transitions, 2562 flow [2023-08-04 07:13:44,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 279 transitions, 2436 flow, removed 36 selfloop flow, removed 3 redundant places. [2023-08-04 07:13:44,756 INFO L231 Difference]: Finished difference. Result has 88 places, 107 transitions, 959 flow [2023-08-04 07:13:44,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=959, PETRI_PLACES=88, PETRI_TRANSITIONS=107} [2023-08-04 07:13:44,757 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 53 predicate places. [2023-08-04 07:13:44,757 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 107 transitions, 959 flow [2023-08-04 07:13:44,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 79.33333333333333) internal successors, (1190), 15 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:44,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:13:44,757 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] [2023-08-04 07:13:44,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-08-04 07:13:44,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-04 07:13:44,965 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:13:44,965 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:13:44,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1697239930, now seen corresponding path program 1 times [2023-08-04 07:13:44,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:13:44,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236704163] [2023-08-04 07:13:44,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:13:44,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:13:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 07:13:44,985 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 07:13:44,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 07:13:45,010 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 07:13:45,010 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 07:13:45,011 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-08-04 07:13:45,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-04 07:13:45,011 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:13:45,012 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE (1/2) [2023-08-04 07:13:45,013 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 07:13:45,014 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 07:13:45,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 07:13:45 BasicIcfg [2023-08-04 07:13:45,077 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 07:13:45,078 INFO L158 Benchmark]: Toolchain (without parser) took 13427.35ms. Allocated memory was 524.3MB in the beginning and 629.1MB in the end (delta: 104.9MB). Free memory was 475.6MB in the beginning and 313.5MB in the end (delta: 162.1MB). Peak memory consumption was 268.5MB. Max. memory is 16.0GB. [2023-08-04 07:13:45,078 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 375.4MB. Free memory is still 328.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 07:13:45,078 INFO L158 Benchmark]: CACSL2BoogieTranslator took 379.34ms. Allocated memory is still 524.3MB. Free memory was 475.3MB in the beginning and 455.3MB in the end (delta: 20.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-08-04 07:13:45,078 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.89ms. Allocated memory is still 524.3MB. Free memory was 455.3MB in the beginning and 453.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 07:13:45,079 INFO L158 Benchmark]: Boogie Preprocessor took 19.03ms. Allocated memory is still 524.3MB. Free memory was 453.2MB in the beginning and 451.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 07:13:45,079 INFO L158 Benchmark]: RCFGBuilder took 398.06ms. Allocated memory is still 524.3MB. Free memory was 451.5MB in the beginning and 437.4MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-04 07:13:45,079 INFO L158 Benchmark]: TraceAbstraction took 12592.64ms. Allocated memory was 524.3MB in the beginning and 629.1MB in the end (delta: 104.9MB). Free memory was 436.5MB in the beginning and 313.5MB in the end (delta: 123.1MB). Peak memory consumption was 228.6MB. Max. memory is 16.0GB. [2023-08-04 07:13:45,080 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 375.4MB. Free memory is still 328.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 379.34ms. Allocated memory is still 524.3MB. Free memory was 475.3MB in the beginning and 455.3MB in the end (delta: 20.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 32.89ms. Allocated memory is still 524.3MB. Free memory was 455.3MB in the beginning and 453.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 19.03ms. Allocated memory is still 524.3MB. Free memory was 453.2MB in the beginning and 451.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 398.06ms. Allocated memory is still 524.3MB. Free memory was 451.5MB in the beginning and 437.4MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * TraceAbstraction took 12592.64ms. Allocated memory was 524.3MB in the beginning and 629.1MB in the end (delta: 104.9MB). Free memory was 436.5MB in the beginning and 313.5MB in the end (delta: 123.1MB). Peak memory consumption was 228.6MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.6s, 72 PlacesBefore, 21 PlacesAfterwards, 70 TransitionsBefore, 17 TransitionsAfterwards, 840 CoEnabledTransitionPairs, 5 FixpointIterations, 17 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 62 TotalNumberOfCompositions, 1574 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 954, independent: 895, independent conditional: 0, independent unconditional: 895, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 468, independent: 453, independent conditional: 0, independent unconditional: 453, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 954, independent: 442, independent conditional: 0, independent unconditional: 442, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 468, unknown conditional: 0, unknown unconditional: 468] , Statistics on independence cache: Total cache size (in pairs): 39, Positive cache size: 34, Positive conditional cache size: 0, Positive unconditional cache size: 34, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 60 PlacesBefore, 20 PlacesAfterwards, 56 TransitionsBefore, 15 TransitionsAfterwards, 492 CoEnabledTransitionPairs, 5 FixpointIterations, 17 TrivialSequentialCompositions, 21 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 45 TotalNumberOfCompositions, 991 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 633, independent: 583, independent conditional: 0, independent unconditional: 583, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 257, independent: 250, independent conditional: 0, independent unconditional: 250, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 633, independent: 333, independent conditional: 0, independent unconditional: 333, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 257, unknown conditional: 0, unknown unconditional: 257] , Statistics on independence cache: Total cache size (in pairs): 28, Positive cache size: 25, Positive conditional cache size: 0, Positive unconditional cache size: 25, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 90 PlacesBefore, 35 PlacesAfterwards, 84 TransitionsBefore, 27 TransitionsAfterwards, 2016 CoEnabledTransitionPairs, 5 FixpointIterations, 17 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 66 TotalNumberOfCompositions, 4286 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1895, independent: 1789, independent conditional: 0, independent unconditional: 1789, dependent: 106, dependent conditional: 0, dependent unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1016, independent: 989, independent conditional: 0, independent unconditional: 989, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1895, independent: 800, independent conditional: 0, independent unconditional: 800, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 1016, unknown conditional: 0, unknown unconditional: 1016] , Statistics on independence cache: Total cache size (in pairs): 74, Positive cache size: 63, Positive conditional cache size: 0, Positive unconditional cache size: 63, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L760] 0 pthread_t t2317[2]; [L761] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t2317={5:0}, x=0, y=0] [L761] COND TRUE 0 asdf<2 [L761] FCALL, FORK 0 pthread_create(&t2317[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2317[asdf], ((void *)0), P0, ((void *)0))=-3, t2317={5:0}, x=0, y=0] [L761] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t2317={5:0}, x=0, y=0] [L761] COND TRUE 0 asdf<2 [L761] FCALL, FORK 0 pthread_create(&t2317[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2317[asdf], ((void *)0), P0, ((void *)0))=-2, t2317={5:0}, x=0, y=0] [L761] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2317={5:0}, x=0, y=0] [L761] COND FALSE 0 !(asdf<2) [L762] 0 pthread_t t2318[2]; [L763] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2317={5:0}, t2318={3:0}, x=0, y=0] [L763] COND TRUE 0 asdf<2 [L763] FCALL, FORK 0 pthread_create(&t2318[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2318[asdf], ((void *)0), P1, ((void *)0))=-1, t2317={5:0}, t2318={3:0}, x=0, y=0] [L763] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2317={5:0}, t2318={3:0}, x=0, y=0] [L763] COND TRUE 0 asdf<2 [L763] FCALL, FORK 0 pthread_create(&t2318[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2318[asdf], ((void *)0), P1, ((void *)0))=0, t2317={5:0}, t2318={3:0}, x=0, y=0] [L763] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2317={5:0}, t2318={3:0}, x=0, y=0] [L722] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=1] [L725] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L722] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L730] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L732] 1 return 0; [L725] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L730] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L732] 2 return 0; [L737] 3 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L763] COND FALSE 0 !(asdf<2) [L765] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L767] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, x=1, y=1] [L767] RET 0 assume_abort_if_not(main$tmp_guard0) [L771] 0 main$tmp_guard1 = !(__unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L773] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, x=1, y=1] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 93 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.1s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 54 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 97 IncrementalHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 9 mSDtfsCounter, 97 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=2, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 42 ConstructedInterpolants, 0 QuantifiedInterpolants, 78 SizeOfPredicates, 0 NumberOfNonLiveVariables, 209 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 4/8 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 7 procedures, 107 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.0s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 582 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 507 mSDsluCounter, 101 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 63 mSDsCounter, 111 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1227 IncrementalHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 111 mSolverCounterUnsat, 38 mSDtfsCounter, 1227 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 215 GetRequests, 160 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=959occurred in iteration=9, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 286 NumberOfCodeBlocks, 286 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 317 ConstructedInterpolants, 0 QuantifiedInterpolants, 975 SizeOfPredicates, 6 NumberOfNonLiveVariables, 848 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 19 InterpolantComputations, 5 PerfectInterpolantSequences, 122/149 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 5 procedures, 93 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.4s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 28 IncrementalHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1 mSDtfsCounter, 28 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=1, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-04 07:13:45,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...