./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a650c00976061981bc34910bafee4d11d94c16289374f008af5a1f8d17e97036 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 22:20:42,806 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 22:20:42,808 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 22:20:42,852 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 22:20:42,852 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 22:20:42,853 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 22:20:42,854 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 22:20:42,855 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 22:20:42,857 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 22:20:42,857 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 22:20:42,858 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 22:20:42,859 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 22:20:42,859 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 22:20:42,866 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 22:20:42,867 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 22:20:42,869 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 22:20:42,874 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 22:20:42,874 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 22:20:42,876 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 22:20:42,881 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 22:20:42,883 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 22:20:42,887 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 22:20:42,888 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 22:20:42,891 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 22:20:42,893 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 22:20:42,894 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 22:20:42,895 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 22:20:42,895 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 22:20:42,896 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 22:20:42,897 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 22:20:42,897 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 22:20:42,897 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 22:20:42,899 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 22:20:42,900 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 22:20:42,901 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 22:20:42,901 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 22:20:42,901 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 22:20:42,902 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 22:20:42,902 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 22:20:42,902 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 22:20:42,903 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 22:20:42,904 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 22:20:42,937 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 22:20:42,938 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 22:20:42,938 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 22:20:42,939 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 22:20:42,939 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 22:20:42,940 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 22:20:42,940 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 22:20:42,940 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 22:20:42,941 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 22:20:42,941 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 22:20:42,942 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 22:20:42,942 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 22:20:42,942 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 22:20:42,942 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 22:20:42,942 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 22:20:42,943 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 22:20:42,943 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 22:20:42,943 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 22:20:42,943 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 22:20:42,943 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 22:20:42,943 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 22:20:42,944 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 22:20:42,944 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 22:20:42,944 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 22:20:42,944 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 22:20:42,944 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 22:20:42,945 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 22:20:42,946 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 22:20:42,946 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 22:20:42,946 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 22:20:42,946 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 22:20:42,946 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 22:20:42,947 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 22:20:42,947 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 22:20:42,947 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a650c00976061981bc34910bafee4d11d94c16289374f008af5a1f8d17e97036 [2021-12-17 22:20:43,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 22:20:43,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 22:20:43,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 22:20:43,161 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 22:20:43,162 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 22:20:43,163 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2021-12-17 22:20:43,227 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d21d0098a/f63ad31a84634248afd5d5bbd880a362/FLAG8c208e538 [2021-12-17 22:20:43,679 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 22:20:43,680 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2021-12-17 22:20:43,708 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d21d0098a/f63ad31a84634248afd5d5bbd880a362/FLAG8c208e538 [2021-12-17 22:20:44,188 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d21d0098a/f63ad31a84634248afd5d5bbd880a362 [2021-12-17 22:20:44,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 22:20:44,192 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 22:20:44,193 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 22:20:44,193 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 22:20:44,202 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 22:20:44,203 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 10:20:44" (1/1) ... [2021-12-17 22:20:44,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37ef672a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:20:44, skipping insertion in model container [2021-12-17 22:20:44,205 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 10:20:44" (1/1) ... [2021-12-17 22:20:44,211 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 22:20:44,249 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 22:20:44,416 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2021-12-17 22:20:44,585 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 22:20:44,594 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 22:20:44,606 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2021-12-17 22:20:44,673 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 22:20:44,700 INFO L208 MainTranslator]: Completed translation [2021-12-17 22:20:44,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:20:44 WrapperNode [2021-12-17 22:20:44,701 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 22:20:44,702 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 22:20:44,703 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 22:20:44,703 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 22:20:44,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:20:44" (1/1) ... [2021-12-17 22:20:44,723 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:20:44" (1/1) ... [2021-12-17 22:20:44,758 INFO L137 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 289 [2021-12-17 22:20:44,761 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 22:20:44,761 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 22:20:44,762 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 22:20:44,762 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 22:20:44,769 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:20:44" (1/1) ... [2021-12-17 22:20:44,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:20:44" (1/1) ... [2021-12-17 22:20:44,782 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:20:44" (1/1) ... [2021-12-17 22:20:44,782 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:20:44" (1/1) ... [2021-12-17 22:20:44,791 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:20:44" (1/1) ... [2021-12-17 22:20:44,794 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:20:44" (1/1) ... [2021-12-17 22:20:44,797 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:20:44" (1/1) ... [2021-12-17 22:20:44,801 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 22:20:44,802 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 22:20:44,802 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 22:20:44,803 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 22:20:44,804 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:20:44" (1/1) ... [2021-12-17 22:20:44,810 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 22:20:44,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 22:20:44,846 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) [2021-12-17 22:20:44,847 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 [2021-12-17 22:20:44,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-17 22:20:44,874 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-17 22:20:44,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 22:20:44,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 22:20:44,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 22:20:44,874 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-12-17 22:20:44,874 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-12-17 22:20:44,874 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-12-17 22:20:44,874 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-12-17 22:20:44,875 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-12-17 22:20:44,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-12-17 22:20:44,875 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-12-17 22:20:44,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-12-17 22:20:44,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 22:20:44,875 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-17 22:20:44,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 22:20:44,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 22:20:44,877 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-17 22:20:44,984 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 22:20:44,985 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 22:20:45,392 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 22:20:45,651 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 22:20:45,651 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-17 22:20:45,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:20:45 BoogieIcfgContainer [2021-12-17 22:20:45,653 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 22:20:45,655 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 22:20:45,655 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 22:20:45,658 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 22:20:45,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 10:20:44" (1/3) ... [2021-12-17 22:20:45,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@122f4ce6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 10:20:45, skipping insertion in model container [2021-12-17 22:20:45,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:20:44" (2/3) ... [2021-12-17 22:20:45,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@122f4ce6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 10:20:45, skipping insertion in model container [2021-12-17 22:20:45,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:20:45" (3/3) ... [2021-12-17 22:20:45,660 INFO L111 eAbstractionObserver]: Analyzing ICFG mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2021-12-17 22:20:45,665 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-17 22:20:45,665 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 22:20:45,665 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-17 22:20:45,665 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-17 22:20:45,704 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,704 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,704 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,705 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,705 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,705 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,705 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,705 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,706 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,706 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,707 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,707 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,707 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,707 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,707 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,708 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,708 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,708 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,709 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,709 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,709 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,710 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,710 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,710 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,711 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,711 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,711 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,711 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,711 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,711 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,712 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,712 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,712 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,712 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,712 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,713 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,713 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,713 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,713 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,713 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,714 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,714 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,714 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,714 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,714 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,715 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,715 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,715 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,715 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,715 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,716 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,716 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,716 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,716 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,717 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,717 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,717 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,717 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,718 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,718 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,718 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,718 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,719 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,719 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,719 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,719 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,720 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,720 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,720 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,720 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,720 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,720 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,720 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,721 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,721 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,721 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,722 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,722 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,724 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,724 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,725 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,725 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,725 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,726 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,729 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,729 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,730 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,734 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,734 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,734 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,735 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,735 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,735 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,735 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,736 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,736 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,736 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,736 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,737 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,737 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,737 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,737 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,737 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,738 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,738 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,738 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,738 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,738 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,739 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,739 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,739 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,739 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,740 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,740 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:20:45,740 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-17 22:20:45,772 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 22:20:45,778 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 22:20:45,778 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-12-17 22:20:45,787 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 284 flow [2021-12-17 22:20:45,856 INFO L129 PetriNetUnfolder]: 2/128 cut-off events. [2021-12-17 22:20:45,857 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-17 22:20:45,860 INFO L84 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2021-12-17 22:20:45,861 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 132 transitions, 284 flow [2021-12-17 22:20:45,868 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 128 transitions, 268 flow [2021-12-17 22:20:45,890 INFO L129 PetriNetUnfolder]: 0/88 cut-off events. [2021-12-17 22:20:45,891 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-17 22:20:45,891 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:20:45,892 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] [2021-12-17 22:20:45,892 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:20:45,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:20:45,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1238926700, now seen corresponding path program 1 times [2021-12-17 22:20:45,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:20:45,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480267591] [2021-12-17 22:20:45,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:20:45,907 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:20:46,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:20:46,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:20:46,256 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:20:46,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480267591] [2021-12-17 22:20:46,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480267591] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:20:46,257 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:20:46,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 22:20:46,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721348341] [2021-12-17 22:20:46,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:20:46,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 22:20:46,269 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:20:46,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 22:20:46,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 22:20:46,301 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 132 [2021-12-17 22:20:46,307 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 128 transitions, 268 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:46,308 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:20:46,308 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 132 [2021-12-17 22:20:46,309 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:20:46,422 INFO L129 PetriNetUnfolder]: 17/270 cut-off events. [2021-12-17 22:20:46,422 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-12-17 22:20:46,424 INFO L84 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 270 events. 17/270 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 806 event pairs, 7 based on Foata normal form. 8/266 useless extension candidates. Maximal degree in co-relation 271. Up to 27 conditions per place. [2021-12-17 22:20:46,427 INFO L132 encePairwiseOnDemand]: 127/132 looper letters, 11 selfloop transitions, 2 changer transitions 0/127 dead transitions. [2021-12-17 22:20:46,427 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 127 transitions, 292 flow [2021-12-17 22:20:46,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 22:20:46,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-17 22:20:46,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2021-12-17 22:20:46,445 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9393939393939394 [2021-12-17 22:20:46,446 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 372 transitions. [2021-12-17 22:20:46,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 372 transitions. [2021-12-17 22:20:46,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:20:46,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 372 transitions. [2021-12-17 22:20:46,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:46,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:46,468 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:46,470 INFO L186 Difference]: Start difference. First operand has 139 places, 128 transitions, 268 flow. Second operand 3 states and 372 transitions. [2021-12-17 22:20:46,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 127 transitions, 292 flow [2021-12-17 22:20:46,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 127 transitions, 288 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-12-17 22:20:46,484 INFO L242 Difference]: Finished difference. Result has 135 places, 124 transitions, 260 flow [2021-12-17 22:20:46,486 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=260, PETRI_PLACES=135, PETRI_TRANSITIONS=124} [2021-12-17 22:20:46,491 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, -4 predicate places. [2021-12-17 22:20:46,492 INFO L470 AbstractCegarLoop]: Abstraction has has 135 places, 124 transitions, 260 flow [2021-12-17 22:20:46,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:46,492 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:20:46,493 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] [2021-12-17 22:20:46,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 22:20:46,493 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:20:46,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:20:46,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1562893151, now seen corresponding path program 1 times [2021-12-17 22:20:46,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:20:46,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540291380] [2021-12-17 22:20:46,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:20:46,495 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:20:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:20:46,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:20:46,749 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:20:46,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540291380] [2021-12-17 22:20:46,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540291380] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:20:46,750 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:20:46,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 22:20:46,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123803796] [2021-12-17 22:20:46,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:20:46,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 22:20:46,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:20:46,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 22:20:46,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 22:20:46,754 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 132 [2021-12-17 22:20:46,755 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 124 transitions, 260 flow. Second operand has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:46,755 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:20:46,756 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 132 [2021-12-17 22:20:46,756 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:20:47,265 INFO L129 PetriNetUnfolder]: 538/1750 cut-off events. [2021-12-17 22:20:47,265 INFO L130 PetriNetUnfolder]: For 92/92 co-relation queries the response was YES. [2021-12-17 22:20:47,275 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2706 conditions, 1750 events. 538/1750 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 13200 event pairs, 46 based on Foata normal form. 0/1706 useless extension candidates. Maximal degree in co-relation 2652. Up to 442 conditions per place. [2021-12-17 22:20:47,282 INFO L132 encePairwiseOnDemand]: 125/132 looper letters, 23 selfloop transitions, 3 changer transitions 53/172 dead transitions. [2021-12-17 22:20:47,283 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 172 transitions, 508 flow [2021-12-17 22:20:47,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 22:20:47,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-17 22:20:47,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1058 transitions. [2021-12-17 22:20:47,288 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8905723905723906 [2021-12-17 22:20:47,289 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1058 transitions. [2021-12-17 22:20:47,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1058 transitions. [2021-12-17 22:20:47,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:20:47,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1058 transitions. [2021-12-17 22:20:47,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 117.55555555555556) internal successors, (1058), 9 states have internal predecessors, (1058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:47,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 132.0) internal successors, (1320), 10 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:47,297 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 132.0) internal successors, (1320), 10 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:47,297 INFO L186 Difference]: Start difference. First operand has 135 places, 124 transitions, 260 flow. Second operand 9 states and 1058 transitions. [2021-12-17 22:20:47,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 172 transitions, 508 flow [2021-12-17 22:20:47,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 172 transitions, 490 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-17 22:20:47,303 INFO L242 Difference]: Finished difference. Result has 148 places, 112 transitions, 271 flow [2021-12-17 22:20:47,303 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=271, PETRI_PLACES=148, PETRI_TRANSITIONS=112} [2021-12-17 22:20:47,304 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 9 predicate places. [2021-12-17 22:20:47,304 INFO L470 AbstractCegarLoop]: Abstraction has has 148 places, 112 transitions, 271 flow [2021-12-17 22:20:47,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:47,305 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:20:47,305 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] [2021-12-17 22:20:47,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 22:20:47,306 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:20:47,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:20:47,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1766184576, now seen corresponding path program 1 times [2021-12-17 22:20:47,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:20:47,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272057717] [2021-12-17 22:20:47,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:20:47,307 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:20:47,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:20:47,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:20:47,621 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:20:47,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272057717] [2021-12-17 22:20:47,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272057717] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:20:47,622 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:20:47,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-17 22:20:47,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607274614] [2021-12-17 22:20:47,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:20:47,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 22:20:47,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:20:47,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 22:20:47,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-12-17 22:20:47,626 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 132 [2021-12-17 22:20:47,627 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 112 transitions, 271 flow. Second operand has 11 states, 11 states have (on average 108.45454545454545) internal successors, (1193), 11 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:47,627 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:20:47,628 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 132 [2021-12-17 22:20:47,628 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:20:48,070 INFO L129 PetriNetUnfolder]: 317/929 cut-off events. [2021-12-17 22:20:48,070 INFO L130 PetriNetUnfolder]: For 971/987 co-relation queries the response was YES. [2021-12-17 22:20:48,078 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2104 conditions, 929 events. 317/929 cut-off events. For 971/987 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5965 event pairs, 133 based on Foata normal form. 27/919 useless extension candidates. Maximal degree in co-relation 2039. Up to 263 conditions per place. [2021-12-17 22:20:48,083 INFO L132 encePairwiseOnDemand]: 119/132 looper letters, 17 selfloop transitions, 11 changer transitions 34/154 dead transitions. [2021-12-17 22:20:48,084 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 154 transitions, 509 flow [2021-12-17 22:20:48,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-17 22:20:48,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-17 22:20:48,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1777 transitions. [2021-12-17 22:20:48,089 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8413825757575758 [2021-12-17 22:20:48,089 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1777 transitions. [2021-12-17 22:20:48,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1777 transitions. [2021-12-17 22:20:48,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:20:48,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1777 transitions. [2021-12-17 22:20:48,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 111.0625) internal successors, (1777), 16 states have internal predecessors, (1777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:48,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 132.0) internal successors, (2244), 17 states have internal predecessors, (2244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:48,100 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 132.0) internal successors, (2244), 17 states have internal predecessors, (2244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:48,100 INFO L186 Difference]: Start difference. First operand has 148 places, 112 transitions, 271 flow. Second operand 16 states and 1777 transitions. [2021-12-17 22:20:48,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 154 transitions, 509 flow [2021-12-17 22:20:48,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 154 transitions, 488 flow, removed 9 selfloop flow, removed 4 redundant places. [2021-12-17 22:20:48,108 INFO L242 Difference]: Finished difference. Result has 150 places, 118 transitions, 350 flow [2021-12-17 22:20:48,109 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=350, PETRI_PLACES=150, PETRI_TRANSITIONS=118} [2021-12-17 22:20:48,109 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 11 predicate places. [2021-12-17 22:20:48,110 INFO L470 AbstractCegarLoop]: Abstraction has has 150 places, 118 transitions, 350 flow [2021-12-17 22:20:48,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 108.45454545454545) internal successors, (1193), 11 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:48,110 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:20:48,111 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, 1] [2021-12-17 22:20:48,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-17 22:20:48,111 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:20:48,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:20:48,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1941303266, now seen corresponding path program 1 times [2021-12-17 22:20:48,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:20:48,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822661211] [2021-12-17 22:20:48,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:20:48,113 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:20:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:20:48,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:20:48,398 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:20:48,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822661211] [2021-12-17 22:20:48,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822661211] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:20:48,399 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:20:48,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-17 22:20:48,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062855134] [2021-12-17 22:20:48,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:20:48,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 22:20:48,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:20:48,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 22:20:48,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-12-17 22:20:48,407 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 132 [2021-12-17 22:20:48,410 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 118 transitions, 350 flow. Second operand has 11 states, 11 states have (on average 105.63636363636364) internal successors, (1162), 11 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:48,410 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:20:48,410 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 132 [2021-12-17 22:20:48,410 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:20:49,100 INFO L129 PetriNetUnfolder]: 879/1738 cut-off events. [2021-12-17 22:20:49,101 INFO L130 PetriNetUnfolder]: For 5107/5268 co-relation queries the response was YES. [2021-12-17 22:20:49,114 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5855 conditions, 1738 events. 879/1738 cut-off events. For 5107/5268 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 10660 event pairs, 281 based on Foata normal form. 49/1669 useless extension candidates. Maximal degree in co-relation 5775. Up to 773 conditions per place. [2021-12-17 22:20:49,126 INFO L132 encePairwiseOnDemand]: 119/132 looper letters, 31 selfloop transitions, 18 changer transitions 55/193 dead transitions. [2021-12-17 22:20:49,126 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 193 transitions, 944 flow [2021-12-17 22:20:49,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-17 22:20:49,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2021-12-17 22:20:49,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2179 transitions. [2021-12-17 22:20:49,132 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8253787878787879 [2021-12-17 22:20:49,132 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2179 transitions. [2021-12-17 22:20:49,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2179 transitions. [2021-12-17 22:20:49,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:20:49,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2179 transitions. [2021-12-17 22:20:49,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 108.95) internal successors, (2179), 20 states have internal predecessors, (2179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:49,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 132.0) internal successors, (2772), 21 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:49,144 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 132.0) internal successors, (2772), 21 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:49,144 INFO L186 Difference]: Start difference. First operand has 150 places, 118 transitions, 350 flow. Second operand 20 states and 2179 transitions. [2021-12-17 22:20:49,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 193 transitions, 944 flow [2021-12-17 22:20:49,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 193 transitions, 916 flow, removed 11 selfloop flow, removed 6 redundant places. [2021-12-17 22:20:49,156 INFO L242 Difference]: Finished difference. Result has 170 places, 132 transitions, 503 flow [2021-12-17 22:20:49,156 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=503, PETRI_PLACES=170, PETRI_TRANSITIONS=132} [2021-12-17 22:20:49,157 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 31 predicate places. [2021-12-17 22:20:49,157 INFO L470 AbstractCegarLoop]: Abstraction has has 170 places, 132 transitions, 503 flow [2021-12-17 22:20:49,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 105.63636363636364) internal successors, (1162), 11 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:49,158 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:20:49,158 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, 1, 1] [2021-12-17 22:20:49,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-17 22:20:49,159 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:20:49,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:20:49,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1621057582, now seen corresponding path program 1 times [2021-12-17 22:20:49,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:20:49,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478534118] [2021-12-17 22:20:49,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:20:49,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:20:49,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:20:49,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:20:49,357 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:20:49,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478534118] [2021-12-17 22:20:49,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478534118] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:20:49,358 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:20:49,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-17 22:20:49,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665162359] [2021-12-17 22:20:49,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:20:49,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 22:20:49,359 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:20:49,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 22:20:49,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-12-17 22:20:49,361 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 132 [2021-12-17 22:20:49,362 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 132 transitions, 503 flow. Second operand has 9 states, 9 states have (on average 109.77777777777777) internal successors, (988), 9 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:49,362 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:20:49,362 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 132 [2021-12-17 22:20:49,362 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:20:49,810 INFO L129 PetriNetUnfolder]: 565/1345 cut-off events. [2021-12-17 22:20:49,810 INFO L130 PetriNetUnfolder]: For 8644/8879 co-relation queries the response was YES. [2021-12-17 22:20:49,822 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5441 conditions, 1345 events. 565/1345 cut-off events. For 8644/8879 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 8768 event pairs, 228 based on Foata normal form. 40/1301 useless extension candidates. Maximal degree in co-relation 5347. Up to 487 conditions per place. [2021-12-17 22:20:49,832 INFO L132 encePairwiseOnDemand]: 121/132 looper letters, 27 selfloop transitions, 25 changer transitions 6/158 dead transitions. [2021-12-17 22:20:49,832 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 158 transitions, 829 flow [2021-12-17 22:20:49,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 22:20:49,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-17 22:20:49,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1346 transitions. [2021-12-17 22:20:49,836 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8497474747474747 [2021-12-17 22:20:49,836 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1346 transitions. [2021-12-17 22:20:49,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1346 transitions. [2021-12-17 22:20:49,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:20:49,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1346 transitions. [2021-12-17 22:20:49,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 112.16666666666667) internal successors, (1346), 12 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:49,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 132.0) internal successors, (1716), 13 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:49,844 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 132.0) internal successors, (1716), 13 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:49,844 INFO L186 Difference]: Start difference. First operand has 170 places, 132 transitions, 503 flow. Second operand 12 states and 1346 transitions. [2021-12-17 22:20:49,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 158 transitions, 829 flow [2021-12-17 22:20:49,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 158 transitions, 755 flow, removed 35 selfloop flow, removed 14 redundant places. [2021-12-17 22:20:49,863 INFO L242 Difference]: Finished difference. Result has 160 places, 144 transitions, 649 flow [2021-12-17 22:20:49,863 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=649, PETRI_PLACES=160, PETRI_TRANSITIONS=144} [2021-12-17 22:20:49,864 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 21 predicate places. [2021-12-17 22:20:49,864 INFO L470 AbstractCegarLoop]: Abstraction has has 160 places, 144 transitions, 649 flow [2021-12-17 22:20:49,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 109.77777777777777) internal successors, (988), 9 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:49,865 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:20:49,865 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, 1, 1] [2021-12-17 22:20:49,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-17 22:20:49,866 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:20:49,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:20:49,866 INFO L85 PathProgramCache]: Analyzing trace with hash -837595891, now seen corresponding path program 1 times [2021-12-17 22:20:49,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:20:49,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707752103] [2021-12-17 22:20:49,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:20:49,867 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:20:49,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:20:50,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:20:50,015 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:20:50,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707752103] [2021-12-17 22:20:50,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707752103] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:20:50,015 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:20:50,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-17 22:20:50,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967848857] [2021-12-17 22:20:50,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:20:50,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 22:20:50,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:20:50,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 22:20:50,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-17 22:20:50,018 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 132 [2021-12-17 22:20:50,019 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 144 transitions, 649 flow. Second operand has 9 states, 9 states have (on average 110.66666666666667) internal successors, (996), 9 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:50,020 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:20:50,020 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 132 [2021-12-17 22:20:50,020 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:20:50,523 INFO L129 PetriNetUnfolder]: 595/1455 cut-off events. [2021-12-17 22:20:50,523 INFO L130 PetriNetUnfolder]: For 9517/9757 co-relation queries the response was YES. [2021-12-17 22:20:50,536 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6063 conditions, 1455 events. 595/1455 cut-off events. For 9517/9757 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 9769 event pairs, 153 based on Foata normal form. 33/1417 useless extension candidates. Maximal degree in co-relation 5973. Up to 563 conditions per place. [2021-12-17 22:20:50,545 INFO L132 encePairwiseOnDemand]: 122/132 looper letters, 51 selfloop transitions, 18 changer transitions 2/172 dead transitions. [2021-12-17 22:20:50,546 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 172 transitions, 1009 flow [2021-12-17 22:20:50,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 22:20:50,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-17 22:20:50,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1358 transitions. [2021-12-17 22:20:50,550 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8573232323232324 [2021-12-17 22:20:50,550 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1358 transitions. [2021-12-17 22:20:50,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1358 transitions. [2021-12-17 22:20:50,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:20:50,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1358 transitions. [2021-12-17 22:20:50,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 113.16666666666667) internal successors, (1358), 12 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:50,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 132.0) internal successors, (1716), 13 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:50,558 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 132.0) internal successors, (1716), 13 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:50,558 INFO L186 Difference]: Start difference. First operand has 160 places, 144 transitions, 649 flow. Second operand 12 states and 1358 transitions. [2021-12-17 22:20:50,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 172 transitions, 1009 flow [2021-12-17 22:20:50,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 172 transitions, 941 flow, removed 30 selfloop flow, removed 3 redundant places. [2021-12-17 22:20:50,578 INFO L242 Difference]: Finished difference. Result has 171 places, 156 transitions, 760 flow [2021-12-17 22:20:50,579 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=597, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=760, PETRI_PLACES=171, PETRI_TRANSITIONS=156} [2021-12-17 22:20:50,581 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 32 predicate places. [2021-12-17 22:20:50,581 INFO L470 AbstractCegarLoop]: Abstraction has has 171 places, 156 transitions, 760 flow [2021-12-17 22:20:50,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 110.66666666666667) internal successors, (996), 9 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:50,582 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:20:50,582 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, 1, 1, 1, 1] [2021-12-17 22:20:50,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-17 22:20:50,582 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:20:50,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:20:50,583 INFO L85 PathProgramCache]: Analyzing trace with hash -27009563, now seen corresponding path program 1 times [2021-12-17 22:20:50,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:20:50,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088617872] [2021-12-17 22:20:50,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:20:50,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:20:50,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:20:50,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:20:50,693 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:20:50,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088617872] [2021-12-17 22:20:50,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088617872] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:20:50,694 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:20:50,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 22:20:50,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799735249] [2021-12-17 22:20:50,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:20:50,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 22:20:50,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:20:50,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 22:20:50,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 22:20:50,696 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 132 [2021-12-17 22:20:50,697 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 156 transitions, 760 flow. Second operand has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:50,697 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:20:50,697 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 132 [2021-12-17 22:20:50,697 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:20:51,453 INFO L129 PetriNetUnfolder]: 1095/2869 cut-off events. [2021-12-17 22:20:51,454 INFO L130 PetriNetUnfolder]: For 18361/19032 co-relation queries the response was YES. [2021-12-17 22:20:51,479 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11477 conditions, 2869 events. 1095/2869 cut-off events. For 18361/19032 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 24442 event pairs, 203 based on Foata normal form. 29/2776 useless extension candidates. Maximal degree in co-relation 11386. Up to 719 conditions per place. [2021-12-17 22:20:51,492 INFO L132 encePairwiseOnDemand]: 126/132 looper letters, 49 selfloop transitions, 7 changer transitions 74/228 dead transitions. [2021-12-17 22:20:51,492 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 228 transitions, 1733 flow [2021-12-17 22:20:51,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 22:20:51,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-17 22:20:51,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1045 transitions. [2021-12-17 22:20:51,495 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8796296296296297 [2021-12-17 22:20:51,496 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1045 transitions. [2021-12-17 22:20:51,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1045 transitions. [2021-12-17 22:20:51,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:20:51,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1045 transitions. [2021-12-17 22:20:51,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 116.11111111111111) internal successors, (1045), 9 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:51,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 132.0) internal successors, (1320), 10 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:51,501 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 132.0) internal successors, (1320), 10 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:51,501 INFO L186 Difference]: Start difference. First operand has 171 places, 156 transitions, 760 flow. Second operand 9 states and 1045 transitions. [2021-12-17 22:20:51,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 228 transitions, 1733 flow [2021-12-17 22:20:51,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 228 transitions, 1503 flow, removed 109 selfloop flow, removed 7 redundant places. [2021-12-17 22:20:51,543 INFO L242 Difference]: Finished difference. Result has 179 places, 137 transitions, 570 flow [2021-12-17 22:20:51,544 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=570, PETRI_PLACES=179, PETRI_TRANSITIONS=137} [2021-12-17 22:20:51,544 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 40 predicate places. [2021-12-17 22:20:51,544 INFO L470 AbstractCegarLoop]: Abstraction has has 179 places, 137 transitions, 570 flow [2021-12-17 22:20:51,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:51,545 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:20:51,545 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, 1, 1, 1, 1] [2021-12-17 22:20:51,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-17 22:20:51,546 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:20:51,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:20:51,546 INFO L85 PathProgramCache]: Analyzing trace with hash 844356125, now seen corresponding path program 1 times [2021-12-17 22:20:51,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:20:51,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297122905] [2021-12-17 22:20:51,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:20:51,547 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:20:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:20:51,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:20:51,690 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:20:51,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297122905] [2021-12-17 22:20:51,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297122905] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:20:51,691 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:20:51,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 22:20:51,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561654466] [2021-12-17 22:20:51,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:20:51,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 22:20:51,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:20:51,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 22:20:51,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-17 22:20:51,693 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 132 [2021-12-17 22:20:51,694 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 137 transitions, 570 flow. Second operand has 8 states, 8 states have (on average 111.0) internal successors, (888), 8 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:51,695 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:20:51,695 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 132 [2021-12-17 22:20:51,695 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:20:52,227 INFO L129 PetriNetUnfolder]: 481/1395 cut-off events. [2021-12-17 22:20:52,227 INFO L130 PetriNetUnfolder]: For 10368/11154 co-relation queries the response was YES. [2021-12-17 22:20:52,240 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5872 conditions, 1395 events. 481/1395 cut-off events. For 10368/11154 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 10248 event pairs, 100 based on Foata normal form. 32/1324 useless extension candidates. Maximal degree in co-relation 5778. Up to 470 conditions per place. [2021-12-17 22:20:52,250 INFO L132 encePairwiseOnDemand]: 122/132 looper letters, 33 selfloop transitions, 14 changer transitions 22/170 dead transitions. [2021-12-17 22:20:52,250 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 170 transitions, 1070 flow [2021-12-17 22:20:52,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 22:20:52,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-17 22:20:52,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1251 transitions. [2021-12-17 22:20:52,254 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8615702479338843 [2021-12-17 22:20:52,254 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1251 transitions. [2021-12-17 22:20:52,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1251 transitions. [2021-12-17 22:20:52,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:20:52,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1251 transitions. [2021-12-17 22:20:52,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 113.72727272727273) internal successors, (1251), 11 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:52,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 132.0) internal successors, (1584), 12 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:52,261 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 132.0) internal successors, (1584), 12 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:52,261 INFO L186 Difference]: Start difference. First operand has 179 places, 137 transitions, 570 flow. Second operand 11 states and 1251 transitions. [2021-12-17 22:20:52,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 170 transitions, 1070 flow [2021-12-17 22:20:52,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 170 transitions, 962 flow, removed 51 selfloop flow, removed 11 redundant places. [2021-12-17 22:20:52,280 INFO L242 Difference]: Finished difference. Result has 169 places, 142 transitions, 646 flow [2021-12-17 22:20:52,281 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=646, PETRI_PLACES=169, PETRI_TRANSITIONS=142} [2021-12-17 22:20:52,282 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 30 predicate places. [2021-12-17 22:20:52,282 INFO L470 AbstractCegarLoop]: Abstraction has has 169 places, 142 transitions, 646 flow [2021-12-17 22:20:52,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 111.0) internal successors, (888), 8 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:52,283 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:20:52,283 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, 1, 1, 1, 1] [2021-12-17 22:20:52,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-17 22:20:52,283 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:20:52,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:20:52,284 INFO L85 PathProgramCache]: Analyzing trace with hash -697358763, now seen corresponding path program 2 times [2021-12-17 22:20:52,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:20:52,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364966143] [2021-12-17 22:20:52,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:20:52,285 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:20:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:20:52,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:20:52,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:20:52,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364966143] [2021-12-17 22:20:52,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364966143] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:20:52,469 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:20:52,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-17 22:20:52,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889731929] [2021-12-17 22:20:52,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:20:52,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 22:20:52,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:20:52,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 22:20:52,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-12-17 22:20:52,472 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 132 [2021-12-17 22:20:52,473 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 142 transitions, 646 flow. Second operand has 10 states, 10 states have (on average 109.7) internal successors, (1097), 10 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:52,473 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:20:52,473 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 132 [2021-12-17 22:20:52,474 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:20:52,988 INFO L129 PetriNetUnfolder]: 459/1319 cut-off events. [2021-12-17 22:20:52,988 INFO L130 PetriNetUnfolder]: For 7881/8417 co-relation queries the response was YES. [2021-12-17 22:20:53,040 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5656 conditions, 1319 events. 459/1319 cut-off events. For 7881/8417 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 9191 event pairs, 80 based on Foata normal form. 63/1285 useless extension candidates. Maximal degree in co-relation 5562. Up to 418 conditions per place. [2021-12-17 22:20:53,051 INFO L132 encePairwiseOnDemand]: 121/132 looper letters, 32 selfloop transitions, 21 changer transitions 19/172 dead transitions. [2021-12-17 22:20:53,051 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 172 transitions, 1090 flow [2021-12-17 22:20:53,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 22:20:53,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-17 22:20:53,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1461 transitions. [2021-12-17 22:20:53,055 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8513986013986014 [2021-12-17 22:20:53,055 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1461 transitions. [2021-12-17 22:20:53,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1461 transitions. [2021-12-17 22:20:53,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:20:53,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1461 transitions. [2021-12-17 22:20:53,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 112.38461538461539) internal successors, (1461), 13 states have internal predecessors, (1461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:53,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 132.0) internal successors, (1848), 14 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:53,062 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 132.0) internal successors, (1848), 14 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:53,063 INFO L186 Difference]: Start difference. First operand has 169 places, 142 transitions, 646 flow. Second operand 13 states and 1461 transitions. [2021-12-17 22:20:53,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 172 transitions, 1090 flow [2021-12-17 22:20:53,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 172 transitions, 1019 flow, removed 35 selfloop flow, removed 8 redundant places. [2021-12-17 22:20:53,081 INFO L242 Difference]: Finished difference. Result has 173 places, 146 transitions, 713 flow [2021-12-17 22:20:53,082 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=713, PETRI_PLACES=173, PETRI_TRANSITIONS=146} [2021-12-17 22:20:53,082 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 34 predicate places. [2021-12-17 22:20:53,083 INFO L470 AbstractCegarLoop]: Abstraction has has 173 places, 146 transitions, 713 flow [2021-12-17 22:20:53,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 109.7) internal successors, (1097), 10 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:53,083 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:20:53,084 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, 1, 1, 1, 1] [2021-12-17 22:20:53,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-17 22:20:53,084 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:20:53,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:20:53,084 INFO L85 PathProgramCache]: Analyzing trace with hash -624245821, now seen corresponding path program 3 times [2021-12-17 22:20:53,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:20:53,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991048410] [2021-12-17 22:20:53,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:20:53,085 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:20:53,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:20:53,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:20:53,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:20:53,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991048410] [2021-12-17 22:20:53,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991048410] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:20:53,229 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:20:53,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 22:20:53,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291851110] [2021-12-17 22:20:53,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:20:53,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 22:20:53,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:20:53,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 22:20:53,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-17 22:20:53,232 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 132 [2021-12-17 22:20:53,233 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 146 transitions, 713 flow. Second operand has 8 states, 8 states have (on average 111.0) internal successors, (888), 8 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:53,233 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:20:53,233 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 132 [2021-12-17 22:20:53,233 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:20:53,622 INFO L129 PetriNetUnfolder]: 415/1255 cut-off events. [2021-12-17 22:20:53,622 INFO L130 PetriNetUnfolder]: For 10110/10543 co-relation queries the response was YES. [2021-12-17 22:20:53,632 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5811 conditions, 1255 events. 415/1255 cut-off events. For 10110/10543 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 8856 event pairs, 80 based on Foata normal form. 50/1210 useless extension candidates. Maximal degree in co-relation 5716. Up to 344 conditions per place. [2021-12-17 22:20:53,639 INFO L132 encePairwiseOnDemand]: 123/132 looper letters, 36 selfloop transitions, 16 changer transitions 20/173 dead transitions. [2021-12-17 22:20:53,639 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 173 transitions, 1203 flow [2021-12-17 22:20:53,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 22:20:53,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-17 22:20:53,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1247 transitions. [2021-12-17 22:20:53,642 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8588154269972452 [2021-12-17 22:20:53,642 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1247 transitions. [2021-12-17 22:20:53,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1247 transitions. [2021-12-17 22:20:53,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:20:53,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1247 transitions. [2021-12-17 22:20:53,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 113.36363636363636) internal successors, (1247), 11 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:53,647 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 132.0) internal successors, (1584), 12 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:53,648 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 132.0) internal successors, (1584), 12 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:53,648 INFO L186 Difference]: Start difference. First operand has 173 places, 146 transitions, 713 flow. Second operand 11 states and 1247 transitions. [2021-12-17 22:20:53,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 173 transitions, 1203 flow [2021-12-17 22:20:53,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 173 transitions, 1082 flow, removed 53 selfloop flow, removed 9 redundant places. [2021-12-17 22:20:53,666 INFO L242 Difference]: Finished difference. Result has 175 places, 147 transitions, 756 flow [2021-12-17 22:20:53,667 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=756, PETRI_PLACES=175, PETRI_TRANSITIONS=147} [2021-12-17 22:20:53,667 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 36 predicate places. [2021-12-17 22:20:53,667 INFO L470 AbstractCegarLoop]: Abstraction has has 175 places, 147 transitions, 756 flow [2021-12-17 22:20:53,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 111.0) internal successors, (888), 8 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:53,668 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:20:53,668 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, 1, 1, 1, 1, 1] [2021-12-17 22:20:53,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-17 22:20:53,669 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:20:53,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:20:53,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1263450606, now seen corresponding path program 1 times [2021-12-17 22:20:53,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:20:53,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304066660] [2021-12-17 22:20:53,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:20:53,670 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:20:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:20:53,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:20:53,969 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:20:53,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304066660] [2021-12-17 22:20:53,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304066660] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:20:53,969 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:20:53,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-17 22:20:53,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440559745] [2021-12-17 22:20:53,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:20:53,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-17 22:20:53,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:20:53,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-17 22:20:53,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-12-17 22:20:53,972 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 132 [2021-12-17 22:20:53,985 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 147 transitions, 756 flow. Second operand has 12 states, 12 states have (on average 108.58333333333333) internal successors, (1303), 12 states have internal predecessors, (1303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:53,985 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:20:53,985 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 132 [2021-12-17 22:20:53,985 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:20:54,381 INFO L129 PetriNetUnfolder]: 315/1040 cut-off events. [2021-12-17 22:20:54,381 INFO L130 PetriNetUnfolder]: For 9546/10001 co-relation queries the response was YES. [2021-12-17 22:20:54,391 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5059 conditions, 1040 events. 315/1040 cut-off events. For 9546/10001 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6964 event pairs, 38 based on Foata normal form. 31/986 useless extension candidates. Maximal degree in co-relation 4960. Up to 322 conditions per place. [2021-12-17 22:20:54,399 INFO L132 encePairwiseOnDemand]: 120/132 looper letters, 35 selfloop transitions, 22 changer transitions 10/166 dead transitions. [2021-12-17 22:20:54,399 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 166 transitions, 1136 flow [2021-12-17 22:20:54,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-17 22:20:54,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-17 22:20:54,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1543 transitions. [2021-12-17 22:20:54,401 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.83495670995671 [2021-12-17 22:20:54,402 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1543 transitions. [2021-12-17 22:20:54,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1543 transitions. [2021-12-17 22:20:54,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:20:54,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1543 transitions. [2021-12-17 22:20:54,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 110.21428571428571) internal successors, (1543), 14 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:54,407 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 132.0) internal successors, (1980), 15 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:54,407 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 132.0) internal successors, (1980), 15 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:54,408 INFO L186 Difference]: Start difference. First operand has 175 places, 147 transitions, 756 flow. Second operand 14 states and 1543 transitions. [2021-12-17 22:20:54,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 166 transitions, 1136 flow [2021-12-17 22:20:54,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 166 transitions, 1082 flow, removed 18 selfloop flow, removed 6 redundant places. [2021-12-17 22:20:54,427 INFO L242 Difference]: Finished difference. Result has 183 places, 148 transitions, 831 flow [2021-12-17 22:20:54,427 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=831, PETRI_PLACES=183, PETRI_TRANSITIONS=148} [2021-12-17 22:20:54,428 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 44 predicate places. [2021-12-17 22:20:54,428 INFO L470 AbstractCegarLoop]: Abstraction has has 183 places, 148 transitions, 831 flow [2021-12-17 22:20:54,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 108.58333333333333) internal successors, (1303), 12 states have internal predecessors, (1303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:54,428 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:20:54,429 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, 1, 1, 1, 1, 1] [2021-12-17 22:20:54,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-17 22:20:54,429 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:20:54,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:20:54,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1625457168, now seen corresponding path program 2 times [2021-12-17 22:20:54,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:20:54,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588780373] [2021-12-17 22:20:54,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:20:54,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:20:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:20:54,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:20:54,646 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:20:54,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588780373] [2021-12-17 22:20:54,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588780373] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:20:54,646 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:20:54,646 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-17 22:20:54,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486611922] [2021-12-17 22:20:54,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:20:54,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-17 22:20:54,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:20:54,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-17 22:20:54,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-12-17 22:20:54,649 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 132 [2021-12-17 22:20:54,650 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 148 transitions, 831 flow. Second operand has 12 states, 12 states have (on average 106.75) internal successors, (1281), 12 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:54,650 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:20:54,650 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 132 [2021-12-17 22:20:54,650 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:20:55,121 INFO L129 PetriNetUnfolder]: 328/1089 cut-off events. [2021-12-17 22:20:55,121 INFO L130 PetriNetUnfolder]: For 13265/13804 co-relation queries the response was YES. [2021-12-17 22:20:55,133 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5762 conditions, 1089 events. 328/1089 cut-off events. For 13265/13804 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7434 event pairs, 63 based on Foata normal form. 40/1032 useless extension candidates. Maximal degree in co-relation 5655. Up to 412 conditions per place. [2021-12-17 22:20:55,141 INFO L132 encePairwiseOnDemand]: 120/132 looper letters, 42 selfloop transitions, 13 changer transitions 10/162 dead transitions. [2021-12-17 22:20:55,142 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 162 transitions, 1193 flow [2021-12-17 22:20:55,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 22:20:55,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-17 22:20:55,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1409 transitions. [2021-12-17 22:20:55,146 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8210955710955711 [2021-12-17 22:20:55,146 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1409 transitions. [2021-12-17 22:20:55,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1409 transitions. [2021-12-17 22:20:55,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:20:55,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1409 transitions. [2021-12-17 22:20:55,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 108.38461538461539) internal successors, (1409), 13 states have internal predecessors, (1409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:55,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 132.0) internal successors, (1848), 14 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:55,156 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 132.0) internal successors, (1848), 14 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:55,156 INFO L186 Difference]: Start difference. First operand has 183 places, 148 transitions, 831 flow. Second operand 13 states and 1409 transitions. [2021-12-17 22:20:55,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 162 transitions, 1193 flow [2021-12-17 22:20:55,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 162 transitions, 1120 flow, removed 30 selfloop flow, removed 11 redundant places. [2021-12-17 22:20:55,183 INFO L242 Difference]: Finished difference. Result has 185 places, 149 transitions, 875 flow [2021-12-17 22:20:55,183 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=875, PETRI_PLACES=185, PETRI_TRANSITIONS=149} [2021-12-17 22:20:55,185 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 46 predicate places. [2021-12-17 22:20:55,185 INFO L470 AbstractCegarLoop]: Abstraction has has 185 places, 149 transitions, 875 flow [2021-12-17 22:20:55,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 106.75) internal successors, (1281), 12 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:55,185 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:20:55,186 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, 1, 1, 1, 1, 1] [2021-12-17 22:20:55,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-17 22:20:55,186 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:20:55,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:20:55,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1144539626, now seen corresponding path program 3 times [2021-12-17 22:20:55,187 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:20:55,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408574152] [2021-12-17 22:20:55,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:20:55,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:20:55,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:20:55,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:20:55,418 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:20:55,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408574152] [2021-12-17 22:20:55,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408574152] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:20:55,418 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:20:55,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-17 22:20:55,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865855770] [2021-12-17 22:20:55,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:20:55,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-17 22:20:55,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:20:55,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-17 22:20:55,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-12-17 22:20:55,421 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 132 [2021-12-17 22:20:55,422 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 149 transitions, 875 flow. Second operand has 12 states, 12 states have (on average 106.75) internal successors, (1281), 12 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:55,422 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:20:55,423 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 132 [2021-12-17 22:20:55,423 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:20:55,974 INFO L129 PetriNetUnfolder]: 324/1076 cut-off events. [2021-12-17 22:20:55,974 INFO L130 PetriNetUnfolder]: For 14500/15039 co-relation queries the response was YES. [2021-12-17 22:20:55,984 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5945 conditions, 1076 events. 324/1076 cut-off events. For 14500/15039 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 7343 event pairs, 37 based on Foata normal form. 46/1030 useless extension candidates. Maximal degree in co-relation 5837. Up to 337 conditions per place. [2021-12-17 22:20:55,993 INFO L132 encePairwiseOnDemand]: 120/132 looper letters, 40 selfloop transitions, 22 changer transitions 10/169 dead transitions. [2021-12-17 22:20:55,993 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 169 transitions, 1317 flow [2021-12-17 22:20:55,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-17 22:20:55,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-12-17 22:20:55,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1629 transitions. [2021-12-17 22:20:55,996 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8227272727272728 [2021-12-17 22:20:55,997 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1629 transitions. [2021-12-17 22:20:55,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1629 transitions. [2021-12-17 22:20:55,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:20:55,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1629 transitions. [2021-12-17 22:20:56,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 108.6) internal successors, (1629), 15 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:56,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 132.0) internal successors, (2112), 16 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:56,004 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 132.0) internal successors, (2112), 16 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:56,004 INFO L186 Difference]: Start difference. First operand has 185 places, 149 transitions, 875 flow. Second operand 15 states and 1629 transitions. [2021-12-17 22:20:56,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 169 transitions, 1317 flow [2021-12-17 22:20:56,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 169 transitions, 1210 flow, removed 42 selfloop flow, removed 11 redundant places. [2021-12-17 22:20:56,032 INFO L242 Difference]: Finished difference. Result has 189 places, 150 transitions, 922 flow [2021-12-17 22:20:56,032 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=820, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=922, PETRI_PLACES=189, PETRI_TRANSITIONS=150} [2021-12-17 22:20:56,033 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 50 predicate places. [2021-12-17 22:20:56,033 INFO L470 AbstractCegarLoop]: Abstraction has has 189 places, 150 transitions, 922 flow [2021-12-17 22:20:56,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 106.75) internal successors, (1281), 12 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:56,034 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:20:56,034 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, 1, 1, 1, 1, 1] [2021-12-17 22:20:56,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-17 22:20:56,035 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:20:56,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:20:56,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1502628158, now seen corresponding path program 1 times [2021-12-17 22:20:56,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:20:56,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564886046] [2021-12-17 22:20:56,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:20:56,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:20:56,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:20:56,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:20:56,121 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:20:56,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564886046] [2021-12-17 22:20:56,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564886046] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:20:56,121 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:20:56,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 22:20:56,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899056536] [2021-12-17 22:20:56,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:20:56,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 22:20:56,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:20:56,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 22:20:56,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 22:20:56,124 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 132 [2021-12-17 22:20:56,124 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 150 transitions, 922 flow. Second operand has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:56,125 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:20:56,125 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 132 [2021-12-17 22:20:56,125 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:20:58,039 INFO L129 PetriNetUnfolder]: 7236/12775 cut-off events. [2021-12-17 22:20:58,039 INFO L130 PetriNetUnfolder]: For 149326/150809 co-relation queries the response was YES. [2021-12-17 22:20:58,134 INFO L84 FinitePrefix]: Finished finitePrefix Result has 59059 conditions, 12775 events. 7236/12775 cut-off events. For 149326/150809 co-relation queries the response was YES. Maximal size of possible extension queue 1004. Compared 107190 event pairs, 209 based on Foata normal form. 1048/12943 useless extension candidates. Maximal degree in co-relation 58956. Up to 4697 conditions per place. [2021-12-17 22:20:58,202 INFO L132 encePairwiseOnDemand]: 121/132 looper letters, 181 selfloop transitions, 20 changer transitions 0/302 dead transitions. [2021-12-17 22:20:58,202 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 302 transitions, 3328 flow [2021-12-17 22:20:58,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 22:20:58,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-17 22:20:58,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1154 transitions. [2021-12-17 22:20:58,205 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8742424242424243 [2021-12-17 22:20:58,205 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1154 transitions. [2021-12-17 22:20:58,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1154 transitions. [2021-12-17 22:20:58,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:20:58,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1154 transitions. [2021-12-17 22:20:58,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 115.4) internal successors, (1154), 10 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:58,210 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 132.0) internal successors, (1452), 11 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:58,211 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 132.0) internal successors, (1452), 11 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:58,211 INFO L186 Difference]: Start difference. First operand has 189 places, 150 transitions, 922 flow. Second operand 10 states and 1154 transitions. [2021-12-17 22:20:58,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 302 transitions, 3328 flow [2021-12-17 22:20:58,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 302 transitions, 3063 flow, removed 94 selfloop flow, removed 12 redundant places. [2021-12-17 22:20:58,374 INFO L242 Difference]: Finished difference. Result has 186 places, 168 transitions, 996 flow [2021-12-17 22:20:58,375 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=853, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=996, PETRI_PLACES=186, PETRI_TRANSITIONS=168} [2021-12-17 22:20:58,375 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 47 predicate places. [2021-12-17 22:20:58,375 INFO L470 AbstractCegarLoop]: Abstraction has has 186 places, 168 transitions, 996 flow [2021-12-17 22:20:58,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:58,376 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:20:58,376 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, 1, 1, 1, 1, 1, 1] [2021-12-17 22:20:58,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-17 22:20:58,376 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:20:58,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:20:58,377 INFO L85 PathProgramCache]: Analyzing trace with hash -874813574, now seen corresponding path program 1 times [2021-12-17 22:20:58,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:20:58,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325126556] [2021-12-17 22:20:58,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:20:58,378 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:20:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:20:58,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:20:58,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:20:58,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325126556] [2021-12-17 22:20:58,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325126556] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:20:58,577 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:20:58,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-17 22:20:58,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956686660] [2021-12-17 22:20:58,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:20:58,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 22:20:58,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:20:58,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 22:20:58,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-17 22:20:58,580 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 132 [2021-12-17 22:20:58,581 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 168 transitions, 996 flow. Second operand has 10 states, 10 states have (on average 108.9) internal successors, (1089), 10 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:58,581 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:20:58,581 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 132 [2021-12-17 22:20:58,581 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:20:59,644 INFO L129 PetriNetUnfolder]: 1291/4441 cut-off events. [2021-12-17 22:20:59,644 INFO L130 PetriNetUnfolder]: For 18106/21488 co-relation queries the response was YES. [2021-12-17 22:20:59,675 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16131 conditions, 4441 events. 1291/4441 cut-off events. For 18106/21488 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 47370 event pairs, 475 based on Foata normal form. 178/4126 useless extension candidates. Maximal degree in co-relation 16024. Up to 1293 conditions per place. [2021-12-17 22:20:59,705 INFO L132 encePairwiseOnDemand]: 123/132 looper letters, 46 selfloop transitions, 21 changer transitions 0/184 dead transitions. [2021-12-17 22:20:59,705 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 184 transitions, 1330 flow [2021-12-17 22:20:59,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 22:20:59,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-17 22:20:59,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1326 transitions. [2021-12-17 22:20:59,708 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8371212121212122 [2021-12-17 22:20:59,708 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1326 transitions. [2021-12-17 22:20:59,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1326 transitions. [2021-12-17 22:20:59,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:20:59,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1326 transitions. [2021-12-17 22:20:59,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 110.5) internal successors, (1326), 12 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:59,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 132.0) internal successors, (1716), 13 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:59,714 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 132.0) internal successors, (1716), 13 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:59,714 INFO L186 Difference]: Start difference. First operand has 186 places, 168 transitions, 996 flow. Second operand 12 states and 1326 transitions. [2021-12-17 22:20:59,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 184 transitions, 1330 flow [2021-12-17 22:20:59,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 184 transitions, 1308 flow, removed 10 selfloop flow, removed 1 redundant places. [2021-12-17 22:20:59,758 INFO L242 Difference]: Finished difference. Result has 203 places, 176 transitions, 1198 flow [2021-12-17 22:20:59,759 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=986, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1198, PETRI_PLACES=203, PETRI_TRANSITIONS=176} [2021-12-17 22:20:59,759 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 64 predicate places. [2021-12-17 22:20:59,760 INFO L470 AbstractCegarLoop]: Abstraction has has 203 places, 176 transitions, 1198 flow [2021-12-17 22:20:59,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 108.9) internal successors, (1089), 10 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:59,760 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:20:59,760 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, 1, 1, 1, 1, 1, 1] [2021-12-17 22:20:59,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-17 22:20:59,761 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:20:59,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:20:59,761 INFO L85 PathProgramCache]: Analyzing trace with hash 773555080, now seen corresponding path program 1 times [2021-12-17 22:20:59,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:20:59,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519514981] [2021-12-17 22:20:59,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:20:59,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:20:59,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:20:59,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:20:59,859 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:20:59,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519514981] [2021-12-17 22:20:59,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519514981] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:20:59,861 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:20:59,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 22:20:59,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802749372] [2021-12-17 22:20:59,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:20:59,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 22:20:59,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:20:59,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 22:20:59,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 22:20:59,864 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 132 [2021-12-17 22:20:59,865 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 176 transitions, 1198 flow. Second operand has 7 states, 7 states have (on average 109.28571428571429) internal successors, (765), 7 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:20:59,865 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:20:59,865 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 132 [2021-12-17 22:20:59,865 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:21:02,331 INFO L129 PetriNetUnfolder]: 7927/15039 cut-off events. [2021-12-17 22:21:02,332 INFO L130 PetriNetUnfolder]: For 116621/118939 co-relation queries the response was YES. [2021-12-17 22:21:02,435 INFO L84 FinitePrefix]: Finished finitePrefix Result has 76102 conditions, 15039 events. 7927/15039 cut-off events. For 116621/118939 co-relation queries the response was YES. Maximal size of possible extension queue 1275. Compared 140437 event pairs, 209 based on Foata normal form. 1353/15781 useless extension candidates. Maximal degree in co-relation 75990. Up to 4940 conditions per place. [2021-12-17 22:21:02,492 INFO L132 encePairwiseOnDemand]: 121/132 looper letters, 200 selfloop transitions, 38 changer transitions 31/370 dead transitions. [2021-12-17 22:21:02,493 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 370 transitions, 4391 flow [2021-12-17 22:21:02,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 22:21:02,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-17 22:21:02,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1503 transitions. [2021-12-17 22:21:02,496 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8758741258741258 [2021-12-17 22:21:02,496 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1503 transitions. [2021-12-17 22:21:02,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1503 transitions. [2021-12-17 22:21:02,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:21:02,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1503 transitions. [2021-12-17 22:21:02,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 115.61538461538461) internal successors, (1503), 13 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:21:02,502 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 132.0) internal successors, (1848), 14 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:21:02,502 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 132.0) internal successors, (1848), 14 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:21:02,503 INFO L186 Difference]: Start difference. First operand has 203 places, 176 transitions, 1198 flow. Second operand 13 states and 1503 transitions. [2021-12-17 22:21:02,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 370 transitions, 4391 flow [2021-12-17 22:21:02,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 370 transitions, 4171 flow, removed 70 selfloop flow, removed 5 redundant places. [2021-12-17 22:21:02,801 INFO L242 Difference]: Finished difference. Result has 216 places, 185 transitions, 1275 flow [2021-12-17 22:21:02,802 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=1056, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1275, PETRI_PLACES=216, PETRI_TRANSITIONS=185} [2021-12-17 22:21:02,802 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 77 predicate places. [2021-12-17 22:21:02,804 INFO L470 AbstractCegarLoop]: Abstraction has has 216 places, 185 transitions, 1275 flow [2021-12-17 22:21:02,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.28571428571429) internal successors, (765), 7 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:21:02,805 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:21:02,805 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:21:02,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-17 22:21:02,805 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:21:02,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:21:02,806 INFO L85 PathProgramCache]: Analyzing trace with hash 173612647, now seen corresponding path program 1 times [2021-12-17 22:21:02,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:21:02,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622770479] [2021-12-17 22:21:02,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:21:02,806 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:21:02,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:21:02,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:21:02,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:21:02,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622770479] [2021-12-17 22:21:02,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622770479] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:21:02,899 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:21:02,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 22:21:02,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531677586] [2021-12-17 22:21:02,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:21:02,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 22:21:02,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:21:02,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 22:21:02,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 22:21:02,902 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 132 [2021-12-17 22:21:02,903 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 185 transitions, 1275 flow. Second operand has 7 states, 7 states have (on average 111.42857142857143) internal successors, (780), 7 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:21:02,903 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:21:02,903 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 132 [2021-12-17 22:21:02,904 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:21:04,711 INFO L129 PetriNetUnfolder]: 3012/10173 cut-off events. [2021-12-17 22:21:04,711 INFO L130 PetriNetUnfolder]: For 54566/64324 co-relation queries the response was YES. [2021-12-17 22:21:04,791 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42025 conditions, 10173 events. 3012/10173 cut-off events. For 54566/64324 co-relation queries the response was YES. Maximal size of possible extension queue 1310. Compared 130963 event pairs, 253 based on Foata normal form. 216/9554 useless extension candidates. Maximal degree in co-relation 41908. Up to 3173 conditions per place. [2021-12-17 22:21:04,944 INFO L132 encePairwiseOnDemand]: 126/132 looper letters, 81 selfloop transitions, 5 changer transitions 14/242 dead transitions. [2021-12-17 22:21:04,944 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 242 transitions, 2224 flow [2021-12-17 22:21:04,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 22:21:04,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-17 22:21:04,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 805 transitions. [2021-12-17 22:21:04,946 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8712121212121212 [2021-12-17 22:21:04,946 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 805 transitions. [2021-12-17 22:21:04,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 805 transitions. [2021-12-17 22:21:04,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:21:04,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 805 transitions. [2021-12-17 22:21:04,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:21:04,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 132.0) internal successors, (1056), 8 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:21:04,950 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 132.0) internal successors, (1056), 8 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:21:04,950 INFO L186 Difference]: Start difference. First operand has 216 places, 185 transitions, 1275 flow. Second operand 7 states and 805 transitions. [2021-12-17 22:21:04,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 242 transitions, 2224 flow [2021-12-17 22:21:05,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 242 transitions, 2041 flow, removed 82 selfloop flow, removed 12 redundant places. [2021-12-17 22:21:05,637 INFO L242 Difference]: Finished difference. Result has 209 places, 183 transitions, 1143 flow [2021-12-17 22:21:05,637 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=1148, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1143, PETRI_PLACES=209, PETRI_TRANSITIONS=183} [2021-12-17 22:21:05,637 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 70 predicate places. [2021-12-17 22:21:05,638 INFO L470 AbstractCegarLoop]: Abstraction has has 209 places, 183 transitions, 1143 flow [2021-12-17 22:21:05,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.42857142857143) internal successors, (780), 7 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:21:05,638 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:21:05,638 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:21:05,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-17 22:21:05,639 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:21:05,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:21:05,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1382102007, now seen corresponding path program 2 times [2021-12-17 22:21:05,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:21:05,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406369388] [2021-12-17 22:21:05,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:21:05,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:21:05,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:21:05,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:21:05,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:21:05,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406369388] [2021-12-17 22:21:05,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406369388] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:21:05,719 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:21:05,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 22:21:05,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199498910] [2021-12-17 22:21:05,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:21:05,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 22:21:05,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:21:05,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 22:21:05,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 22:21:05,721 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 132 [2021-12-17 22:21:05,722 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 183 transitions, 1143 flow. Second operand has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:21:05,722 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:21:05,722 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 132 [2021-12-17 22:21:05,722 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:21:08,603 INFO L129 PetriNetUnfolder]: 5365/18130 cut-off events. [2021-12-17 22:21:08,603 INFO L130 PetriNetUnfolder]: For 73568/78674 co-relation queries the response was YES. [2021-12-17 22:21:08,769 INFO L84 FinitePrefix]: Finished finitePrefix Result has 64764 conditions, 18130 events. 5365/18130 cut-off events. For 73568/78674 co-relation queries the response was YES. Maximal size of possible extension queue 2187. Compared 254312 event pairs, 470 based on Foata normal form. 354/17049 useless extension candidates. Maximal degree in co-relation 64652. Up to 4034 conditions per place. [2021-12-17 22:21:08,818 INFO L132 encePairwiseOnDemand]: 126/132 looper letters, 75 selfloop transitions, 16 changer transitions 9/242 dead transitions. [2021-12-17 22:21:08,819 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 242 transitions, 2054 flow [2021-12-17 22:21:08,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 22:21:08,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-17 22:21:08,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1037 transitions. [2021-12-17 22:21:08,820 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.872895622895623 [2021-12-17 22:21:08,820 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1037 transitions. [2021-12-17 22:21:08,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1037 transitions. [2021-12-17 22:21:08,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:21:08,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1037 transitions. [2021-12-17 22:21:08,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 115.22222222222223) internal successors, (1037), 9 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:21:08,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 132.0) internal successors, (1320), 10 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:21:08,823 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 132.0) internal successors, (1320), 10 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:21:08,823 INFO L186 Difference]: Start difference. First operand has 209 places, 183 transitions, 1143 flow. Second operand 9 states and 1037 transitions. [2021-12-17 22:21:08,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 242 transitions, 2054 flow [2021-12-17 22:21:09,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 242 transitions, 2014 flow, removed 6 selfloop flow, removed 5 redundant places. [2021-12-17 22:21:09,781 INFO L242 Difference]: Finished difference. Result has 219 places, 196 transitions, 1368 flow [2021-12-17 22:21:09,781 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=1123, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1368, PETRI_PLACES=219, PETRI_TRANSITIONS=196} [2021-12-17 22:21:09,781 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 80 predicate places. [2021-12-17 22:21:09,781 INFO L470 AbstractCegarLoop]: Abstraction has has 219 places, 196 transitions, 1368 flow [2021-12-17 22:21:09,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:21:09,782 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:21:09,782 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:21:09,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-17 22:21:09,782 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:21:09,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:21:09,783 INFO L85 PathProgramCache]: Analyzing trace with hash -227012787, now seen corresponding path program 1 times [2021-12-17 22:21:09,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:21:09,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854698308] [2021-12-17 22:21:09,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:21:09,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:21:09,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:21:09,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:21:09,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:21:09,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854698308] [2021-12-17 22:21:09,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854698308] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:21:09,886 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:21:09,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 22:21:09,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866877843] [2021-12-17 22:21:09,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:21:09,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 22:21:09,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:21:09,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 22:21:09,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-17 22:21:09,889 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 132 [2021-12-17 22:21:09,890 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 196 transitions, 1368 flow. Second operand has 8 states, 8 states have (on average 109.125) internal successors, (873), 8 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:21:09,890 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:21:09,890 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 132 [2021-12-17 22:21:09,890 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:21:16,644 INFO L129 PetriNetUnfolder]: 20513/38988 cut-off events. [2021-12-17 22:21:16,644 INFO L130 PetriNetUnfolder]: For 291637/300885 co-relation queries the response was YES. [2021-12-17 22:21:17,464 INFO L84 FinitePrefix]: Finished finitePrefix Result has 203756 conditions, 38988 events. 20513/38988 cut-off events. For 291637/300885 co-relation queries the response was YES. Maximal size of possible extension queue 3687. Compared 428232 event pairs, 224 based on Foata normal form. 4155/40885 useless extension candidates. Maximal degree in co-relation 203639. Up to 9789 conditions per place. [2021-12-17 22:21:17,503 INFO L132 encePairwiseOnDemand]: 121/132 looper letters, 76 selfloop transitions, 27 changer transitions 193/397 dead transitions. [2021-12-17 22:21:17,503 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 397 transitions, 4489 flow [2021-12-17 22:21:17,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-17 22:21:17,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-17 22:21:17,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1851 transitions. [2021-12-17 22:21:17,507 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8764204545454546 [2021-12-17 22:21:17,507 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1851 transitions. [2021-12-17 22:21:17,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1851 transitions. [2021-12-17 22:21:17,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:21:17,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1851 transitions. [2021-12-17 22:21:17,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 115.6875) internal successors, (1851), 16 states have internal predecessors, (1851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:21:17,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 132.0) internal successors, (2244), 17 states have internal predecessors, (2244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:21:17,515 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 132.0) internal successors, (2244), 17 states have internal predecessors, (2244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:21:17,516 INFO L186 Difference]: Start difference. First operand has 219 places, 196 transitions, 1368 flow. Second operand 16 states and 1851 transitions. [2021-12-17 22:21:17,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 397 transitions, 4489 flow [2021-12-17 22:21:20,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 397 transitions, 4300 flow, removed 55 selfloop flow, removed 3 redundant places. [2021-12-17 22:21:20,761 INFO L242 Difference]: Finished difference. Result has 238 places, 163 transitions, 1061 flow [2021-12-17 22:21:20,762 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=1211, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1061, PETRI_PLACES=238, PETRI_TRANSITIONS=163} [2021-12-17 22:21:20,763 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 99 predicate places. [2021-12-17 22:21:20,763 INFO L470 AbstractCegarLoop]: Abstraction has has 238 places, 163 transitions, 1061 flow [2021-12-17 22:21:20,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 109.125) internal successors, (873), 8 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:21:20,763 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:21:20,764 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:21:20,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-17 22:21:20,764 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:21:20,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:21:20,765 INFO L85 PathProgramCache]: Analyzing trace with hash 2089238912, now seen corresponding path program 1 times [2021-12-17 22:21:20,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:21:20,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437286359] [2021-12-17 22:21:20,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:21:20,765 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:21:20,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:21:20,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:21:20,874 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:21:20,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437286359] [2021-12-17 22:21:20,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437286359] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:21:20,875 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:21:20,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-17 22:21:20,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223646586] [2021-12-17 22:21:20,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:21:20,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 22:21:20,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:21:20,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 22:21:20,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-17 22:21:20,877 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 132 [2021-12-17 22:21:20,878 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 163 transitions, 1061 flow. Second operand has 9 states, 9 states have (on average 109.11111111111111) internal successors, (982), 9 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:21:20,878 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:21:20,878 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 132 [2021-12-17 22:21:20,878 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:21:24,250 INFO L129 PetriNetUnfolder]: 8836/20278 cut-off events. [2021-12-17 22:21:24,250 INFO L130 PetriNetUnfolder]: For 167903/172384 co-relation queries the response was YES. [2021-12-17 22:21:24,544 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109913 conditions, 20278 events. 8836/20278 cut-off events. For 167903/172384 co-relation queries the response was YES. Maximal size of possible extension queue 2225. Compared 243064 event pairs, 81 based on Foata normal form. 1516/20504 useless extension candidates. Maximal degree in co-relation 109851. Up to 3922 conditions per place. [2021-12-17 22:21:24,564 INFO L132 encePairwiseOnDemand]: 122/132 looper letters, 25 selfloop transitions, 19 changer transitions 162/295 dead transitions. [2021-12-17 22:21:24,564 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 295 transitions, 3113 flow [2021-12-17 22:21:24,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-17 22:21:24,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-17 22:21:24,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1811 transitions. [2021-12-17 22:21:24,567 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8574810606060606 [2021-12-17 22:21:24,567 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1811 transitions. [2021-12-17 22:21:24,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1811 transitions. [2021-12-17 22:21:24,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:21:24,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1811 transitions. [2021-12-17 22:21:24,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 113.1875) internal successors, (1811), 16 states have internal predecessors, (1811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:21:24,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 132.0) internal successors, (2244), 17 states have internal predecessors, (2244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:21:24,573 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 132.0) internal successors, (2244), 17 states have internal predecessors, (2244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:21:24,573 INFO L186 Difference]: Start difference. First operand has 238 places, 163 transitions, 1061 flow. Second operand 16 states and 1811 transitions. [2021-12-17 22:21:24,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 295 transitions, 3113 flow [2021-12-17 22:21:26,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 295 transitions, 2644 flow, removed 139 selfloop flow, removed 33 redundant places. [2021-12-17 22:21:26,931 INFO L242 Difference]: Finished difference. Result has 208 places, 123 transitions, 587 flow [2021-12-17 22:21:26,931 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=587, PETRI_PLACES=208, PETRI_TRANSITIONS=123} [2021-12-17 22:21:26,932 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 69 predicate places. [2021-12-17 22:21:26,932 INFO L470 AbstractCegarLoop]: Abstraction has has 208 places, 123 transitions, 587 flow [2021-12-17 22:21:26,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 109.11111111111111) internal successors, (982), 9 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:21:26,932 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:21:26,933 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:21:26,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-17 22:21:26,933 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:21:26,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:21:26,933 INFO L85 PathProgramCache]: Analyzing trace with hash 566575866, now seen corresponding path program 1 times [2021-12-17 22:21:26,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:21:26,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935788013] [2021-12-17 22:21:26,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:21:26,934 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:21:26,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 22:21:26,970 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-17 22:21:27,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 22:21:27,047 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-17 22:21:27,047 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-17 22:21:27,048 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2021-12-17 22:21:27,050 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2021-12-17 22:21:27,050 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2021-12-17 22:21:27,050 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2021-12-17 22:21:27,050 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2021-12-17 22:21:27,051 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2021-12-17 22:21:27,051 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2021-12-17 22:21:27,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-17 22:21:27,054 INFO L732 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:21:27,059 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-17 22:21:27,059 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 22:21:27,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 10:21:27 BasicIcfg [2021-12-17 22:21:27,208 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 22:21:27,209 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 22:21:27,209 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 22:21:27,209 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 22:21:27,210 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:20:45" (3/4) ... [2021-12-17 22:21:27,211 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-17 22:21:27,326 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-17 22:21:27,326 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 22:21:27,327 INFO L158 Benchmark]: Toolchain (without parser) took 43134.75ms. Allocated memory was 92.3MB in the beginning and 10.8GB in the end (delta: 10.7GB). Free memory was 63.4MB in the beginning and 8.6GB in the end (delta: -8.5GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2021-12-17 22:21:27,327 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 92.3MB. Free memory is still 51.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 22:21:27,328 INFO L158 Benchmark]: CACSL2BoogieTranslator took 508.33ms. Allocated memory was 92.3MB in the beginning and 121.6MB in the end (delta: 29.4MB). Free memory was 63.4MB in the beginning and 85.4MB in the end (delta: -22.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 22:21:27,328 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.49ms. Allocated memory is still 121.6MB. Free memory was 85.4MB in the beginning and 82.1MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-17 22:21:27,328 INFO L158 Benchmark]: Boogie Preprocessor took 40.27ms. Allocated memory is still 121.6MB. Free memory was 82.1MB in the beginning and 80.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 22:21:27,329 INFO L158 Benchmark]: RCFGBuilder took 851.28ms. Allocated memory is still 121.6MB. Free memory was 80.0MB in the beginning and 86.9MB in the end (delta: -6.9MB). Peak memory consumption was 31.9MB. Max. memory is 16.1GB. [2021-12-17 22:21:27,329 INFO L158 Benchmark]: TraceAbstraction took 41553.44ms. Allocated memory was 121.6MB in the beginning and 10.8GB in the end (delta: 10.7GB). Free memory was 86.2MB in the beginning and 8.6GB in the end (delta: -8.6GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2021-12-17 22:21:27,329 INFO L158 Benchmark]: Witness Printer took 117.54ms. Allocated memory is still 10.8GB. Free memory was 8.6GB in the beginning and 8.6GB in the end (delta: 36.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2021-12-17 22:21:27,332 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.22ms. Allocated memory is still 92.3MB. Free memory is still 51.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 508.33ms. Allocated memory was 92.3MB in the beginning and 121.6MB in the end (delta: 29.4MB). Free memory was 63.4MB in the beginning and 85.4MB in the end (delta: -22.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.49ms. Allocated memory is still 121.6MB. Free memory was 85.4MB in the beginning and 82.1MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.27ms. Allocated memory is still 121.6MB. Free memory was 82.1MB in the beginning and 80.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 851.28ms. Allocated memory is still 121.6MB. Free memory was 80.0MB in the beginning and 86.9MB in the end (delta: -6.9MB). Peak memory consumption was 31.9MB. Max. memory is 16.1GB. * TraceAbstraction took 41553.44ms. Allocated memory was 121.6MB in the beginning and 10.8GB in the end (delta: 10.7GB). Free memory was 86.2MB in the beginning and 8.6GB in the end (delta: -8.6GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. * Witness Printer took 117.54ms. Allocated memory is still 10.8GB. Free memory was 8.6GB in the beginning and 8.6GB in the end (delta: 36.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * 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: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0] [L714] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0] [L715] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0] [L716] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L718] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L720] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L722] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L723] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L724] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L725] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L726] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L727] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L728] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L729] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0] [L730] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0] [L731] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L732] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L733] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L734] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L735] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L736] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L737] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L738] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L739] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L740] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L742] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] 0 pthread_t t1517; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1517={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1517, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1517, ((void *)0), P0, ((void *)0))=-3, t1517={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 pthread_t t1518; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1517={5:0}, t1518={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1518, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1518, ((void *)0), P1, ((void *)0))=-2, t1517={5:0}, t1518={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1519; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1517={5:0}, t1518={6:0}, t1519={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t1519, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1519, ((void *)0), P2, ((void *)0))=-1, t1517={5:0}, t1518={6:0}, t1519={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1520; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1517={5:0}, t1518={6:0}, t1519={7:0}, t1520={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] FCALL, FORK 0 pthread_create(&t1520, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1520, ((void *)0), P3, ((void *)0))=0, t1517={5:0}, t1518={6:0}, t1519={7:0}, t1520={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 2 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L800] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L800] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, 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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, 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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, 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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, 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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L761] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, 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=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, 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=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, 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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, 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, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L782] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L782] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L782] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L783] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L786] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L815] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L816] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, 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, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, 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, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p3_EAX=0, a=1, 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, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1517={5:0}, t1518={6:0}, t1519={7:0}, t1520={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] RET 0 assume_abort_if_not(main$tmp_guard0) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z [L858] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L863] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L866] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L866] 0 z = z$flush_delayed ? z$mem_tmp : z [L867] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1517={5:0}, t1518={6:0}, t1519={7:0}, t1520={3:0}, weak$$choice0=53, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L869] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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=53, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$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: 841]: 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: 839]: 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: 835]: 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: 837]: 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 9 procedures, 166 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 41.3s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 37.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1055 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1055 mSDsluCounter, 961 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1573 mSDsCounter, 358 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2637 IncrementalHoareTripleChecker+Invalid, 2995 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 358 mSolverCounterUnsat, 186 mSDtfsCounter, 2637 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 305 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1368occurred in iteration=18, InterpolantAutomatonStates: 241, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1887 NumberOfCodeBlocks, 1887 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1766 ConstructedInterpolants, 0 QuantifiedInterpolants, 8899 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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! [2021-12-17 22:21:27,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE