/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-Before.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 04:59:26,742 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 04:59:26,744 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 04:59:26,811 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 04:59:26,812 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 04:59:26,814 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 04:59:26,815 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 04:59:26,818 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 04:59:26,819 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 04:59:26,822 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 04:59:26,823 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 04:59:26,823 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 04:59:26,824 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 04:59:26,825 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 04:59:26,826 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 04:59:26,828 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 04:59:26,828 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 04:59:26,829 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 04:59:26,830 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 04:59:26,834 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 04:59:26,835 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 04:59:26,835 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 04:59:26,836 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 04:59:26,837 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 04:59:26,841 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 04:59:26,842 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 04:59:26,842 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 04:59:26,843 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 04:59:26,843 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 04:59:26,843 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 04:59:26,844 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 04:59:26,844 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 04:59:26,845 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 04:59:26,845 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 04:59:26,846 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 04:59:26,847 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 04:59:26,847 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 04:59:26,847 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 04:59:26,847 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 04:59:26,848 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 04:59:26,848 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 04:59:26,849 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-Before.epf [2022-01-19 04:59:26,871 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 04:59:26,871 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 04:59:26,872 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 04:59:26,872 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 04:59:26,873 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 04:59:26,873 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 04:59:26,873 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 04:59:26,873 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 04:59:26,873 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 04:59:26,873 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 04:59:26,873 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 04:59:26,874 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 04:59:26,874 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 04:59:26,874 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 04:59:26,874 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 04:59:26,874 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 04:59:26,874 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 04:59:26,874 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 04:59:26,874 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 04:59:26,874 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 04:59:26,874 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 04:59:26,874 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 04:59:26,874 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 04:59:26,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 04:59:26,875 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 04:59:26,875 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 04:59:26,875 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 04:59:26,876 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 04:59:26,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 04:59:26,876 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 04:59:26,876 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 04:59:26,876 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 04:59:26,876 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-01-19 04:59:27,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 04:59:27,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 04:59:27,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 04:59:27,068 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 04:59:27,069 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 04:59:27,070 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-01-19 04:59:27,123 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/586b19cb5/239c544961e247538a8cb5a83a206b15/FLAG85df8fb7a [2022-01-19 04:59:27,477 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 04:59:27,478 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-01-19 04:59:27,486 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/586b19cb5/239c544961e247538a8cb5a83a206b15/FLAG85df8fb7a [2022-01-19 04:59:27,494 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/586b19cb5/239c544961e247538a8cb5a83a206b15 [2022-01-19 04:59:27,496 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 04:59:27,497 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 04:59:27,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 04:59:27,498 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 04:59:27,499 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 04:59:27,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 04:59:27" (1/1) ... [2022-01-19 04:59:27,500 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54f189b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:59:27, skipping insertion in model container [2022-01-19 04:59:27,501 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 04:59:27" (1/1) ... [2022-01-19 04:59:27,504 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 04:59:27,529 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 04:59:27,668 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-01-19 04:59:27,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 04:59:27,769 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 04:59:27,776 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-01-19 04:59:27,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 04:59:27,822 INFO L208 MainTranslator]: Completed translation [2022-01-19 04:59:27,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:59:27 WrapperNode [2022-01-19 04:59:27,822 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 04:59:27,823 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 04:59:27,823 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 04:59:27,823 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 04:59:27,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:59:27" (1/1) ... [2022-01-19 04:59:27,837 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:59:27" (1/1) ... [2022-01-19 04:59:27,856 INFO L137 Inliner]: procedures = 176, calls = 52, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 273 [2022-01-19 04:59:27,857 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 04:59:27,857 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 04:59:27,857 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 04:59:27,857 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 04:59:27,862 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:59:27" (1/1) ... [2022-01-19 04:59:27,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:59:27" (1/1) ... [2022-01-19 04:59:27,865 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:59:27" (1/1) ... [2022-01-19 04:59:27,865 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:59:27" (1/1) ... [2022-01-19 04:59:27,870 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:59:27" (1/1) ... [2022-01-19 04:59:27,872 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:59:27" (1/1) ... [2022-01-19 04:59:27,874 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:59:27" (1/1) ... [2022-01-19 04:59:27,876 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 04:59:27,877 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 04:59:27,877 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 04:59:27,877 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 04:59:27,877 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:59:27" (1/1) ... [2022-01-19 04:59:27,882 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 04:59:27,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:59:27,898 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) [2022-01-19 04:59:27,909 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 [2022-01-19 04:59:27,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 04:59:27,927 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 04:59:27,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 04:59:27,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 04:59:27,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 04:59:27,928 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-01-19 04:59:27,928 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-01-19 04:59:27,928 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-01-19 04:59:27,928 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-01-19 04:59:27,930 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-01-19 04:59:27,930 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-01-19 04:59:27,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 04:59:27,930 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 04:59:27,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 04:59:27,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 04:59:27,932 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 04:59:28,018 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 04:59:28,019 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 04:59:28,364 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 04:59:28,561 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 04:59:28,561 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-19 04:59:28,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 04:59:28 BoogieIcfgContainer [2022-01-19 04:59:28,563 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 04:59:28,565 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 04:59:28,565 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 04:59:28,567 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 04:59:28,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 04:59:27" (1/3) ... [2022-01-19 04:59:28,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@462bbc40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 04:59:28, skipping insertion in model container [2022-01-19 04:59:28,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:59:27" (2/3) ... [2022-01-19 04:59:28,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@462bbc40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 04:59:28, skipping insertion in model container [2022-01-19 04:59:28,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 04:59:28" (3/3) ... [2022-01-19 04:59:28,569 INFO L111 eAbstractionObserver]: Analyzing ICFG safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-01-19 04:59:28,573 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 04:59:28,573 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-19 04:59:28,573 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 04:59:28,606 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,607 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,607 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,607 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,607 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,607 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,607 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,607 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,607 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,607 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,608 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,608 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,608 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,608 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,609 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,609 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,609 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,609 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,609 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,609 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,610 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,610 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,610 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,611 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,611 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,611 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,611 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,611 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,612 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,612 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,613 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,613 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,613 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,613 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,613 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,613 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,613 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,613 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,614 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,614 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,614 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,614 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,614 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,614 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,614 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,614 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,614 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,614 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,614 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,615 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,615 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,615 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,615 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,616 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,616 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,616 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,616 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,616 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,616 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,616 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,617 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,617 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,617 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,617 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,617 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,617 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,617 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,617 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,617 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,618 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,618 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,618 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,618 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,618 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,618 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,619 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,619 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,619 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,619 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,619 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,619 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,619 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,620 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,620 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,620 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,620 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,623 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,623 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,624 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,624 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,624 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,626 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,629 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,629 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,630 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,630 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,631 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,631 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,631 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,631 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,631 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,631 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,631 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,631 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,631 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,631 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,631 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,632 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,632 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,633 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,633 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,633 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,633 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,633 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,633 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,633 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,633 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,633 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:59:28,633 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-19 04:59:28,665 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 04:59:28,669 INFO L339 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=false, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 04:59:28,669 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-01-19 04:59:28,676 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 239 flow [2022-01-19 04:59:28,717 INFO L129 PetriNetUnfolder]: 2/109 cut-off events. [2022-01-19 04:59:28,718 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 04:59:28,720 INFO L84 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 48 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-01-19 04:59:28,720 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 239 flow [2022-01-19 04:59:28,724 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow [2022-01-19 04:59:28,731 INFO L129 PetriNetUnfolder]: 0/43 cut-off events. [2022-01-19 04:59:28,731 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 04:59:28,731 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:59:28,732 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:59:28,732 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:59:28,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:59:28,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1234575711, now seen corresponding path program 1 times [2022-01-19 04:59:28,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:59:28,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161614924] [2022-01-19 04:59:28,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:59:28,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:59:28,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:59:28,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:59:28,972 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:59:28,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161614924] [2022-01-19 04:59:28,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161614924] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:59:28,973 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:59:28,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 04:59:28,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663273638] [2022-01-19 04:59:28,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:59:28,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 04:59:28,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:59:28,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 04:59:28,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 04:59:28,999 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 112 [2022-01-19 04:59:29,001 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 109 transitions, 227 flow. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:29,002 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:59:29,002 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 112 [2022-01-19 04:59:29,002 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:59:29,133 INFO L129 PetriNetUnfolder]: 58/484 cut-off events. [2022-01-19 04:59:29,134 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-01-19 04:59:29,137 INFO L84 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 484 events. 58/484 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2505 event pairs, 44 based on Foata normal form. 15/466 useless extension candidates. Maximal degree in co-relation 563. Up to 79 conditions per place. [2022-01-19 04:59:29,140 INFO L132 encePairwiseOnDemand]: 107/112 looper letters, 14 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2022-01-19 04:59:29,140 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 111 transitions, 269 flow [2022-01-19 04:59:29,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 04:59:29,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 04:59:29,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2022-01-19 04:59:29,154 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9375 [2022-01-19 04:59:29,154 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 315 transitions. [2022-01-19 04:59:29,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 315 transitions. [2022-01-19 04:59:29,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:59:29,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 315 transitions. [2022-01-19 04:59:29,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:29,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:29,173 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:29,174 INFO L186 Difference]: Start difference. First operand has 117 places, 109 transitions, 227 flow. Second operand 3 states and 315 transitions. [2022-01-19 04:59:29,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 111 transitions, 269 flow [2022-01-19 04:59:29,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 111 transitions, 264 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-19 04:59:29,181 INFO L242 Difference]: Finished difference. Result has 114 places, 105 transitions, 220 flow [2022-01-19 04:59:29,183 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=114, PETRI_TRANSITIONS=105} [2022-01-19 04:59:29,186 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, -3 predicate places. [2022-01-19 04:59:29,186 INFO L470 AbstractCegarLoop]: Abstraction has has 114 places, 105 transitions, 220 flow [2022-01-19 04:59:29,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:29,187 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:59:29,187 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:59:29,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 04:59:29,188 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:59:29,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:59:29,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1218056957, now seen corresponding path program 1 times [2022-01-19 04:59:29,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:59:29,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101292225] [2022-01-19 04:59:29,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:59:29,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:59:29,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:59:29,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:59:29,442 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:59:29,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101292225] [2022-01-19 04:59:29,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101292225] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:59:29,442 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:59:29,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:59:29,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883255828] [2022-01-19 04:59:29,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:59:29,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:59:29,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:59:29,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:59:29,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:59:29,445 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2022-01-19 04:59:29,445 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 105 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 90.83333333333333) internal successors, (545), 6 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:29,445 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:59:29,445 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2022-01-19 04:59:29,445 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:59:29,915 INFO L129 PetriNetUnfolder]: 834/2274 cut-off events. [2022-01-19 04:59:29,915 INFO L130 PetriNetUnfolder]: For 103/103 co-relation queries the response was YES. [2022-01-19 04:59:29,920 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3699 conditions, 2274 events. 834/2274 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 17180 event pairs, 193 based on Foata normal form. 0/2201 useless extension candidates. Maximal degree in co-relation 3649. Up to 732 conditions per place. [2022-01-19 04:59:29,927 INFO L132 encePairwiseOnDemand]: 105/112 looper letters, 23 selfloop transitions, 3 changer transitions 57/158 dead transitions. [2022-01-19 04:59:29,927 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 158 transitions, 488 flow [2022-01-19 04:59:29,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 04:59:29,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 04:59:29,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 875 transitions. [2022-01-19 04:59:29,931 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8680555555555556 [2022-01-19 04:59:29,933 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 875 transitions. [2022-01-19 04:59:29,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 875 transitions. [2022-01-19 04:59:29,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:59:29,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 875 transitions. [2022-01-19 04:59:29,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.22222222222223) internal successors, (875), 9 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:29,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:29,939 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:29,939 INFO L186 Difference]: Start difference. First operand has 114 places, 105 transitions, 220 flow. Second operand 9 states and 875 transitions. [2022-01-19 04:59:29,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 158 transitions, 488 flow [2022-01-19 04:59:29,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 158 transitions, 470 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 04:59:29,943 INFO L242 Difference]: Finished difference. Result has 127 places, 95 transitions, 235 flow [2022-01-19 04:59:29,944 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=235, PETRI_PLACES=127, PETRI_TRANSITIONS=95} [2022-01-19 04:59:29,944 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 10 predicate places. [2022-01-19 04:59:29,944 INFO L470 AbstractCegarLoop]: Abstraction has has 127 places, 95 transitions, 235 flow [2022-01-19 04:59:29,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.83333333333333) internal successors, (545), 6 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:29,945 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:59:29,945 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:59:29,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 04:59:29,945 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:59:29,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:59:29,946 INFO L85 PathProgramCache]: Analyzing trace with hash 2123130946, now seen corresponding path program 1 times [2022-01-19 04:59:29,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:59:29,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544993693] [2022-01-19 04:59:29,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:59:29,946 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:59:30,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:59:30,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:59:30,108 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:59:30,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544993693] [2022-01-19 04:59:30,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544993693] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:59:30,108 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:59:30,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:59:30,108 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623030053] [2022-01-19 04:59:30,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:59:30,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:59:30,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:59:30,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:59:30,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:59:30,111 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 112 [2022-01-19 04:59:30,112 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 95 transitions, 235 flow. Second operand has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:30,112 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:59:30,112 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 112 [2022-01-19 04:59:30,112 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:59:30,392 INFO L129 PetriNetUnfolder]: 424/955 cut-off events. [2022-01-19 04:59:30,392 INFO L130 PetriNetUnfolder]: For 715/722 co-relation queries the response was YES. [2022-01-19 04:59:30,394 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2176 conditions, 955 events. 424/955 cut-off events. For 715/722 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5310 event pairs, 100 based on Foata normal form. 30/937 useless extension candidates. Maximal degree in co-relation 2119. Up to 295 conditions per place. [2022-01-19 04:59:30,397 INFO L132 encePairwiseOnDemand]: 106/112 looper letters, 18 selfloop transitions, 2 changer transitions 31/130 dead transitions. [2022-01-19 04:59:30,397 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 130 transitions, 425 flow [2022-01-19 04:59:30,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 04:59:30,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 04:59:30,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 872 transitions. [2022-01-19 04:59:30,399 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8650793650793651 [2022-01-19 04:59:30,399 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 872 transitions. [2022-01-19 04:59:30,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 872 transitions. [2022-01-19 04:59:30,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:59:30,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 872 transitions. [2022-01-19 04:59:30,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.88888888888889) internal successors, (872), 9 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:30,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:30,403 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:30,403 INFO L186 Difference]: Start difference. First operand has 127 places, 95 transitions, 235 flow. Second operand 9 states and 872 transitions. [2022-01-19 04:59:30,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 130 transitions, 425 flow [2022-01-19 04:59:30,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 130 transitions, 408 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-01-19 04:59:30,411 INFO L242 Difference]: Finished difference. Result has 120 places, 95 transitions, 246 flow [2022-01-19 04:59:30,411 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=246, PETRI_PLACES=120, PETRI_TRANSITIONS=95} [2022-01-19 04:59:30,412 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 3 predicate places. [2022-01-19 04:59:30,412 INFO L470 AbstractCegarLoop]: Abstraction has has 120 places, 95 transitions, 246 flow [2022-01-19 04:59:30,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:30,413 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:59:30,413 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:59:30,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 04:59:30,413 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:59:30,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:59:30,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1885111197, now seen corresponding path program 1 times [2022-01-19 04:59:30,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:59:30,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696459763] [2022-01-19 04:59:30,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:59:30,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:59:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:59:30,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:59:30,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:59:30,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696459763] [2022-01-19 04:59:30,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696459763] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:59:30,581 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:59:30,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 04:59:30,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411501828] [2022-01-19 04:59:30,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:59:30,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 04:59:30,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:59:30,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 04:59:30,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-19 04:59:30,583 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2022-01-19 04:59:30,584 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 95 transitions, 246 flow. Second operand has 10 states, 10 states have (on average 89.4) internal successors, (894), 10 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:30,584 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:59:30,584 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2022-01-19 04:59:30,584 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:59:30,909 INFO L129 PetriNetUnfolder]: 437/1039 cut-off events. [2022-01-19 04:59:30,909 INFO L130 PetriNetUnfolder]: For 1241/1252 co-relation queries the response was YES. [2022-01-19 04:59:30,913 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2497 conditions, 1039 events. 437/1039 cut-off events. For 1241/1252 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5851 event pairs, 137 based on Foata normal form. 30/1015 useless extension candidates. Maximal degree in co-relation 2432. Up to 399 conditions per place. [2022-01-19 04:59:30,917 INFO L132 encePairwiseOnDemand]: 100/112 looper letters, 21 selfloop transitions, 10 changer transitions 44/151 dead transitions. [2022-01-19 04:59:30,917 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 151 transitions, 560 flow [2022-01-19 04:59:30,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-19 04:59:30,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-19 04:59:30,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1398 transitions. [2022-01-19 04:59:30,920 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8321428571428572 [2022-01-19 04:59:30,920 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1398 transitions. [2022-01-19 04:59:30,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1398 transitions. [2022-01-19 04:59:30,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:59:30,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1398 transitions. [2022-01-19 04:59:30,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 93.2) internal successors, (1398), 15 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:30,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 112.0) internal successors, (1792), 16 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:30,925 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 112.0) internal successors, (1792), 16 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:30,925 INFO L186 Difference]: Start difference. First operand has 120 places, 95 transitions, 246 flow. Second operand 15 states and 1398 transitions. [2022-01-19 04:59:30,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 151 transitions, 560 flow [2022-01-19 04:59:30,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 151 transitions, 520 flow, removed 18 selfloop flow, removed 8 redundant places. [2022-01-19 04:59:30,931 INFO L242 Difference]: Finished difference. Result has 131 places, 101 transitions, 314 flow [2022-01-19 04:59:30,931 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=314, PETRI_PLACES=131, PETRI_TRANSITIONS=101} [2022-01-19 04:59:30,931 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 14 predicate places. [2022-01-19 04:59:30,932 INFO L470 AbstractCegarLoop]: Abstraction has has 131 places, 101 transitions, 314 flow [2022-01-19 04:59:30,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.4) internal successors, (894), 10 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:30,932 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:59:30,932 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:59:30,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 04:59:30,932 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:59:30,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:59:30,933 INFO L85 PathProgramCache]: Analyzing trace with hash -245895852, now seen corresponding path program 1 times [2022-01-19 04:59:30,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:59:30,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609616212] [2022-01-19 04:59:30,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:59:30,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:59:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:59:31,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:59:31,192 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:59:31,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609616212] [2022-01-19 04:59:31,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609616212] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:59:31,192 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:59:31,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-19 04:59:31,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728293318] [2022-01-19 04:59:31,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:59:31,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-19 04:59:31,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:59:31,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-19 04:59:31,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-01-19 04:59:31,194 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 112 [2022-01-19 04:59:31,195 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 101 transitions, 314 flow. Second operand has 14 states, 14 states have (on average 86.28571428571429) internal successors, (1208), 14 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:31,195 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:59:31,195 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 112 [2022-01-19 04:59:31,195 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:59:31,501 INFO L129 PetriNetUnfolder]: 337/825 cut-off events. [2022-01-19 04:59:31,501 INFO L130 PetriNetUnfolder]: For 2305/2319 co-relation queries the response was YES. [2022-01-19 04:59:31,504 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2715 conditions, 825 events. 337/825 cut-off events. For 2305/2319 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4371 event pairs, 117 based on Foata normal form. 23/813 useless extension candidates. Maximal degree in co-relation 2638. Up to 400 conditions per place. [2022-01-19 04:59:31,507 INFO L132 encePairwiseOnDemand]: 97/112 looper letters, 22 selfloop transitions, 16 changer transitions 35/146 dead transitions. [2022-01-19 04:59:31,507 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 146 transitions, 756 flow [2022-01-19 04:59:31,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 04:59:31,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 04:59:31,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1602 transitions. [2022-01-19 04:59:31,510 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7946428571428571 [2022-01-19 04:59:31,510 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1602 transitions. [2022-01-19 04:59:31,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1602 transitions. [2022-01-19 04:59:31,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:59:31,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1602 transitions. [2022-01-19 04:59:31,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 89.0) internal successors, (1602), 18 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:31,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 112.0) internal successors, (2128), 19 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:31,516 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 112.0) internal successors, (2128), 19 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:31,516 INFO L186 Difference]: Start difference. First operand has 131 places, 101 transitions, 314 flow. Second operand 18 states and 1602 transitions. [2022-01-19 04:59:31,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 146 transitions, 756 flow [2022-01-19 04:59:31,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 146 transitions, 734 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-01-19 04:59:31,521 INFO L242 Difference]: Finished difference. Result has 145 places, 105 transitions, 418 flow [2022-01-19 04:59:31,521 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=418, PETRI_PLACES=145, PETRI_TRANSITIONS=105} [2022-01-19 04:59:31,522 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 28 predicate places. [2022-01-19 04:59:31,522 INFO L470 AbstractCegarLoop]: Abstraction has has 145 places, 105 transitions, 418 flow [2022-01-19 04:59:31,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 86.28571428571429) internal successors, (1208), 14 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:31,523 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:59:31,523 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:59:31,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 04:59:31,523 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:59:31,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:59:31,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1801427826, now seen corresponding path program 1 times [2022-01-19 04:59:31,523 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:59:31,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689117215] [2022-01-19 04:59:31,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:59:31,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:59:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:59:31,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:59:31,592 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:59:31,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689117215] [2022-01-19 04:59:31,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689117215] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:59:31,592 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:59:31,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:59:31,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558278643] [2022-01-19 04:59:31,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:59:31,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:59:31,593 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:59:31,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:59:31,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:59:31,594 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2022-01-19 04:59:31,594 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 105 transitions, 418 flow. Second operand has 7 states, 7 states have (on average 90.0) internal successors, (630), 7 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:31,594 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:59:31,594 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2022-01-19 04:59:31,594 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:59:31,879 INFO L129 PetriNetUnfolder]: 674/1431 cut-off events. [2022-01-19 04:59:31,879 INFO L130 PetriNetUnfolder]: For 9181/9191 co-relation queries the response was YES. [2022-01-19 04:59:31,885 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5944 conditions, 1431 events. 674/1431 cut-off events. For 9181/9191 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8522 event pairs, 105 based on Foata normal form. 35/1384 useless extension candidates. Maximal degree in co-relation 5857. Up to 514 conditions per place. [2022-01-19 04:59:31,890 INFO L132 encePairwiseOnDemand]: 103/112 looper letters, 37 selfloop transitions, 5 changer transitions 27/147 dead transitions. [2022-01-19 04:59:31,890 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 147 transitions, 951 flow [2022-01-19 04:59:31,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 04:59:31,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 04:59:31,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 673 transitions. [2022-01-19 04:59:31,892 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8584183673469388 [2022-01-19 04:59:31,892 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 673 transitions. [2022-01-19 04:59:31,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 673 transitions. [2022-01-19 04:59:31,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:59:31,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 673 transitions. [2022-01-19 04:59:31,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 96.14285714285714) internal successors, (673), 7 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:31,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 112.0) internal successors, (896), 8 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:31,894 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 112.0) internal successors, (896), 8 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:31,894 INFO L186 Difference]: Start difference. First operand has 145 places, 105 transitions, 418 flow. Second operand 7 states and 673 transitions. [2022-01-19 04:59:31,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 147 transitions, 951 flow [2022-01-19 04:59:31,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 147 transitions, 807 flow, removed 67 selfloop flow, removed 14 redundant places. [2022-01-19 04:59:31,904 INFO L242 Difference]: Finished difference. Result has 132 places, 105 transitions, 385 flow [2022-01-19 04:59:31,905 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=385, PETRI_PLACES=132, PETRI_TRANSITIONS=105} [2022-01-19 04:59:31,905 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 15 predicate places. [2022-01-19 04:59:31,905 INFO L470 AbstractCegarLoop]: Abstraction has has 132 places, 105 transitions, 385 flow [2022-01-19 04:59:31,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.0) internal successors, (630), 7 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:31,906 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:59:31,906 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:59:31,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 04:59:31,906 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:59:31,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:59:31,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1964555488, now seen corresponding path program 2 times [2022-01-19 04:59:31,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:59:31,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074619351] [2022-01-19 04:59:31,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:59:31,907 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:59:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:59:32,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:59:32,006 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:59:32,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074619351] [2022-01-19 04:59:32,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074619351] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:59:32,006 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:59:32,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 04:59:32,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739959607] [2022-01-19 04:59:32,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:59:32,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 04:59:32,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:59:32,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 04:59:32,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-19 04:59:32,008 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2022-01-19 04:59:32,008 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 105 transitions, 385 flow. Second operand has 8 states, 8 states have (on average 90.75) internal successors, (726), 8 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:32,008 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:59:32,008 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2022-01-19 04:59:32,008 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:59:32,306 INFO L129 PetriNetUnfolder]: 353/871 cut-off events. [2022-01-19 04:59:32,307 INFO L130 PetriNetUnfolder]: For 2940/2972 co-relation queries the response was YES. [2022-01-19 04:59:32,310 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3026 conditions, 871 events. 353/871 cut-off events. For 2940/2972 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4700 event pairs, 103 based on Foata normal form. 26/861 useless extension candidates. Maximal degree in co-relation 2944. Up to 339 conditions per place. [2022-01-19 04:59:32,313 INFO L132 encePairwiseOnDemand]: 102/112 looper letters, 32 selfloop transitions, 10 changer transitions 37/156 dead transitions. [2022-01-19 04:59:32,313 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 156 transitions, 861 flow [2022-01-19 04:59:32,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 04:59:32,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 04:59:32,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1319 transitions. [2022-01-19 04:59:32,316 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8411989795918368 [2022-01-19 04:59:32,317 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1319 transitions. [2022-01-19 04:59:32,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1319 transitions. [2022-01-19 04:59:32,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:59:32,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1319 transitions. [2022-01-19 04:59:32,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 94.21428571428571) internal successors, (1319), 14 states have internal predecessors, (1319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:32,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:32,321 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:32,321 INFO L186 Difference]: Start difference. First operand has 132 places, 105 transitions, 385 flow. Second operand 14 states and 1319 transitions. [2022-01-19 04:59:32,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 156 transitions, 861 flow [2022-01-19 04:59:32,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 156 transitions, 821 flow, removed 15 selfloop flow, removed 6 redundant places. [2022-01-19 04:59:32,326 INFO L242 Difference]: Finished difference. Result has 146 places, 108 transitions, 446 flow [2022-01-19 04:59:32,327 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=446, PETRI_PLACES=146, PETRI_TRANSITIONS=108} [2022-01-19 04:59:32,327 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 29 predicate places. [2022-01-19 04:59:32,327 INFO L470 AbstractCegarLoop]: Abstraction has has 146 places, 108 transitions, 446 flow [2022-01-19 04:59:32,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.75) internal successors, (726), 8 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:32,328 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:59:32,328 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:59:32,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 04:59:32,328 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:59:32,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:59:32,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1870206367, now seen corresponding path program 1 times [2022-01-19 04:59:32,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:59:32,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614879551] [2022-01-19 04:59:32,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:59:32,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:59:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:59:32,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:59:32,389 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:59:32,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614879551] [2022-01-19 04:59:32,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614879551] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:59:32,389 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:59:32,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:59:32,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572812135] [2022-01-19 04:59:32,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:59:32,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:59:32,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:59:32,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:59:32,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:59:32,391 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2022-01-19 04:59:32,391 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 108 transitions, 446 flow. Second operand has 6 states, 6 states have (on average 91.5) internal successors, (549), 6 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:32,391 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:59:32,391 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2022-01-19 04:59:32,391 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:59:32,716 INFO L129 PetriNetUnfolder]: 573/1456 cut-off events. [2022-01-19 04:59:32,716 INFO L130 PetriNetUnfolder]: For 8217/8231 co-relation queries the response was YES. [2022-01-19 04:59:32,721 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6214 conditions, 1456 events. 573/1456 cut-off events. For 8217/8231 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 9342 event pairs, 155 based on Foata normal form. 26/1400 useless extension candidates. Maximal degree in co-relation 6128. Up to 409 conditions per place. [2022-01-19 04:59:32,726 INFO L132 encePairwiseOnDemand]: 106/112 looper letters, 37 selfloop transitions, 3 changer transitions 30/149 dead transitions. [2022-01-19 04:59:32,726 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 149 transitions, 988 flow [2022-01-19 04:59:32,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 04:59:32,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 04:59:32,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 861 transitions. [2022-01-19 04:59:32,728 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8541666666666666 [2022-01-19 04:59:32,728 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 861 transitions. [2022-01-19 04:59:32,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 861 transitions. [2022-01-19 04:59:32,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:59:32,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 861 transitions. [2022-01-19 04:59:32,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 95.66666666666667) internal successors, (861), 9 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:32,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:32,731 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:32,731 INFO L186 Difference]: Start difference. First operand has 146 places, 108 transitions, 446 flow. Second operand 9 states and 861 transitions. [2022-01-19 04:59:32,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 149 transitions, 988 flow [2022-01-19 04:59:32,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 149 transitions, 921 flow, removed 30 selfloop flow, removed 8 redundant places. [2022-01-19 04:59:32,739 INFO L242 Difference]: Finished difference. Result has 144 places, 107 transitions, 429 flow [2022-01-19 04:59:32,739 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=429, PETRI_PLACES=144, PETRI_TRANSITIONS=107} [2022-01-19 04:59:32,739 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 27 predicate places. [2022-01-19 04:59:32,739 INFO L470 AbstractCegarLoop]: Abstraction has has 144 places, 107 transitions, 429 flow [2022-01-19 04:59:32,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.5) internal successors, (549), 6 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:32,740 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:59:32,740 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:59:32,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 04:59:32,740 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:59:32,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:59:32,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1492497399, now seen corresponding path program 1 times [2022-01-19 04:59:32,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:59:32,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128406381] [2022-01-19 04:59:32,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:59:32,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:59:32,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:59:32,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:59:32,876 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:59:32,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128406381] [2022-01-19 04:59:32,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128406381] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:59:32,876 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:59:32,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-19 04:59:32,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286635589] [2022-01-19 04:59:32,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:59:32,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 04:59:32,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:59:32,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 04:59:32,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-01-19 04:59:32,878 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 112 [2022-01-19 04:59:32,879 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 107 transitions, 429 flow. Second operand has 11 states, 11 states have (on average 88.54545454545455) internal successors, (974), 11 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:32,879 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:59:32,879 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 112 [2022-01-19 04:59:32,879 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:59:33,147 INFO L129 PetriNetUnfolder]: 329/909 cut-off events. [2022-01-19 04:59:33,147 INFO L130 PetriNetUnfolder]: For 5365/5395 co-relation queries the response was YES. [2022-01-19 04:59:33,151 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3847 conditions, 909 events. 329/909 cut-off events. For 5365/5395 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 5175 event pairs, 163 based on Foata normal form. 10/864 useless extension candidates. Maximal degree in co-relation 3757. Up to 441 conditions per place. [2022-01-19 04:59:33,155 INFO L132 encePairwiseOnDemand]: 100/112 looper letters, 33 selfloop transitions, 15 changer transitions 19/142 dead transitions. [2022-01-19 04:59:33,155 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 142 transitions, 899 flow [2022-01-19 04:59:33,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 04:59:33,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 04:59:33,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1187 transitions. [2022-01-19 04:59:33,158 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8152472527472527 [2022-01-19 04:59:33,158 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1187 transitions. [2022-01-19 04:59:33,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1187 transitions. [2022-01-19 04:59:33,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:59:33,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1187 transitions. [2022-01-19 04:59:33,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 91.3076923076923) internal successors, (1187), 13 states have internal predecessors, (1187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:33,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:33,162 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:33,162 INFO L186 Difference]: Start difference. First operand has 144 places, 107 transitions, 429 flow. Second operand 13 states and 1187 transitions. [2022-01-19 04:59:33,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 142 transitions, 899 flow [2022-01-19 04:59:33,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 142 transitions, 844 flow, removed 23 selfloop flow, removed 8 redundant places. [2022-01-19 04:59:33,169 INFO L242 Difference]: Finished difference. Result has 149 places, 112 transitions, 493 flow [2022-01-19 04:59:33,169 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=493, PETRI_PLACES=149, PETRI_TRANSITIONS=112} [2022-01-19 04:59:33,169 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 32 predicate places. [2022-01-19 04:59:33,169 INFO L470 AbstractCegarLoop]: Abstraction has has 149 places, 112 transitions, 493 flow [2022-01-19 04:59:33,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 88.54545454545455) internal successors, (974), 11 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:33,170 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:59:33,170 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:59:33,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 04:59:33,170 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:59:33,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:59:33,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1645514146, now seen corresponding path program 1 times [2022-01-19 04:59:33,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:59:33,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017628082] [2022-01-19 04:59:33,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:59:33,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:59:33,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:59:33,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:59:33,381 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:59:33,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017628082] [2022-01-19 04:59:33,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017628082] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:59:33,382 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:59:33,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 04:59:33,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362096597] [2022-01-19 04:59:33,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:59:33,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 04:59:33,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:59:33,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 04:59:33,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-01-19 04:59:33,383 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 112 [2022-01-19 04:59:33,384 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 112 transitions, 493 flow. Second operand has 12 states, 12 states have (on average 88.41666666666667) internal successors, (1061), 12 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:33,384 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:59:33,384 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 112 [2022-01-19 04:59:33,384 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:59:33,896 INFO L129 PetriNetUnfolder]: 381/1015 cut-off events. [2022-01-19 04:59:33,897 INFO L130 PetriNetUnfolder]: For 6874/7153 co-relation queries the response was YES. [2022-01-19 04:59:33,900 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4621 conditions, 1015 events. 381/1015 cut-off events. For 6874/7153 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5984 event pairs, 172 based on Foata normal form. 25/969 useless extension candidates. Maximal degree in co-relation 4528. Up to 429 conditions per place. [2022-01-19 04:59:33,904 INFO L132 encePairwiseOnDemand]: 99/112 looper letters, 29 selfloop transitions, 14 changer transitions 42/160 dead transitions. [2022-01-19 04:59:33,904 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 160 transitions, 1188 flow [2022-01-19 04:59:33,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 04:59:33,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 04:59:33,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1553 transitions. [2022-01-19 04:59:33,907 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8156512605042017 [2022-01-19 04:59:33,907 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1553 transitions. [2022-01-19 04:59:33,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1553 transitions. [2022-01-19 04:59:33,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:59:33,907 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1553 transitions. [2022-01-19 04:59:33,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 91.3529411764706) internal successors, (1553), 17 states have internal predecessors, (1553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:33,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 112.0) internal successors, (2016), 18 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:33,912 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 112.0) internal successors, (2016), 18 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:33,912 INFO L186 Difference]: Start difference. First operand has 149 places, 112 transitions, 493 flow. Second operand 17 states and 1553 transitions. [2022-01-19 04:59:33,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 160 transitions, 1188 flow [2022-01-19 04:59:33,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 160 transitions, 1112 flow, removed 30 selfloop flow, removed 10 redundant places. [2022-01-19 04:59:33,924 INFO L242 Difference]: Finished difference. Result has 160 places, 113 transitions, 553 flow [2022-01-19 04:59:33,925 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=553, PETRI_PLACES=160, PETRI_TRANSITIONS=113} [2022-01-19 04:59:33,925 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 43 predicate places. [2022-01-19 04:59:33,925 INFO L470 AbstractCegarLoop]: Abstraction has has 160 places, 113 transitions, 553 flow [2022-01-19 04:59:33,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 88.41666666666667) internal successors, (1061), 12 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:33,926 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:59:33,926 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:59:33,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 04:59:33,926 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:59:33,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:59:33,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1321879912, now seen corresponding path program 1 times [2022-01-19 04:59:33,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:59:33,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523971478] [2022-01-19 04:59:33,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:59:33,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:59:33,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:59:34,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:59:34,062 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:59:34,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523971478] [2022-01-19 04:59:34,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523971478] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:59:34,062 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:59:34,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-19 04:59:34,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276720629] [2022-01-19 04:59:34,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:59:34,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 04:59:34,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:59:34,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 04:59:34,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-01-19 04:59:34,064 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 112 [2022-01-19 04:59:34,065 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 113 transitions, 553 flow. Second operand has 11 states, 11 states have (on average 87.63636363636364) internal successors, (964), 11 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:34,065 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:59:34,065 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 112 [2022-01-19 04:59:34,065 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:59:34,340 INFO L129 PetriNetUnfolder]: 300/858 cut-off events. [2022-01-19 04:59:34,340 INFO L130 PetriNetUnfolder]: For 10732/11053 co-relation queries the response was YES. [2022-01-19 04:59:34,344 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4882 conditions, 858 events. 300/858 cut-off events. For 10732/11053 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5018 event pairs, 114 based on Foata normal form. 39/852 useless extension candidates. Maximal degree in co-relation 4782. Up to 395 conditions per place. [2022-01-19 04:59:34,348 INFO L132 encePairwiseOnDemand]: 100/112 looper letters, 33 selfloop transitions, 14 changer transitions 22/143 dead transitions. [2022-01-19 04:59:34,348 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 143 transitions, 1033 flow [2022-01-19 04:59:34,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 04:59:34,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 04:59:34,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1261 transitions. [2022-01-19 04:59:34,351 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8042091836734694 [2022-01-19 04:59:34,351 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1261 transitions. [2022-01-19 04:59:34,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1261 transitions. [2022-01-19 04:59:34,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:59:34,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1261 transitions. [2022-01-19 04:59:34,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 90.07142857142857) internal successors, (1261), 14 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:34,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:34,355 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:34,355 INFO L186 Difference]: Start difference. First operand has 160 places, 113 transitions, 553 flow. Second operand 14 states and 1261 transitions. [2022-01-19 04:59:34,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 143 transitions, 1033 flow [2022-01-19 04:59:34,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 143 transitions, 887 flow, removed 65 selfloop flow, removed 17 redundant places. [2022-01-19 04:59:34,369 INFO L242 Difference]: Finished difference. Result has 154 places, 115 transitions, 564 flow [2022-01-19 04:59:34,369 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=564, PETRI_PLACES=154, PETRI_TRANSITIONS=115} [2022-01-19 04:59:34,369 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 37 predicate places. [2022-01-19 04:59:34,370 INFO L470 AbstractCegarLoop]: Abstraction has has 154 places, 115 transitions, 564 flow [2022-01-19 04:59:34,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 87.63636363636364) internal successors, (964), 11 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:34,370 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:59:34,370 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:59:34,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 04:59:34,370 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:59:34,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:59:34,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1697787346, now seen corresponding path program 1 times [2022-01-19 04:59:34,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:59:34,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923660450] [2022-01-19 04:59:34,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:59:34,371 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:59:34,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:59:34,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:59:34,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:59:34,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923660450] [2022-01-19 04:59:34,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923660450] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:59:34,486 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:59:34,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 04:59:34,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340089977] [2022-01-19 04:59:34,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:59:34,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 04:59:34,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:59:34,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 04:59:34,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-19 04:59:34,488 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2022-01-19 04:59:34,488 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 115 transitions, 564 flow. Second operand has 9 states, 9 states have (on average 89.77777777777777) internal successors, (808), 9 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:34,488 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:59:34,488 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2022-01-19 04:59:34,488 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:59:34,794 INFO L129 PetriNetUnfolder]: 352/1020 cut-off events. [2022-01-19 04:59:34,794 INFO L130 PetriNetUnfolder]: For 12322/12638 co-relation queries the response was YES. [2022-01-19 04:59:34,798 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5806 conditions, 1020 events. 352/1020 cut-off events. For 12322/12638 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6291 event pairs, 62 based on Foata normal form. 31/984 useless extension candidates. Maximal degree in co-relation 5712. Up to 355 conditions per place. [2022-01-19 04:59:34,803 INFO L132 encePairwiseOnDemand]: 100/112 looper letters, 30 selfloop transitions, 23 changer transitions 27/156 dead transitions. [2022-01-19 04:59:34,803 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 156 transitions, 1329 flow [2022-01-19 04:59:34,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 04:59:34,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 04:59:34,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1208 transitions. [2022-01-19 04:59:34,805 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8296703296703297 [2022-01-19 04:59:34,805 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1208 transitions. [2022-01-19 04:59:34,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1208 transitions. [2022-01-19 04:59:34,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:59:34,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1208 transitions. [2022-01-19 04:59:34,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 92.92307692307692) internal successors, (1208), 13 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:34,808 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:34,809 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:34,809 INFO L186 Difference]: Start difference. First operand has 154 places, 115 transitions, 564 flow. Second operand 13 states and 1208 transitions. [2022-01-19 04:59:34,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 156 transitions, 1329 flow [2022-01-19 04:59:34,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 156 transitions, 1152 flow, removed 78 selfloop flow, removed 12 redundant places. [2022-01-19 04:59:34,820 INFO L242 Difference]: Finished difference. Result has 155 places, 120 transitions, 668 flow [2022-01-19 04:59:34,820 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=668, PETRI_PLACES=155, PETRI_TRANSITIONS=120} [2022-01-19 04:59:34,821 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 38 predicate places. [2022-01-19 04:59:34,821 INFO L470 AbstractCegarLoop]: Abstraction has has 155 places, 120 transitions, 668 flow [2022-01-19 04:59:34,821 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 89.77777777777777) internal successors, (808), 9 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:34,821 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:59:34,821 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:59:34,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-19 04:59:34,822 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:59:34,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:59:34,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1688683518, now seen corresponding path program 1 times [2022-01-19 04:59:34,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:59:34,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146846087] [2022-01-19 04:59:34,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:59:34,822 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:59:34,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:59:34,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:59:34,883 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:59:34,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146846087] [2022-01-19 04:59:34,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146846087] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:59:34,883 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:59:34,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:59:34,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607254133] [2022-01-19 04:59:34,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:59:34,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:59:34,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:59:34,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:59:34,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:59:34,884 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2022-01-19 04:59:34,885 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 120 transitions, 668 flow. Second operand has 6 states, 6 states have (on average 90.33333333333333) internal successors, (542), 6 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:34,885 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:59:34,885 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2022-01-19 04:59:34,885 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:59:35,495 INFO L129 PetriNetUnfolder]: 1963/3975 cut-off events. [2022-01-19 04:59:35,496 INFO L130 PetriNetUnfolder]: For 57628/57949 co-relation queries the response was YES. [2022-01-19 04:59:35,517 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19573 conditions, 3975 events. 1963/3975 cut-off events. For 57628/57949 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 29776 event pairs, 273 based on Foata normal form. 236/4088 useless extension candidates. Maximal degree in co-relation 19483. Up to 1185 conditions per place. [2022-01-19 04:59:35,528 INFO L132 encePairwiseOnDemand]: 102/112 looper letters, 70 selfloop transitions, 7 changer transitions 112/269 dead transitions. [2022-01-19 04:59:35,528 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 269 transitions, 2726 flow [2022-01-19 04:59:35,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 04:59:35,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 04:59:35,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 962 transitions. [2022-01-19 04:59:35,530 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8589285714285714 [2022-01-19 04:59:35,530 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 962 transitions. [2022-01-19 04:59:35,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 962 transitions. [2022-01-19 04:59:35,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:59:35,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 962 transitions. [2022-01-19 04:59:35,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 96.2) internal successors, (962), 10 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:35,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:35,533 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:35,533 INFO L186 Difference]: Start difference. First operand has 155 places, 120 transitions, 668 flow. Second operand 10 states and 962 transitions. [2022-01-19 04:59:35,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 269 transitions, 2726 flow [2022-01-19 04:59:35,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 269 transitions, 2422 flow, removed 118 selfloop flow, removed 10 redundant places. [2022-01-19 04:59:35,577 INFO L242 Difference]: Finished difference. Result has 154 places, 123 transitions, 663 flow [2022-01-19 04:59:35,577 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=663, PETRI_PLACES=154, PETRI_TRANSITIONS=123} [2022-01-19 04:59:35,577 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 37 predicate places. [2022-01-19 04:59:35,577 INFO L470 AbstractCegarLoop]: Abstraction has has 154 places, 123 transitions, 663 flow [2022-01-19 04:59:35,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.33333333333333) internal successors, (542), 6 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:35,578 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:59:35,578 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:59:35,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 04:59:35,578 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:59:35,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:59:35,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1739713126, now seen corresponding path program 1 times [2022-01-19 04:59:35,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:59:35,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694894015] [2022-01-19 04:59:35,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:59:35,579 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:59:35,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:59:35,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:59:35,640 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:59:35,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694894015] [2022-01-19 04:59:35,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694894015] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:59:35,640 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:59:35,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:59:35,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231822921] [2022-01-19 04:59:35,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:59:35,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:59:35,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:59:35,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:59:35,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:59:35,641 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2022-01-19 04:59:35,641 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 123 transitions, 663 flow. Second operand has 7 states, 7 states have (on average 90.42857142857143) internal successors, (633), 7 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:35,641 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:59:35,642 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2022-01-19 04:59:35,642 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:59:36,057 INFO L129 PetriNetUnfolder]: 804/2570 cut-off events. [2022-01-19 04:59:36,057 INFO L130 PetriNetUnfolder]: For 15703/15970 co-relation queries the response was YES. [2022-01-19 04:59:36,068 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10606 conditions, 2570 events. 804/2570 cut-off events. For 15703/15970 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 22736 event pairs, 257 based on Foata normal form. 53/2424 useless extension candidates. Maximal degree in co-relation 10515. Up to 552 conditions per place. [2022-01-19 04:59:36,073 INFO L132 encePairwiseOnDemand]: 105/112 looper letters, 55 selfloop transitions, 3 changer transitions 43/184 dead transitions. [2022-01-19 04:59:36,074 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 184 transitions, 1608 flow [2022-01-19 04:59:36,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 04:59:36,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 04:59:36,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 758 transitions. [2022-01-19 04:59:36,075 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8459821428571429 [2022-01-19 04:59:36,075 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 758 transitions. [2022-01-19 04:59:36,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 758 transitions. [2022-01-19 04:59:36,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:59:36,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 758 transitions. [2022-01-19 04:59:36,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 94.75) internal successors, (758), 8 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:36,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 112.0) internal successors, (1008), 9 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:36,077 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 112.0) internal successors, (1008), 9 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:36,077 INFO L186 Difference]: Start difference. First operand has 154 places, 123 transitions, 663 flow. Second operand 8 states and 758 transitions. [2022-01-19 04:59:36,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 184 transitions, 1608 flow [2022-01-19 04:59:36,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 184 transitions, 1599 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-01-19 04:59:36,091 INFO L242 Difference]: Finished difference. Result has 158 places, 123 transitions, 673 flow [2022-01-19 04:59:36,092 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=673, PETRI_PLACES=158, PETRI_TRANSITIONS=123} [2022-01-19 04:59:36,092 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 41 predicate places. [2022-01-19 04:59:36,092 INFO L470 AbstractCegarLoop]: Abstraction has has 158 places, 123 transitions, 673 flow [2022-01-19 04:59:36,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.42857142857143) internal successors, (633), 7 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:36,092 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:59:36,092 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:59:36,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-19 04:59:36,093 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:59:36,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:59:36,093 INFO L85 PathProgramCache]: Analyzing trace with hash 575901384, now seen corresponding path program 2 times [2022-01-19 04:59:36,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:59:36,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108719854] [2022-01-19 04:59:36,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:59:36,093 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:59:36,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:59:36,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:59:36,152 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:59:36,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108719854] [2022-01-19 04:59:36,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108719854] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:59:36,152 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:59:36,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:59:36,152 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106858424] [2022-01-19 04:59:36,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:59:36,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:59:36,153 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:59:36,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:59:36,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:59:36,153 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2022-01-19 04:59:36,154 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 123 transitions, 673 flow. Second operand has 7 states, 7 states have (on average 90.14285714285714) internal successors, (631), 7 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:36,154 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:59:36,154 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2022-01-19 04:59:36,154 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:59:36,554 INFO L129 PetriNetUnfolder]: 916/2283 cut-off events. [2022-01-19 04:59:36,554 INFO L130 PetriNetUnfolder]: For 19757/19938 co-relation queries the response was YES. [2022-01-19 04:59:36,563 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10574 conditions, 2283 events. 916/2283 cut-off events. For 19757/19938 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 17481 event pairs, 57 based on Foata normal form. 170/2417 useless extension candidates. Maximal degree in co-relation 10482. Up to 533 conditions per place. [2022-01-19 04:59:36,567 INFO L132 encePairwiseOnDemand]: 102/112 looper letters, 67 selfloop transitions, 11 changer transitions 66/224 dead transitions. [2022-01-19 04:59:36,567 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 224 transitions, 2095 flow [2022-01-19 04:59:36,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 04:59:36,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 04:59:36,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1059 transitions. [2022-01-19 04:59:36,569 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.859577922077922 [2022-01-19 04:59:36,569 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1059 transitions. [2022-01-19 04:59:36,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1059 transitions. [2022-01-19 04:59:36,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:59:36,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1059 transitions. [2022-01-19 04:59:36,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 96.27272727272727) internal successors, (1059), 11 states have internal predecessors, (1059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:36,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:36,572 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:36,572 INFO L186 Difference]: Start difference. First operand has 158 places, 123 transitions, 673 flow. Second operand 11 states and 1059 transitions. [2022-01-19 04:59:36,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 224 transitions, 2095 flow [2022-01-19 04:59:36,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 224 transitions, 2069 flow, removed 6 selfloop flow, removed 7 redundant places. [2022-01-19 04:59:36,589 INFO L242 Difference]: Finished difference. Result has 163 places, 127 transitions, 744 flow [2022-01-19 04:59:36,589 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=744, PETRI_PLACES=163, PETRI_TRANSITIONS=127} [2022-01-19 04:59:36,589 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 46 predicate places. [2022-01-19 04:59:36,589 INFO L470 AbstractCegarLoop]: Abstraction has has 163 places, 127 transitions, 744 flow [2022-01-19 04:59:36,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.14285714285714) internal successors, (631), 7 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:36,590 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:59:36,590 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:59:36,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-19 04:59:36,590 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:59:36,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:59:36,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1327116483, now seen corresponding path program 1 times [2022-01-19 04:59:36,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:59:36,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499837633] [2022-01-19 04:59:36,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:59:36,590 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:59:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:59:36,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:59:36,667 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:59:36,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499837633] [2022-01-19 04:59:36,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499837633] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:59:36,668 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:59:36,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 04:59:36,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941842063] [2022-01-19 04:59:36,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:59:36,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 04:59:36,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:59:36,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 04:59:36,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-19 04:59:36,670 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2022-01-19 04:59:36,670 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 127 transitions, 744 flow. Second operand has 8 states, 8 states have (on average 90.125) internal successors, (721), 8 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:36,670 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:59:36,670 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2022-01-19 04:59:36,670 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:59:37,004 INFO L129 PetriNetUnfolder]: 645/1730 cut-off events. [2022-01-19 04:59:37,004 INFO L130 PetriNetUnfolder]: For 17338/17514 co-relation queries the response was YES. [2022-01-19 04:59:37,012 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8838 conditions, 1730 events. 645/1730 cut-off events. For 17338/17514 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 13889 event pairs, 48 based on Foata normal form. 128/1826 useless extension candidates. Maximal degree in co-relation 8757. Up to 449 conditions per place. [2022-01-19 04:59:37,015 INFO L132 encePairwiseOnDemand]: 103/112 looper letters, 33 selfloop transitions, 12 changer transitions 82/204 dead transitions. [2022-01-19 04:59:37,015 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 204 transitions, 1915 flow [2022-01-19 04:59:37,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 04:59:37,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 04:59:37,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1217 transitions. [2022-01-19 04:59:37,018 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8358516483516484 [2022-01-19 04:59:37,018 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1217 transitions. [2022-01-19 04:59:37,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1217 transitions. [2022-01-19 04:59:37,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:59:37,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1217 transitions. [2022-01-19 04:59:37,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 93.61538461538461) internal successors, (1217), 13 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:37,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:37,024 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:37,025 INFO L186 Difference]: Start difference. First operand has 163 places, 127 transitions, 744 flow. Second operand 13 states and 1217 transitions. [2022-01-19 04:59:37,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 204 transitions, 1915 flow [2022-01-19 04:59:37,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 204 transitions, 1621 flow, removed 133 selfloop flow, removed 13 redundant places. [2022-01-19 04:59:37,050 INFO L242 Difference]: Finished difference. Result has 165 places, 108 transitions, 511 flow [2022-01-19 04:59:37,051 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=511, PETRI_PLACES=165, PETRI_TRANSITIONS=108} [2022-01-19 04:59:37,051 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 48 predicate places. [2022-01-19 04:59:37,052 INFO L470 AbstractCegarLoop]: Abstraction has has 165 places, 108 transitions, 511 flow [2022-01-19 04:59:37,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.125) internal successors, (721), 8 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:37,052 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:59:37,052 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:59:37,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-19 04:59:37,052 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:59:37,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:59:37,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1670884157, now seen corresponding path program 1 times [2022-01-19 04:59:37,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:59:37,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525633323] [2022-01-19 04:59:37,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:59:37,053 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:59:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:59:37,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:59:37,324 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:59:37,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525633323] [2022-01-19 04:59:37,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525633323] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:59:37,324 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:59:37,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-19 04:59:37,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311623822] [2022-01-19 04:59:37,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:59:37,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-19 04:59:37,325 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:59:37,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-19 04:59:37,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-01-19 04:59:37,326 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 112 [2022-01-19 04:59:37,327 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 108 transitions, 511 flow. Second operand has 14 states, 14 states have (on average 85.64285714285714) internal successors, (1199), 14 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:37,327 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:59:37,327 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 112 [2022-01-19 04:59:37,327 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:59:37,611 INFO L129 PetriNetUnfolder]: 71/481 cut-off events. [2022-01-19 04:59:37,611 INFO L130 PetriNetUnfolder]: For 1792/1839 co-relation queries the response was YES. [2022-01-19 04:59:37,613 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1617 conditions, 481 events. 71/481 cut-off events. For 1792/1839 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2813 event pairs, 0 based on Foata normal form. 10/482 useless extension candidates. Maximal degree in co-relation 1518. Up to 83 conditions per place. [2022-01-19 04:59:37,613 INFO L132 encePairwiseOnDemand]: 101/112 looper letters, 31 selfloop transitions, 8 changer transitions 14/130 dead transitions. [2022-01-19 04:59:37,613 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 130 transitions, 753 flow [2022-01-19 04:59:37,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 04:59:37,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 04:59:37,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 970 transitions. [2022-01-19 04:59:37,615 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7873376623376623 [2022-01-19 04:59:37,615 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 970 transitions. [2022-01-19 04:59:37,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 970 transitions. [2022-01-19 04:59:37,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:59:37,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 970 transitions. [2022-01-19 04:59:37,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 88.18181818181819) internal successors, (970), 11 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:37,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:37,617 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:37,617 INFO L186 Difference]: Start difference. First operand has 165 places, 108 transitions, 511 flow. Second operand 11 states and 970 transitions. [2022-01-19 04:59:37,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 130 transitions, 753 flow [2022-01-19 04:59:37,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 130 transitions, 521 flow, removed 80 selfloop flow, removed 34 redundant places. [2022-01-19 04:59:37,623 INFO L242 Difference]: Finished difference. Result has 132 places, 107 transitions, 358 flow [2022-01-19 04:59:37,623 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=358, PETRI_PLACES=132, PETRI_TRANSITIONS=107} [2022-01-19 04:59:37,623 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 15 predicate places. [2022-01-19 04:59:37,624 INFO L470 AbstractCegarLoop]: Abstraction has has 132 places, 107 transitions, 358 flow [2022-01-19 04:59:37,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 85.64285714285714) internal successors, (1199), 14 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:59:37,624 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:59:37,624 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:59:37,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-19 04:59:37,624 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:59:37,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:59:37,624 INFO L85 PathProgramCache]: Analyzing trace with hash 138883637, now seen corresponding path program 2 times [2022-01-19 04:59:37,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:59:37,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997934006] [2022-01-19 04:59:37,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:59:37,625 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:59:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 04:59:37,656 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 04:59:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 04:59:37,720 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 04:59:37,721 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 04:59:37,721 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-01-19 04:59:37,722 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-01-19 04:59:37,723 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2022-01-19 04:59:37,723 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2022-01-19 04:59:37,724 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2022-01-19 04:59:37,724 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-01-19 04:59:37,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-19 04:59:37,726 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:59:37,730 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 04:59:37,730 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 04:59:37,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 04:59:37 BasicIcfg [2022-01-19 04:59:37,823 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 04:59:37,824 INFO L158 Benchmark]: Toolchain (without parser) took 10327.00ms. Allocated memory was 375.4MB in the beginning and 838.9MB in the end (delta: 463.5MB). Free memory was 320.8MB in the beginning and 645.2MB in the end (delta: -324.4MB). Peak memory consumption was 141.0MB. Max. memory is 16.0GB. [2022-01-19 04:59:37,825 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 375.4MB. Free memory is still 338.7MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 04:59:37,825 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.99ms. Allocated memory is still 375.4MB. Free memory was 320.7MB in the beginning and 333.7MB in the end (delta: -13.0MB). Peak memory consumption was 19.5MB. Max. memory is 16.0GB. [2022-01-19 04:59:37,825 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.78ms. Allocated memory is still 375.4MB. Free memory was 333.7MB in the beginning and 331.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 04:59:37,825 INFO L158 Benchmark]: Boogie Preprocessor took 19.16ms. Allocated memory is still 375.4MB. Free memory was 331.6MB in the beginning and 328.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2022-01-19 04:59:37,825 INFO L158 Benchmark]: RCFGBuilder took 686.88ms. Allocated memory is still 375.4MB. Free memory was 328.4MB in the beginning and 247.7MB in the end (delta: 80.7MB). Peak memory consumption was 79.7MB. Max. memory is 16.0GB. [2022-01-19 04:59:37,825 INFO L158 Benchmark]: TraceAbstraction took 9258.62ms. Allocated memory was 375.4MB in the beginning and 838.9MB in the end (delta: 463.5MB). Free memory was 247.7MB in the beginning and 645.2MB in the end (delta: -397.5MB). Peak memory consumption was 67.0MB. Max. memory is 16.0GB. [2022-01-19 04:59:37,826 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 375.4MB. Free memory is still 338.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 324.99ms. Allocated memory is still 375.4MB. Free memory was 320.7MB in the beginning and 333.7MB in the end (delta: -13.0MB). Peak memory consumption was 19.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 33.78ms. Allocated memory is still 375.4MB. Free memory was 333.7MB in the beginning and 331.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 19.16ms. Allocated memory is still 375.4MB. Free memory was 331.6MB in the beginning and 328.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 686.88ms. Allocated memory is still 375.4MB. Free memory was 328.4MB in the beginning and 247.7MB in the end (delta: 80.7MB). Peak memory consumption was 79.7MB. Max. memory is 16.0GB. * TraceAbstraction took 9258.62ms. Allocated memory was 375.4MB in the beginning and 838.9MB in the end (delta: 463.5MB). Free memory was 247.7MB in the beginning and 645.2MB in the end (delta: -397.5MB). Peak memory consumption was 67.0MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 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; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L718] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L719] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L720] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L721] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L722] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L723] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L724] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L725] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L726] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L727] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L728] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L729] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L730] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L731] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L732] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L733] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L813] 0 pthread_t t2177; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L814] FCALL, FORK 0 pthread_create(&t2177, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2177, ((void *)0), P0, ((void *)0))=-2, t2177={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L815] 0 pthread_t t2178; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L816] FCALL, FORK 0 pthread_create(&t2178, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2178, ((void *)0), P1, ((void *)0))=-1, t2177={5:0}, t2178={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] 0 pthread_t t2179; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L818] FCALL, FORK 0 pthread_create(&t2179, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2179, ((void *)0), P2, ((void *)0))=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0: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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L785] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L788] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=67, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=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. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 818]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 138 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: 9.1s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 898 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 898 mSDsluCounter, 819 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1421 mSDsCounter, 280 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2307 IncrementalHoareTripleChecker+Invalid, 2587 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 280 mSolverCounterUnsat, 165 mSDtfsCounter, 2307 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 252 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=744occurred in iteration=15, InterpolantAutomatonStates: 194, 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.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1385 NumberOfCodeBlocks, 1385 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1282 ConstructedInterpolants, 0 QuantifiedInterpolants, 7402 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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 RESULT: Ultimate proved your program to be incorrect! [2022-01-19 04:59:37,848 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...