/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_safe030_power.oepc_pso.oepc_rmo.oepc_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 07:24:44,957 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 07:24:45,011 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 07:24:45,018 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 07:24:45,019 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 07:24:45,019 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 07:24:45,020 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 07:24:45,048 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 07:24:45,049 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 07:24:45,052 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 07:24:45,052 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 07:24:45,052 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 07:24:45,053 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 07:24:45,053 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 07:24:45,054 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 07:24:45,054 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 07:24:45,054 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 07:24:45,054 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 07:24:45,054 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 07:24:45,054 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 07:24:45,054 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 07:24:45,055 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 07:24:45,055 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 07:24:45,055 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 07:24:45,056 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 07:24:45,056 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 07:24:45,056 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 07:24:45,056 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 07:24:45,057 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 07:24:45,057 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 07:24:45,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 07:24:45,058 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 07:24:45,058 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 07:24:45,058 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 07:24:45,058 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 07:24:45,058 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 07:24:45,058 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 07:24:45,058 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 07:24:45,058 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 07:24:45,058 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 07:24:45,058 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 07:24:45,059 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:24:45,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 07:24:45,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 07:24:45,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 07:24:45,250 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 07:24:45,250 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 07:24:45,251 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe030_power.oepc_pso.oepc_rmo.oepc_bound2.i [2023-08-04 07:24:46,201 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 07:24:46,361 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 07:24:46,361 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe030_power.oepc_pso.oepc_rmo.oepc_bound2.i [2023-08-04 07:24:46,371 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6a2b4f90/0343a09331cd43a9a5d4a8f7a433fc42/FLAG5475e8018 [2023-08-04 07:24:46,381 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6a2b4f90/0343a09331cd43a9a5d4a8f7a433fc42 [2023-08-04 07:24:46,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 07:24:46,384 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 07:24:46,384 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 07:24:46,384 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 07:24:46,386 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 07:24:46,387 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 07:24:46" (1/1) ... [2023-08-04 07:24:46,387 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c347887 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:46, skipping insertion in model container [2023-08-04 07:24:46,388 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 07:24:46" (1/1) ... [2023-08-04 07:24:46,411 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 07:24:46,511 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_safe030_power.oepc_pso.oepc_rmo.oepc_bound2.i[970,983] [2023-08-04 07:24:46,666 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 07:24:46,672 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 07:24:46,679 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_safe030_power.oepc_pso.oepc_rmo.oepc_bound2.i[970,983] [2023-08-04 07:24:46,687 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 07:24:46,688 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 07:24:46,717 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 07:24:46,743 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 07:24:46,743 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 07:24:46,748 INFO L206 MainTranslator]: Completed translation [2023-08-04 07:24:46,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:46 WrapperNode [2023-08-04 07:24:46,749 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 07:24:46,750 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 07:24:46,750 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 07:24:46,750 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 07:24:46,755 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:24:46" (1/1) ... [2023-08-04 07:24:46,787 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:24:46" (1/1) ... [2023-08-04 07:24:46,806 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 167 [2023-08-04 07:24:46,807 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 07:24:46,807 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 07:24:46,807 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 07:24:46,807 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 07:24:46,813 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:46" (1/1) ... [2023-08-04 07:24:46,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:46" (1/1) ... [2023-08-04 07:24:46,816 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:46" (1/1) ... [2023-08-04 07:24:46,816 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:46" (1/1) ... [2023-08-04 07:24:46,822 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:46" (1/1) ... [2023-08-04 07:24:46,824 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:46" (1/1) ... [2023-08-04 07:24:46,826 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:46" (1/1) ... [2023-08-04 07:24:46,827 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:46" (1/1) ... [2023-08-04 07:24:46,829 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 07:24:46,830 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 07:24:46,830 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 07:24:46,830 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 07:24:46,830 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:46" (1/1) ... [2023-08-04 07:24:46,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 07:24:46,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:24:46,860 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:24:46,861 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:24:46,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 07:24:46,897 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 07:24:46,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 07:24:46,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 07:24:46,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 07:24:46,899 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 07:24:46,899 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 07:24:46,899 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 07:24:46,899 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 07:24:46,899 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-04 07:24:46,899 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-04 07:24:46,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 07:24:46,900 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 07:24:46,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 07:24:46,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 07:24:46,901 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:24:46,998 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 07:24:46,999 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 07:24:47,233 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 07:24:47,325 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 07:24:47,325 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-04 07:24:47,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 07:24:47 BoogieIcfgContainer [2023-08-04 07:24:47,326 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 07:24:47,328 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 07:24:47,328 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 07:24:47,331 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 07:24:47,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 07:24:46" (1/3) ... [2023-08-04 07:24:47,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a02732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 07:24:47, skipping insertion in model container [2023-08-04 07:24:47,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:46" (2/3) ... [2023-08-04 07:24:47,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a02732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 07:24:47, skipping insertion in model container [2023-08-04 07:24:47,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 07:24:47" (3/3) ... [2023-08-04 07:24:47,333 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_safe030_power.oepc_pso.oepc_rmo.oepc_bound2.i [2023-08-04 07:24:47,339 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 07:24:47,345 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 07:24:47,345 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-04 07:24:47,345 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 07:24:47,387 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 07:24:47,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 127 transitions, 269 flow [2023-08-04 07:24:47,526 INFO L124 PetriNetUnfolderBase]: 30/446 cut-off events. [2023-08-04 07:24:47,526 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:24:47,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 446 events. 30/446 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1966 event pairs, 0 based on Foata normal form. 0/393 useless extension candidates. Maximal degree in co-relation 267. Up to 16 conditions per place. [2023-08-04 07:24:47,531 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 127 transitions, 269 flow [2023-08-04 07:24:47,537 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 127 transitions, 269 flow [2023-08-04 07:24:47,539 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 07:24:47,549 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 127 transitions, 269 flow [2023-08-04 07:24:47,552 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 127 transitions, 269 flow [2023-08-04 07:24:47,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 127 transitions, 269 flow [2023-08-04 07:24:47,600 INFO L124 PetriNetUnfolderBase]: 30/446 cut-off events. [2023-08-04 07:24:47,600 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:24:47,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 446 events. 30/446 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1966 event pairs, 0 based on Foata normal form. 0/393 useless extension candidates. Maximal degree in co-relation 267. Up to 16 conditions per place. [2023-08-04 07:24:47,606 INFO L119 LiptonReduction]: Number of co-enabled transitions 2728 [2023-08-04 07:24:50,336 INFO L134 LiptonReduction]: Checked pairs total: 6692 [2023-08-04 07:24:50,336 INFO L136 LiptonReduction]: Total number of compositions: 106 [2023-08-04 07:24:50,351 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 07:24:50,356 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;@29266853, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 07:24:50,356 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 07:24:50,359 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 07:24:50,359 INFO L124 PetriNetUnfolderBase]: 1/12 cut-off events. [2023-08-04 07:24:50,359 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:24:50,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:24:50,359 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-04 07:24:50,360 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:24:50,363 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:24:50,363 INFO L85 PathProgramCache]: Analyzing trace with hash 17068243, now seen corresponding path program 1 times [2023-08-04 07:24:50,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:24:50,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329929384] [2023-08-04 07:24:50,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:24:50,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:24:50,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:24:50,675 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:24:50,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:24:50,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329929384] [2023-08-04 07:24:50,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329929384] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:24:50,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:24:50,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 07:24:50,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941251135] [2023-08-04 07:24:50,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:24:50,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:24:50,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:24:50,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:24:50,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 07:24:50,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 233 [2023-08-04 07:24:50,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have 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:24:50,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:24:50,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 233 [2023-08-04 07:24:50,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:24:51,090 INFO L124 PetriNetUnfolderBase]: 1998/3460 cut-off events. [2023-08-04 07:24:51,090 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-04 07:24:51,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6740 conditions, 3460 events. 1998/3460 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 22054 event pairs, 516 based on Foata normal form. 125/3170 useless extension candidates. Maximal degree in co-relation 5694. Up to 2194 conditions per place. [2023-08-04 07:24:51,103 INFO L140 encePairwiseOnDemand]: 229/233 looper letters, 42 selfloop transitions, 2 changer transitions 8/55 dead transitions. [2023-08-04 07:24:51,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 55 transitions, 229 flow [2023-08-04 07:24:51,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:24:51,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:24:51,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2023-08-04 07:24:51,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5464949928469242 [2023-08-04 07:24:51,113 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2023-08-04 07:24:51,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2023-08-04 07:24:51,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:24:51,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2023-08-04 07:24:51,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:24:51,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have 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:24:51,122 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have 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:24:51,123 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 85 flow. Second operand 3 states and 382 transitions. [2023-08-04 07:24:51,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 55 transitions, 229 flow [2023-08-04 07:24:51,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 55 transitions, 229 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 07:24:51,126 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 69 flow [2023-08-04 07:24:51,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2023-08-04 07:24:51,129 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2023-08-04 07:24:51,129 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 69 flow [2023-08-04 07:24:51,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have 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:24:51,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:24:51,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:24:51,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 07:24:51,130 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:24:51,131 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:24:51,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1525615775, now seen corresponding path program 1 times [2023-08-04 07:24:51,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:24:51,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016417377] [2023-08-04 07:24:51,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:24:51,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:24:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:24:51,185 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:24:51,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:24:51,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016417377] [2023-08-04 07:24:51,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016417377] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:24:51,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:24:51,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 07:24:51,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162909798] [2023-08-04 07:24:51,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:24:51,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:24:51,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:24:51,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:24:51,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 07:24:51,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 233 [2023-08-04 07:24:51,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have 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:24:51,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:24:51,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 233 [2023-08-04 07:24:51,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:24:51,386 INFO L124 PetriNetUnfolderBase]: 1350/2121 cut-off events. [2023-08-04 07:24:51,386 INFO L125 PetriNetUnfolderBase]: For 193/193 co-relation queries the response was YES. [2023-08-04 07:24:51,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4465 conditions, 2121 events. 1350/2121 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 10996 event pairs, 1162 based on Foata normal form. 0/1977 useless extension candidates. Maximal degree in co-relation 4450. Up to 2095 conditions per place. [2023-08-04 07:24:51,395 INFO L140 encePairwiseOnDemand]: 230/233 looper letters, 26 selfloop transitions, 2 changer transitions 1/32 dead transitions. [2023-08-04 07:24:51,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 32 transitions, 137 flow [2023-08-04 07:24:51,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:24:51,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:24:51,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2023-08-04 07:24:51,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5021459227467812 [2023-08-04 07:24:51,400 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 351 transitions. [2023-08-04 07:24:51,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 351 transitions. [2023-08-04 07:24:51,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:24:51,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 351 transitions. [2023-08-04 07:24:51,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have 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:24:51,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have 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:24:51,405 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have 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:24:51,407 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 69 flow. Second operand 3 states and 351 transitions. [2023-08-04 07:24:51,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 32 transitions, 137 flow [2023-08-04 07:24:51,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 32 transitions, 131 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 07:24:51,412 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 73 flow [2023-08-04 07:24:51,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2023-08-04 07:24:51,413 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2023-08-04 07:24:51,413 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 73 flow [2023-08-04 07:24:51,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have 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:24:51,414 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:24:51,414 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:24:51,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-04 07:24:51,414 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:24:51,415 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:24:51,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1820999549, now seen corresponding path program 1 times [2023-08-04 07:24:51,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:24:51,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220181887] [2023-08-04 07:24:51,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:24:51,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:24:51,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:24:51,486 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:24:51,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:24:51,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220181887] [2023-08-04 07:24:51,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220181887] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:24:51,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28574835] [2023-08-04 07:24:51,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:24:51,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:24:51,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:24:51,490 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:24:51,493 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:24:51,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:24:51,575 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 07:24:51,578 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:24:51,587 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:24:51,587 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 07:24:51,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28574835] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:24:51,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 07:24:51,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 07:24:51,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749399416] [2023-08-04 07:24:51,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:24:51,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:24:51,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:24:51,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:24:51,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:24:51,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 233 [2023-08-04 07:24:51,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have 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:24:51,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:24:51,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 233 [2023-08-04 07:24:51,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:24:51,834 INFO L124 PetriNetUnfolderBase]: 1176/1811 cut-off events. [2023-08-04 07:24:51,834 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 07:24:51,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3663 conditions, 1811 events. 1176/1811 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8719 event pairs, 1006 based on Foata normal form. 0/1698 useless extension candidates. Maximal degree in co-relation 3647. Up to 1749 conditions per place. [2023-08-04 07:24:51,842 INFO L140 encePairwiseOnDemand]: 230/233 looper letters, 29 selfloop transitions, 2 changer transitions 1/35 dead transitions. [2023-08-04 07:24:51,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 35 transitions, 151 flow [2023-08-04 07:24:51,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:24:51,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:24:51,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2023-08-04 07:24:51,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5064377682403434 [2023-08-04 07:24:51,844 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 354 transitions. [2023-08-04 07:24:51,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 354 transitions. [2023-08-04 07:24:51,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:24:51,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 354 transitions. [2023-08-04 07:24:51,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have 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:24:51,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have 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:24:51,846 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have 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:24:51,847 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 73 flow. Second operand 3 states and 354 transitions. [2023-08-04 07:24:51,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 35 transitions, 151 flow [2023-08-04 07:24:51,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 35 transitions, 147 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 07:24:51,848 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 77 flow [2023-08-04 07:24:51,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2023-08-04 07:24:51,849 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2023-08-04 07:24:51,849 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 77 flow [2023-08-04 07:24:51,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have 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:24:51,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:24:51,850 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:24:51,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-04 07:24:52,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:24:52,055 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:24:52,056 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:24:52,056 INFO L85 PathProgramCache]: Analyzing trace with hash 173606504, now seen corresponding path program 1 times [2023-08-04 07:24:52,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:24:52,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527882404] [2023-08-04 07:24:52,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:24:52,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:24:52,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:24:52,124 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:24:52,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:24:52,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527882404] [2023-08-04 07:24:52,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527882404] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:24:52,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216043956] [2023-08-04 07:24:52,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:24:52,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:24:52,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:24:52,126 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:24:52,128 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:24:52,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:24:52,197 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 07:24:52,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:24:52,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 07:24:52,205 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 07:24:52,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216043956] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:24:52,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 07:24:52,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 07:24:52,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589657156] [2023-08-04 07:24:52,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:24:52,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:24:52,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:24:52,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:24:52,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:24:52,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 233 [2023-08-04 07:24:52,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 77 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have 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:24:52,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:24:52,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 233 [2023-08-04 07:24:52,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:24:52,370 INFO L124 PetriNetUnfolderBase]: 1080/1651 cut-off events. [2023-08-04 07:24:52,370 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 07:24:52,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3391 conditions, 1651 events. 1080/1651 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7523 event pairs, 808 based on Foata normal form. 0/1582 useless extension candidates. Maximal degree in co-relation 3375. Up to 1391 conditions per place. [2023-08-04 07:24:52,376 INFO L140 encePairwiseOnDemand]: 230/233 looper letters, 32 selfloop transitions, 2 changer transitions 1/38 dead transitions. [2023-08-04 07:24:52,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 38 transitions, 167 flow [2023-08-04 07:24:52,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:24:52,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:24:52,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-08-04 07:24:52,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5107296137339056 [2023-08-04 07:24:52,377 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-08-04 07:24:52,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-08-04 07:24:52,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:24:52,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-08-04 07:24:52,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have 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:24:52,382 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have 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:24:52,382 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have 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:24:52,383 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 77 flow. Second operand 3 states and 357 transitions. [2023-08-04 07:24:52,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 38 transitions, 167 flow [2023-08-04 07:24:52,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 38 transitions, 163 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 07:24:52,385 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 81 flow [2023-08-04 07:24:52,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-08-04 07:24:52,386 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2023-08-04 07:24:52,386 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 81 flow [2023-08-04 07:24:52,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have 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:24:52,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:24:52,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:24:52,393 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:24:52,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-08-04 07:24:52,591 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:24:52,591 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:24:52,591 INFO L85 PathProgramCache]: Analyzing trace with hash -583566805, now seen corresponding path program 1 times [2023-08-04 07:24:52,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:24:52,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184929534] [2023-08-04 07:24:52,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:24:52,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:24:52,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:24:52,664 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 07:24:52,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:24:52,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184929534] [2023-08-04 07:24:52,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184929534] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:24:52,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837066786] [2023-08-04 07:24:52,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:24:52,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:24:52,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:24:52,683 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:24:52,751 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:24:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:24:52,828 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 07:24:52,829 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:24:52,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 07:24:52,848 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:24:52,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 07:24:52,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837066786] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:24:52,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:24:52,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 07:24:52,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001753615] [2023-08-04 07:24:52,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:24:52,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 07:24:52,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:24:52,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 07:24:52,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:24:52,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 233 [2023-08-04 07:24:52,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 81 flow. Second operand has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have 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:24:52,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:24:52,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 233 [2023-08-04 07:24:52,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:24:52,915 INFO L124 PetriNetUnfolderBase]: 6/21 cut-off events. [2023-08-04 07:24:52,915 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:24:52,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 21 events. 6/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 31 event pairs, 0 based on Foata normal form. 4/25 useless extension candidates. Maximal degree in co-relation 47. Up to 14 conditions per place. [2023-08-04 07:24:52,916 INFO L140 encePairwiseOnDemand]: 230/233 looper letters, 0 selfloop transitions, 0 changer transitions 12/12 dead transitions. [2023-08-04 07:24:52,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 12 transitions, 51 flow [2023-08-04 07:24:52,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 07:24:52,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 07:24:52,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 436 transitions. [2023-08-04 07:24:52,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4678111587982833 [2023-08-04 07:24:52,917 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 436 transitions. [2023-08-04 07:24:52,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 436 transitions. [2023-08-04 07:24:52,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:24:52,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 436 transitions. [2023-08-04 07:24:52,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have 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:24:52,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have 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:24:52,921 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have 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:24:52,921 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 81 flow. Second operand 4 states and 436 transitions. [2023-08-04 07:24:52,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 12 transitions, 51 flow [2023-08-04 07:24:52,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 12 transitions, 49 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 07:24:52,921 INFO L231 Difference]: Finished difference. Result has 19 places, 0 transitions, 0 flow [2023-08-04 07:24:52,921 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=19, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=8, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=19, PETRI_TRANSITIONS=0} [2023-08-04 07:24:52,923 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -22 predicate places. [2023-08-04 07:24:52,923 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 0 transitions, 0 flow [2023-08-04 07:24:52,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have 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:24:52,926 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-04 07:24:52,926 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-04 07:24:52,926 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-04 07:24:52,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-04 07:24:53,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:24:53,134 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-08-04 07:24:53,136 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-04 07:24:53,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 127 transitions, 269 flow [2023-08-04 07:24:53,174 INFO L124 PetriNetUnfolderBase]: 30/446 cut-off events. [2023-08-04 07:24:53,174 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:24:53,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 446 events. 30/446 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1966 event pairs, 0 based on Foata normal form. 0/393 useless extension candidates. Maximal degree in co-relation 267. Up to 16 conditions per place. [2023-08-04 07:24:53,175 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 127 transitions, 269 flow [2023-08-04 07:24:53,176 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 98 transitions, 211 flow [2023-08-04 07:24:53,176 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 07:24:53,176 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 98 transitions, 211 flow [2023-08-04 07:24:53,176 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 98 transitions, 211 flow [2023-08-04 07:24:53,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 98 transitions, 211 flow [2023-08-04 07:24:53,186 INFO L124 PetriNetUnfolderBase]: 6/214 cut-off events. [2023-08-04 07:24:53,186 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:24:53,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 214 events. 6/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 618 event pairs, 0 based on Foata normal form. 0/201 useless extension candidates. Maximal degree in co-relation 151. Up to 8 conditions per place. [2023-08-04 07:24:53,187 INFO L119 LiptonReduction]: Number of co-enabled transitions 1452 [2023-08-04 07:24:55,346 INFO L134 LiptonReduction]: Checked pairs total: 3932 [2023-08-04 07:24:55,346 INFO L136 LiptonReduction]: Total number of compositions: 77 [2023-08-04 07:24:55,347 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 07:24:55,347 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;@29266853, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 07:24:55,347 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 07:24:55,349 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 07:24:55,349 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2023-08-04 07:24:55,349 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:24:55,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:24:55,350 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 07:24:55,350 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 07:24:55,350 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:24:55,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1501739877, now seen corresponding path program 1 times [2023-08-04 07:24:55,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:24:55,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582576851] [2023-08-04 07:24:55,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:24:55,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:24:55,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:24:55,378 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:24:55,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:24:55,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582576851] [2023-08-04 07:24:55,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582576851] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:24:55,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:24:55,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 07:24:55,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006848949] [2023-08-04 07:24:55,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:24:55,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:24:55,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:24:55,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:24:55,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 07:24:55,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 204 [2023-08-04 07:24:55,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have 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:24:55,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:24:55,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 204 [2023-08-04 07:24:55,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:24:55,462 INFO L124 PetriNetUnfolderBase]: 484/900 cut-off events. [2023-08-04 07:24:55,462 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-04 07:24:55,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1841 conditions, 900 events. 484/900 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4698 event pairs, 360 based on Foata normal form. 0/783 useless extension candidates. Maximal degree in co-relation 1822. Up to 790 conditions per place. [2023-08-04 07:24:55,466 INFO L140 encePairwiseOnDemand]: 201/204 looper letters, 24 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2023-08-04 07:24:55,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 32 transitions, 131 flow [2023-08-04 07:24:55,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:24:55,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:24:55,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2023-08-04 07:24:55,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5686274509803921 [2023-08-04 07:24:55,468 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions. [2023-08-04 07:24:55,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions. [2023-08-04 07:24:55,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:24:55,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions. [2023-08-04 07:24:55,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have 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:24:55,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have 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:24:55,470 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have 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:24:55,470 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 69 flow. Second operand 3 states and 348 transitions. [2023-08-04 07:24:55,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 32 transitions, 131 flow [2023-08-04 07:24:55,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 32 transitions, 131 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 07:24:55,471 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 77 flow [2023-08-04 07:24:55,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2023-08-04 07:24:55,471 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2023-08-04 07:24:55,471 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 77 flow [2023-08-04 07:24:55,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have 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:24:55,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:24:55,472 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 07:24:55,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 07:24:55,472 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 07:24:55,472 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:24:55,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1500270293, now seen corresponding path program 1 times [2023-08-04 07:24:55,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:24:55,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441896365] [2023-08-04 07:24:55,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:24:55,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:24:55,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 07:24:55,482 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 07:24:55,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 07:24:55,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 07:24:55,504 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 07:24:55,504 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-04 07:24:55,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-04 07:24:55,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-04 07:24:55,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 07:24:55,505 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 07:24:55,506 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN,UNKNOWN (2/2) [2023-08-04 07:24:55,506 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 07:24:55,506 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 07:24:55,526 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 07:24:55,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 152 transitions, 340 flow [2023-08-04 07:24:55,610 INFO L124 PetriNetUnfolderBase]: 93/1375 cut-off events. [2023-08-04 07:24:55,610 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 07:24:55,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1473 conditions, 1375 events. 93/1375 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9414 event pairs, 0 based on Foata normal form. 0/1214 useless extension candidates. Maximal degree in co-relation 998. Up to 54 conditions per place. [2023-08-04 07:24:55,614 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 152 transitions, 340 flow [2023-08-04 07:24:55,618 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 152 transitions, 340 flow [2023-08-04 07:24:55,618 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 07:24:55,618 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 152 transitions, 340 flow [2023-08-04 07:24:55,619 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 152 transitions, 340 flow [2023-08-04 07:24:55,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 152 transitions, 340 flow [2023-08-04 07:24:55,696 INFO L124 PetriNetUnfolderBase]: 93/1375 cut-off events. [2023-08-04 07:24:55,696 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 07:24:55,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1473 conditions, 1375 events. 93/1375 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9414 event pairs, 0 based on Foata normal form. 0/1214 useless extension candidates. Maximal degree in co-relation 998. Up to 54 conditions per place. [2023-08-04 07:24:55,717 INFO L119 LiptonReduction]: Number of co-enabled transitions 6560 [2023-08-04 07:24:58,392 INFO L134 LiptonReduction]: Checked pairs total: 19526 [2023-08-04 07:24:58,393 INFO L136 LiptonReduction]: Total number of compositions: 115 [2023-08-04 07:24:58,394 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 07:24:58,394 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;@29266853, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 07:24:58,394 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-04 07:24:58,395 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 07:24:58,395 INFO L124 PetriNetUnfolderBase]: 1/12 cut-off events. [2023-08-04 07:24:58,395 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:24:58,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:24:58,396 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-04 07:24:58,396 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 07:24:58,396 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:24:58,396 INFO L85 PathProgramCache]: Analyzing trace with hash 28430088, now seen corresponding path program 1 times [2023-08-04 07:24:58,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:24:58,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018584338] [2023-08-04 07:24:58,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:24:58,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:24:58,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:24:58,466 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:24:58,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:24:58,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018584338] [2023-08-04 07:24:58,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018584338] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:24:58,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:24:58,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 07:24:58,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210441751] [2023-08-04 07:24:58,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:24:58,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:24:58,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:24:58,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:24:58,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 07:24:58,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 267 [2023-08-04 07:24:58,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have 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:24:58,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:24:58,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 267 [2023-08-04 07:24:58,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:25:39,449 INFO L124 PetriNetUnfolderBase]: 416570/552220 cut-off events. [2023-08-04 07:25:39,450 INFO L125 PetriNetUnfolderBase]: For 7769/7769 co-relation queries the response was YES. [2023-08-04 07:25:40,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1085660 conditions, 552220 events. 416570/552220 cut-off events. For 7769/7769 co-relation queries the response was YES. Maximal size of possible extension queue 13877. Compared 4122317 event pairs, 69920 based on Foata normal form. 11907/502286 useless extension candidates. Maximal degree in co-relation 914307. Up to 483093 conditions per place. [2023-08-04 07:25:42,289 INFO L140 encePairwiseOnDemand]: 261/267 looper letters, 71 selfloop transitions, 3 changer transitions 0/86 dead transitions. [2023-08-04 07:25:42,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 86 transitions, 377 flow [2023-08-04 07:25:42,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:25:42,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:25:42,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 459 transitions. [2023-08-04 07:25:42,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5730337078651685 [2023-08-04 07:25:42,293 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 459 transitions. [2023-08-04 07:25:42,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 459 transitions. [2023-08-04 07:25:42,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:25:42,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 459 transitions. [2023-08-04 07:25:42,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have 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:25:42,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have 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:25:42,296 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have 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:25:42,296 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 144 flow. Second operand 3 states and 459 transitions. [2023-08-04 07:25:42,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 86 transitions, 377 flow [2023-08-04 07:25:42,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 86 transitions, 371 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-04 07:25:42,307 INFO L231 Difference]: Finished difference. Result has 69 places, 55 transitions, 157 flow [2023-08-04 07:25:42,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=157, PETRI_PLACES=69, PETRI_TRANSITIONS=55} [2023-08-04 07:25:42,308 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 3 predicate places. [2023-08-04 07:25:42,308 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 55 transitions, 157 flow [2023-08-04 07:25:42,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have 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:25:42,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:25:42,309 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:25:42,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-04 07:25:42,309 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 07:25:42,309 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:25:42,309 INFO L85 PathProgramCache]: Analyzing trace with hash 628314982, now seen corresponding path program 1 times [2023-08-04 07:25:42,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:25:42,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057770574] [2023-08-04 07:25:42,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:25:42,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:25:42,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:25:42,335 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:25:42,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:25:42,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057770574] [2023-08-04 07:25:42,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057770574] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:25:42,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:25:42,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 07:25:42,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671760269] [2023-08-04 07:25:42,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:25:42,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:25:42,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:25:42,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:25:42,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 07:25:42,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 267 [2023-08-04 07:25:42,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 55 transitions, 157 flow. Second operand has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have 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:25:42,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:25:42,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 267 [2023-08-04 07:25:42,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:26:23,169 INFO L124 PetriNetUnfolderBase]: 406640/538682 cut-off events. [2023-08-04 07:26:23,169 INFO L125 PetriNetUnfolderBase]: For 43186/43186 co-relation queries the response was YES. [2023-08-04 07:26:24,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1130713 conditions, 538682 events. 406640/538682 cut-off events. For 43186/43186 co-relation queries the response was YES. Maximal size of possible extension queue 13633. Compared 3910702 event pairs, 338422 based on Foata normal form. 0/475287 useless extension candidates. Maximal degree in co-relation 743942. Up to 510975 conditions per place. [2023-08-04 07:26:26,171 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 46 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-08-04 07:26:26,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 60 transitions, 266 flow [2023-08-04 07:26:26,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:26:26,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:26:26,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2023-08-04 07:26:26,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5230961298377028 [2023-08-04 07:26:26,174 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 419 transitions. [2023-08-04 07:26:26,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 419 transitions. [2023-08-04 07:26:26,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:26:26,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 419 transitions. [2023-08-04 07:26:26,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have 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:26:26,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have 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:26:26,178 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have 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:26:26,178 INFO L175 Difference]: Start difference. First operand has 69 places, 55 transitions, 157 flow. Second operand 3 states and 419 transitions. [2023-08-04 07:26:26,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 60 transitions, 266 flow [2023-08-04 07:26:26,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 60 transitions, 262 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 07:26:26,180 INFO L231 Difference]: Finished difference. Result has 71 places, 56 transitions, 166 flow [2023-08-04 07:26:26,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=71, PETRI_TRANSITIONS=56} [2023-08-04 07:26:26,180 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 5 predicate places. [2023-08-04 07:26:26,180 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 56 transitions, 166 flow [2023-08-04 07:26:26,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have 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:26:26,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:26:26,181 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:26:26,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-04 07:26:26,181 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 07:26:26,181 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:26:26,181 INFO L85 PathProgramCache]: Analyzing trace with hash -749707593, now seen corresponding path program 1 times [2023-08-04 07:26:26,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:26:26,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171755057] [2023-08-04 07:26:26,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:26:26,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:26:26,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 07:26:26,203 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 07:26:26,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 07:26:26,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 07:26:26,211 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 07:26:26,211 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-04 07:26:26,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-04 07:26:26,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-04 07:26:26,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-04 07:26:26,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-04 07:26:26,212 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-08-04 07:26:26,212 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-04 07:26:26,213 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 07:26:26,213 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 07:26:26,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 07:26:26 BasicIcfg [2023-08-04 07:26:26,236 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 07:26:26,236 INFO L158 Benchmark]: Toolchain (without parser) took 99852.76ms. Allocated memory was 631.2MB in the beginning and 15.9GB in the end (delta: 15.3GB). Free memory was 575.1MB in the beginning and 8.8GB in the end (delta: -8.2GB). Peak memory consumption was 7.1GB. Max. memory is 16.0GB. [2023-08-04 07:26:26,236 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 381.7MB. Free memory is still 327.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 07:26:26,237 INFO L158 Benchmark]: CACSL2BoogieTranslator took 364.88ms. Allocated memory is still 631.2MB. Free memory was 574.7MB in the beginning and 551.3MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-04 07:26:26,237 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.95ms. Allocated memory is still 631.2MB. Free memory was 551.3MB in the beginning and 548.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 07:26:26,237 INFO L158 Benchmark]: Boogie Preprocessor took 22.25ms. Allocated memory is still 631.2MB. Free memory was 548.6MB in the beginning and 546.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 07:26:26,237 INFO L158 Benchmark]: RCFGBuilder took 496.49ms. Allocated memory is still 631.2MB. Free memory was 546.5MB in the beginning and 570.2MB in the end (delta: -23.7MB). Peak memory consumption was 23.0MB. Max. memory is 16.0GB. [2023-08-04 07:26:26,237 INFO L158 Benchmark]: TraceAbstraction took 98907.77ms. Allocated memory was 631.2MB in the beginning and 15.9GB in the end (delta: 15.3GB). Free memory was 570.2MB in the beginning and 8.8GB in the end (delta: -8.2GB). Peak memory consumption was 7.1GB. Max. memory is 16.0GB. [2023-08-04 07:26:26,238 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.11ms. Allocated memory is still 381.7MB. Free memory is still 327.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 364.88ms. Allocated memory is still 631.2MB. Free memory was 574.7MB in the beginning and 551.3MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 56.95ms. Allocated memory is still 631.2MB. Free memory was 551.3MB in the beginning and 548.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 22.25ms. Allocated memory is still 631.2MB. Free memory was 548.6MB in the beginning and 546.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 496.49ms. Allocated memory is still 631.2MB. Free memory was 546.5MB in the beginning and 570.2MB in the end (delta: -23.7MB). Peak memory consumption was 23.0MB. Max. memory is 16.0GB. * TraceAbstraction took 98907.77ms. Allocated memory was 631.2MB in the beginning and 15.9GB in the end (delta: 15.3GB). Free memory was 570.2MB in the beginning and 8.8GB in the end (delta: -8.2GB). Peak memory consumption was 7.1GB. 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: 2.8s, 129 PlacesBefore, 41 PlacesAfterwards, 127 TransitionsBefore, 35 TransitionsAfterwards, 2728 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 4 ChoiceCompositions, 106 TotalNumberOfCompositions, 6692 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2925, independent: 2760, independent conditional: 0, independent unconditional: 2760, dependent: 165, dependent conditional: 0, dependent unconditional: 165, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1394, independent: 1359, independent conditional: 0, independent unconditional: 1359, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2925, independent: 1401, independent conditional: 0, independent unconditional: 1401, dependent: 130, dependent conditional: 0, dependent unconditional: 130, unknown: 1394, unknown conditional: 0, unknown unconditional: 1394] , Statistics on independence cache: Total cache size (in pairs): 131, Positive cache size: 118, Positive conditional cache size: 0, Positive unconditional cache size: 118, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 103 PlacesBefore, 34 PlacesAfterwards, 98 TransitionsBefore, 27 TransitionsAfterwards, 1452 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 77 TotalNumberOfCompositions, 3932 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1767, independent: 1624, independent conditional: 0, independent unconditional: 1624, dependent: 143, dependent conditional: 0, dependent unconditional: 143, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 706, independent: 689, independent conditional: 0, independent unconditional: 689, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1767, independent: 935, independent conditional: 0, independent unconditional: 935, dependent: 126, dependent conditional: 0, dependent unconditional: 126, unknown: 706, unknown conditional: 0, unknown unconditional: 706] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 73, Positive conditional cache size: 0, Positive unconditional cache size: 73, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 160 PlacesBefore, 66 PlacesAfterwards, 152 TransitionsBefore, 54 TransitionsAfterwards, 6560 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 61 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 4 ChoiceCompositions, 115 TotalNumberOfCompositions, 19526 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7238, independent: 6944, independent conditional: 0, independent unconditional: 6944, dependent: 294, dependent conditional: 0, dependent unconditional: 294, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3072, independent: 3010, independent conditional: 0, independent unconditional: 3010, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7238, independent: 3934, independent conditional: 0, independent unconditional: 3934, dependent: 232, dependent conditional: 0, dependent unconditional: 232, unknown: 3072, unknown conditional: 0, unknown unconditional: 3072] , Statistics on independence cache: Total cache size (in pairs): 313, Positive cache size: 286, Positive conditional cache size: 0, Positive unconditional cache size: 286, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, 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: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L717] 0 int z = 0; [L718] 0 _Bool z$flush_delayed; [L719] 0 int z$mem_tmp; [L720] 0 _Bool z$r_buff0_thd0; [L721] 0 _Bool z$r_buff0_thd1; [L722] 0 _Bool z$r_buff0_thd2; [L723] 0 _Bool z$r_buff0_thd3; [L724] 0 _Bool z$r_buff1_thd0; [L725] 0 _Bool z$r_buff1_thd1; [L726] 0 _Bool z$r_buff1_thd2; [L727] 0 _Bool z$r_buff1_thd3; [L728] 0 _Bool z$read_delayed; [L729] 0 int *z$read_delayed_var; [L730] 0 int z$w_buff0; [L731] 0 _Bool z$w_buff0_used; [L732] 0 int z$w_buff1; [L733] 0 _Bool z$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L816] 0 pthread_t t2489[2]; [L817] 0 int asdf=0; VAL [__unbuffered_cnt=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t2489={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L817] COND TRUE 0 asdf<2 [L817] FCALL, FORK 0 pthread_create(&t2489[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2489[asdf], ((void *)0), P0, ((void *)0))=-2, t2489={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L817] 0 asdf++ VAL [__unbuffered_cnt=0, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t2489={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L817] COND TRUE 0 asdf<2 [L817] FCALL, FORK 0 pthread_create(&t2489[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2489[asdf], ((void *)0), P0, ((void *)0))=-1, t2489={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L739] 2 z$w_buff1 = z$w_buff0 [L740] 2 z$w_buff0 = 2 [L741] 2 z$w_buff1_used = z$w_buff0_used [L742] 2 z$w_buff0_used = (_Bool)1 [L743] CALL 2 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND TRUE 2 !expression [L18] 2 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=0, expression=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=2, z$w_buff1_used=1, z=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 148 locations, 6 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: 5.7s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 109 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 73 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 266 IncrementalHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 0 mSDtfsCounter, 266 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=0, InterpolantAutomatonStates: 16, 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.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 89 NumberOfCodeBlocks, 89 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 148 SizeOfPredicates, 0 NumberOfNonLiveVariables, 576 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 9 InterpolantComputations, 4 PerfectInterpolantSequences, 10/15 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 10 procedures, 173 locations, 7 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: 90.7s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 87.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 43 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 168 IncrementalHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 2 mSDtfsCounter, 168 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=2, InterpolantAutomatonStates: 6, 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.1s InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 17 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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 7 procedures, 148 locations, 6 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: 2.4s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 52 IncrementalHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 0 mSDtfsCounter, 52 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=77occurred 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, 12 NumberOfCodeBlocks, 12 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 5 ConstructedInterpolants, 0 QuantifiedInterpolants, 7 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:26:26,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...