./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_464e63f8-428e-47c5-857f-d4e334f41837/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_464e63f8-428e-47c5-857f-d4e334f41837/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_464e63f8-428e-47c5-857f-d4e334f41837/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_464e63f8-428e-47c5-857f-d4e334f41837/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_464e63f8-428e-47c5-857f-d4e334f41837/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_464e63f8-428e-47c5-857f-d4e334f41837/bin/uautomizer-DrprNOufMa --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 a843579fcb7bb5d5833d499f834986a668bfbdfa4c59a86e5d344f532fcebd9f --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 23:34:01,943 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 23:34:01,945 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 23:34:01,966 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 23:34:01,967 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 23:34:01,968 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 23:34:01,969 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 23:34:01,971 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 23:34:01,972 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 23:34:01,973 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 23:34:01,974 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 23:34:01,975 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 23:34:01,975 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 23:34:01,976 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 23:34:01,977 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 23:34:01,978 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 23:34:01,979 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 23:34:01,980 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 23:34:01,981 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 23:34:01,983 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 23:34:01,984 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 23:34:01,986 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 23:34:01,987 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 23:34:01,987 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 23:34:01,990 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 23:34:01,990 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 23:34:01,990 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 23:34:01,991 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 23:34:01,992 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 23:34:01,992 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 23:34:01,993 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 23:34:01,993 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 23:34:01,994 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 23:34:01,994 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 23:34:01,995 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 23:34:01,995 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 23:34:01,996 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 23:34:01,996 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 23:34:01,996 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 23:34:01,997 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 23:34:01,997 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 23:34:01,998 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_464e63f8-428e-47c5-857f-d4e334f41837/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 23:34:02,019 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 23:34:02,019 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 23:34:02,020 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 23:34:02,020 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 23:34:02,020 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 23:34:02,020 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 23:34:02,021 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 23:34:02,021 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 23:34:02,021 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 23:34:02,021 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 23:34:02,021 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 23:34:02,022 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 23:34:02,022 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 23:34:02,022 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 23:34:02,022 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 23:34:02,022 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 23:34:02,022 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 23:34:02,023 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 23:34:02,023 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 23:34:02,023 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 23:34:02,023 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 23:34:02,023 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 23:34:02,023 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 23:34:02,023 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 23:34:02,023 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 23:34:02,023 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 23:34:02,024 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 23:34:02,024 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 23:34:02,024 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 23:34:02,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 23:34:02,024 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 23:34:02,024 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 23:34:02,024 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 23:34:02,025 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 23:34:02,025 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_464e63f8-428e-47c5-857f-d4e334f41837/bin/uautomizer-DrprNOufMa/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_464e63f8-428e-47c5-857f-d4e334f41837/bin/uautomizer-DrprNOufMa 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 -> a843579fcb7bb5d5833d499f834986a668bfbdfa4c59a86e5d344f532fcebd9f [2021-12-06 23:34:02,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 23:34:02,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 23:34:02,248 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 23:34:02,249 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 23:34:02,249 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 23:34:02,250 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_464e63f8-428e-47c5-857f-d4e334f41837/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2021-12-06 23:34:02,291 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_464e63f8-428e-47c5-857f-d4e334f41837/bin/uautomizer-DrprNOufMa/data/50c6931cb/fea237a36a95411bb524425220b2dd13/FLAG0273d7a87 [2021-12-06 23:34:02,715 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 23:34:02,715 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_464e63f8-428e-47c5-857f-d4e334f41837/sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2021-12-06 23:34:02,727 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_464e63f8-428e-47c5-857f-d4e334f41837/bin/uautomizer-DrprNOufMa/data/50c6931cb/fea237a36a95411bb524425220b2dd13/FLAG0273d7a87 [2021-12-06 23:34:02,736 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_464e63f8-428e-47c5-857f-d4e334f41837/bin/uautomizer-DrprNOufMa/data/50c6931cb/fea237a36a95411bb524425220b2dd13 [2021-12-06 23:34:02,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 23:34:02,739 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 23:34:02,740 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 23:34:02,740 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 23:34:02,742 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 23:34:02,743 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 11:34:02" (1/1) ... [2021-12-06 23:34:02,744 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@253aa8a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:34:02, skipping insertion in model container [2021-12-06 23:34:02,744 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 11:34:02" (1/1) ... [2021-12-06 23:34:02,749 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 23:34:02,786 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 23:34:02,921 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_464e63f8-428e-47c5-857f-d4e334f41837/sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i[976,989] [2021-12-06 23:34:03,059 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 23:34:03,067 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 23:34:03,076 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_464e63f8-428e-47c5-857f-d4e334f41837/sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i[976,989] [2021-12-06 23:34:03,127 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 23:34:03,156 INFO L208 MainTranslator]: Completed translation [2021-12-06 23:34:03,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:34:03 WrapperNode [2021-12-06 23:34:03,157 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 23:34:03,158 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 23:34:03,158 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 23:34:03,158 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 23:34:03,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:34:03" (1/1) ... [2021-12-06 23:34:03,180 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:34:03" (1/1) ... [2021-12-06 23:34:03,206 INFO L137 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 274 [2021-12-06 23:34:03,206 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 23:34:03,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 23:34:03,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 23:34:03,207 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 23:34:03,212 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:34:03" (1/1) ... [2021-12-06 23:34:03,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:34:03" (1/1) ... [2021-12-06 23:34:03,216 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:34:03" (1/1) ... [2021-12-06 23:34:03,216 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:34:03" (1/1) ... [2021-12-06 23:34:03,224 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:34:03" (1/1) ... [2021-12-06 23:34:03,226 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:34:03" (1/1) ... [2021-12-06 23:34:03,229 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:34:03" (1/1) ... [2021-12-06 23:34:03,232 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 23:34:03,233 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 23:34:03,233 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 23:34:03,233 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 23:34:03,234 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:34:03" (1/1) ... [2021-12-06 23:34:03,239 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 23:34:03,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_464e63f8-428e-47c5-857f-d4e334f41837/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:34:03,260 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_464e63f8-428e-47c5-857f-d4e334f41837/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 23:34:03,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_464e63f8-428e-47c5-857f-d4e334f41837/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 23:34:03,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-06 23:34:03,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-06 23:34:03,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 23:34:03,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-06 23:34:03,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-06 23:34:03,299 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-12-06 23:34:03,299 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-12-06 23:34:03,299 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-12-06 23:34:03,299 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-12-06 23:34:03,299 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-12-06 23:34:03,299 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-12-06 23:34:03,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 23:34:03,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-06 23:34:03,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 23:34:03,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 23:34:03,301 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-06 23:34:03,394 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 23:34:03,395 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 23:34:03,754 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 23:34:03,937 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 23:34:03,937 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-06 23:34:03,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 11:34:03 BoogieIcfgContainer [2021-12-06 23:34:03,939 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 23:34:03,940 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 23:34:03,940 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 23:34:03,942 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 23:34:03,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 11:34:02" (1/3) ... [2021-12-06 23:34:03,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@483c4d51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 11:34:03, skipping insertion in model container [2021-12-06 23:34:03,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:34:03" (2/3) ... [2021-12-06 23:34:03,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@483c4d51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 11:34:03, skipping insertion in model container [2021-12-06 23:34:03,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 11:34:03" (3/3) ... [2021-12-06 23:34:03,944 INFO L111 eAbstractionObserver]: Analyzing ICFG safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2021-12-06 23:34:03,948 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-06 23:34:03,948 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 23:34:03,949 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-06 23:34:03,949 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-06 23:34:03,977 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,977 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,977 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,977 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,977 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,977 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,977 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,977 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,978 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,978 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,978 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,978 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,978 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,978 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,978 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,979 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,979 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,979 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,979 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,979 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,979 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,979 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,979 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,980 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,980 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,980 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,980 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,980 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,980 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,980 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,980 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,981 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,981 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,981 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,981 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,981 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,981 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,981 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,981 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,981 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,981 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,982 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,982 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,982 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,982 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,982 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,982 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,982 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,982 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,982 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,983 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,983 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,983 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,983 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,983 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,983 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,983 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,983 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,984 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,984 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,984 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,984 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,984 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,984 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,984 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,984 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,984 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,985 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,985 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,985 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,985 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,985 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,985 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,985 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,985 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,986 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,986 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,986 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,986 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,986 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,986 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,986 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,987 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,987 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,987 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,987 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,989 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,989 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,989 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,990 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,990 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,990 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,990 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,990 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,990 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,990 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,991 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,991 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,991 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,991 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,991 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,991 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,991 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,992 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,992 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,992 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,992 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,992 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,992 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,992 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,993 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,993 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,993 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,993 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,993 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,993 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,993 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,993 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:34:03,994 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-06 23:34:04,026 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 23:34:04,031 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-06 23:34:04,031 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-12-06 23:34:04,039 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2021-12-06 23:34:04,078 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2021-12-06 23:34:04,079 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-06 23:34:04,081 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2021-12-06 23:34:04,081 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2021-12-06 23:34:04,085 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2021-12-06 23:34:04,095 INFO L129 PetriNetUnfolder]: 0/60 cut-off events. [2021-12-06 23:34:04,095 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-06 23:34:04,095 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:34:04,096 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] [2021-12-06 23:34:04,096 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 23:34:04,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:34:04,100 INFO L85 PathProgramCache]: Analyzing trace with hash -388777824, now seen corresponding path program 1 times [2021-12-06 23:34:04,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:34:04,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756566285] [2021-12-06 23:34:04,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:34:04,107 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:34:04,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:34:04,320 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-06 23:34:04,320 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:34:04,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756566285] [2021-12-06 23:34:04,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756566285] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:34:04,321 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:34:04,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 23:34:04,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518681855] [2021-12-06 23:34:04,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:34:04,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 23:34:04,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:34:04,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 23:34:04,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 23:34:04,351 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 114 [2021-12-06 23:34:04,354 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 111 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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-06 23:34:04,354 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:34:04,354 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 114 [2021-12-06 23:34:04,355 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:34:04,477 INFO L129 PetriNetUnfolder]: 57/323 cut-off events. [2021-12-06 23:34:04,477 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-12-06 23:34:04,480 INFO L84 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 323 events. 57/323 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1318 event pairs, 11 based on Foata normal form. 12/318 useless extension candidates. Maximal degree in co-relation 397. Up to 75 conditions per place. [2021-12-06 23:34:04,483 INFO L132 encePairwiseOnDemand]: 109/114 looper letters, 13 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2021-12-06 23:34:04,483 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 112 transitions, 266 flow [2021-12-06 23:34:04,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 23:34:04,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-06 23:34:04,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 320 transitions. [2021-12-06 23:34:04,494 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.935672514619883 [2021-12-06 23:34:04,495 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 320 transitions. [2021-12-06 23:34:04,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 320 transitions. [2021-12-06 23:34:04,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:34:04,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 320 transitions. [2021-12-06 23:34:04,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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-06 23:34:04,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 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-06 23:34:04,510 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 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-06 23:34:04,512 INFO L186 Difference]: Start difference. First operand has 119 places, 111 transitions, 231 flow. Second operand 3 states and 320 transitions. [2021-12-06 23:34:04,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 112 transitions, 266 flow [2021-12-06 23:34:04,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 112 transitions, 262 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-12-06 23:34:04,521 INFO L242 Difference]: Finished difference. Result has 116 places, 107 transitions, 224 flow [2021-12-06 23:34:04,523 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=116, PETRI_TRANSITIONS=107} [2021-12-06 23:34:04,527 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, -3 predicate places. [2021-12-06 23:34:04,527 INFO L470 AbstractCegarLoop]: Abstraction has has 116 places, 107 transitions, 224 flow [2021-12-06 23:34:04,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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-06 23:34:04,528 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:34:04,528 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] [2021-12-06 23:34:04,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 23:34:04,529 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 23:34:04,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:34:04,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1563106335, now seen corresponding path program 1 times [2021-12-06 23:34:04,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:34:04,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554994881] [2021-12-06 23:34:04,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:34:04,530 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:34:04,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:34:04,733 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-06 23:34:04,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:34:04,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554994881] [2021-12-06 23:34:04,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554994881] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:34:04,734 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:34:04,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 23:34:04,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941856938] [2021-12-06 23:34:04,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:34:04,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 23:34:04,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:34:04,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 23:34:04,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 23:34:04,738 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 114 [2021-12-06 23:34:04,739 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 107 transitions, 224 flow. Second operand has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:34:04,739 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:34:04,739 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 114 [2021-12-06 23:34:04,739 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:34:05,101 INFO L129 PetriNetUnfolder]: 336/1090 cut-off events. [2021-12-06 23:34:05,101 INFO L130 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2021-12-06 23:34:05,105 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1737 conditions, 1090 events. 336/1090 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7378 event pairs, 47 based on Foata normal form. 0/1056 useless extension candidates. Maximal degree in co-relation 1686. Up to 277 conditions per place. [2021-12-06 23:34:05,108 INFO L132 encePairwiseOnDemand]: 108/114 looper letters, 20 selfloop transitions, 2 changer transitions 45/146 dead transitions. [2021-12-06 23:34:05,109 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 146 transitions, 432 flow [2021-12-06 23:34:05,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 23:34:05,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-06 23:34:05,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 895 transitions. [2021-12-06 23:34:05,115 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8723196881091618 [2021-12-06 23:34:05,115 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 895 transitions. [2021-12-06 23:34:05,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 895 transitions. [2021-12-06 23:34:05,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:34:05,116 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 895 transitions. [2021-12-06 23:34:05,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 99.44444444444444) internal successors, (895), 9 states have internal predecessors, (895), 0 states have call successors, (0), 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-06 23:34:05,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 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-06 23:34:05,124 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 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-06 23:34:05,124 INFO L186 Difference]: Start difference. First operand has 116 places, 107 transitions, 224 flow. Second operand 9 states and 895 transitions. [2021-12-06 23:34:05,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 146 transitions, 432 flow [2021-12-06 23:34:05,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 146 transitions, 414 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-06 23:34:05,128 INFO L242 Difference]: Finished difference. Result has 129 places, 95 transitions, 216 flow [2021-12-06 23:34:05,128 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=216, PETRI_PLACES=129, PETRI_TRANSITIONS=95} [2021-12-06 23:34:05,129 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 10 predicate places. [2021-12-06 23:34:05,129 INFO L470 AbstractCegarLoop]: Abstraction has has 129 places, 95 transitions, 216 flow [2021-12-06 23:34:05,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:34:05,129 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:34:05,130 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] [2021-12-06 23:34:05,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 23:34:05,130 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 23:34:05,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:34:05,130 INFO L85 PathProgramCache]: Analyzing trace with hash -153763700, now seen corresponding path program 1 times [2021-12-06 23:34:05,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:34:05,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004329908] [2021-12-06 23:34:05,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:34:05,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:34:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:34:05,252 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-06 23:34:05,253 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:34:05,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004329908] [2021-12-06 23:34:05,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004329908] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:34:05,253 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:34:05,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 23:34:05,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701458036] [2021-12-06 23:34:05,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:34:05,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 23:34:05,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:34:05,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 23:34:05,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 23:34:05,255 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2021-12-06 23:34:05,256 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 95 transitions, 216 flow. Second operand has 6 states, 6 states have (on average 92.0) internal successors, (552), 6 states have internal predecessors, (552), 0 states have call successors, (0), 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-06 23:34:05,256 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:34:05,256 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2021-12-06 23:34:05,256 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:34:05,633 INFO L129 PetriNetUnfolder]: 632/1424 cut-off events. [2021-12-06 23:34:05,633 INFO L130 PetriNetUnfolder]: For 438/438 co-relation queries the response was YES. [2021-12-06 23:34:05,637 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2838 conditions, 1424 events. 632/1424 cut-off events. For 438/438 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8608 event pairs, 222 based on Foata normal form. 32/1398 useless extension candidates. Maximal degree in co-relation 2780. Up to 562 conditions per place. [2021-12-06 23:34:05,644 INFO L132 encePairwiseOnDemand]: 107/114 looper letters, 24 selfloop transitions, 3 changer transitions 43/146 dead transitions. [2021-12-06 23:34:05,644 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 146 transitions, 481 flow [2021-12-06 23:34:05,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 23:34:05,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-06 23:34:05,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 882 transitions. [2021-12-06 23:34:05,647 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8596491228070176 [2021-12-06 23:34:05,647 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 882 transitions. [2021-12-06 23:34:05,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 882 transitions. [2021-12-06 23:34:05,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:34:05,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 882 transitions. [2021-12-06 23:34:05,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.0) internal successors, (882), 9 states have internal predecessors, (882), 0 states have call successors, (0), 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-06 23:34:05,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 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-06 23:34:05,654 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 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-06 23:34:05,654 INFO L186 Difference]: Start difference. First operand has 129 places, 95 transitions, 216 flow. Second operand 9 states and 882 transitions. [2021-12-06 23:34:05,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 146 transitions, 481 flow [2021-12-06 23:34:05,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 146 transitions, 447 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-12-06 23:34:05,672 INFO L242 Difference]: Finished difference. Result has 118 places, 97 transitions, 243 flow [2021-12-06 23:34:05,673 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=243, PETRI_PLACES=118, PETRI_TRANSITIONS=97} [2021-12-06 23:34:05,674 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, -1 predicate places. [2021-12-06 23:34:05,674 INFO L470 AbstractCegarLoop]: Abstraction has has 118 places, 97 transitions, 243 flow [2021-12-06 23:34:05,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.0) internal successors, (552), 6 states have internal predecessors, (552), 0 states have call successors, (0), 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-06 23:34:05,674 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:34:05,675 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] [2021-12-06 23:34:05,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 23:34:05,675 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 23:34:05,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:34:05,676 INFO L85 PathProgramCache]: Analyzing trace with hash 38721015, now seen corresponding path program 1 times [2021-12-06 23:34:05,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:34:05,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035412729] [2021-12-06 23:34:05,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:34:05,677 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:34:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:34:05,810 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-06 23:34:05,810 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:34:05,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035412729] [2021-12-06 23:34:05,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035412729] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:34:05,810 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:34:05,811 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 23:34:05,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837062309] [2021-12-06 23:34:05,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:34:05,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 23:34:05,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:34:05,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 23:34:05,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 23:34:05,813 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2021-12-06 23:34:05,814 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 97 transitions, 243 flow. Second operand has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 0 states have call successors, (0), 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-06 23:34:05,814 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:34:05,815 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2021-12-06 23:34:05,815 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:34:06,168 INFO L129 PetriNetUnfolder]: 644/1404 cut-off events. [2021-12-06 23:34:06,168 INFO L130 PetriNetUnfolder]: For 1172/1172 co-relation queries the response was YES. [2021-12-06 23:34:06,172 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3357 conditions, 1404 events. 644/1404 cut-off events. For 1172/1172 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8545 event pairs, 202 based on Foata normal form. 24/1355 useless extension candidates. Maximal degree in co-relation 3297. Up to 487 conditions per place. [2021-12-06 23:34:06,177 INFO L132 encePairwiseOnDemand]: 105/114 looper letters, 29 selfloop transitions, 5 changer transitions 28/137 dead transitions. [2021-12-06 23:34:06,177 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 137 transitions, 528 flow [2021-12-06 23:34:06,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 23:34:06,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-06 23:34:06,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 686 transitions. [2021-12-06 23:34:06,179 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8596491228070176 [2021-12-06 23:34:06,179 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 686 transitions. [2021-12-06 23:34:06,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 686 transitions. [2021-12-06 23:34:06,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:34:06,180 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 686 transitions. [2021-12-06 23:34:06,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 98.0) internal successors, (686), 7 states have internal predecessors, (686), 0 states have call successors, (0), 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-06 23:34:06,184 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 114.0) internal successors, (912), 8 states have internal predecessors, (912), 0 states have call successors, (0), 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-06 23:34:06,184 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 114.0) internal successors, (912), 8 states have internal predecessors, (912), 0 states have call successors, (0), 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-06 23:34:06,184 INFO L186 Difference]: Start difference. First operand has 118 places, 97 transitions, 243 flow. Second operand 7 states and 686 transitions. [2021-12-06 23:34:06,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 137 transitions, 528 flow [2021-12-06 23:34:06,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 137 transitions, 515 flow, removed 5 selfloop flow, removed 4 redundant places. [2021-12-06 23:34:06,191 INFO L242 Difference]: Finished difference. Result has 118 places, 97 transitions, 257 flow [2021-12-06 23:34:06,192 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=257, PETRI_PLACES=118, PETRI_TRANSITIONS=97} [2021-12-06 23:34:06,192 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, -1 predicate places. [2021-12-06 23:34:06,192 INFO L470 AbstractCegarLoop]: Abstraction has has 118 places, 97 transitions, 257 flow [2021-12-06 23:34:06,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 0 states have call successors, (0), 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-06 23:34:06,193 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:34:06,193 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] [2021-12-06 23:34:06,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 23:34:06,194 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 23:34:06,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:34:06,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1899144303, now seen corresponding path program 2 times [2021-12-06 23:34:06,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:34:06,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023447450] [2021-12-06 23:34:06,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:34:06,195 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:34:06,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:34:06,314 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-06 23:34:06,314 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:34:06,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023447450] [2021-12-06 23:34:06,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023447450] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:34:06,315 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:34:06,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 23:34:06,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077869523] [2021-12-06 23:34:06,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:34:06,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 23:34:06,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:34:06,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 23:34:06,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 23:34:06,317 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2021-12-06 23:34:06,317 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 97 transitions, 257 flow. Second operand has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 0 states have call successors, (0), 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-06 23:34:06,318 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:34:06,318 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2021-12-06 23:34:06,318 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:34:06,822 INFO L129 PetriNetUnfolder]: 590/1416 cut-off events. [2021-12-06 23:34:06,822 INFO L130 PetriNetUnfolder]: For 1004/1012 co-relation queries the response was YES. [2021-12-06 23:34:06,826 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3214 conditions, 1416 events. 590/1416 cut-off events. For 1004/1012 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 9262 event pairs, 174 based on Foata normal form. 32/1393 useless extension candidates. Maximal degree in co-relation 3150. Up to 333 conditions per place. [2021-12-06 23:34:06,830 INFO L132 encePairwiseOnDemand]: 107/114 looper letters, 29 selfloop transitions, 3 changer transitions 57/164 dead transitions. [2021-12-06 23:34:06,830 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 164 transitions, 663 flow [2021-12-06 23:34:06,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 23:34:06,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-06 23:34:06,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1337 transitions. [2021-12-06 23:34:06,834 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8377192982456141 [2021-12-06 23:34:06,834 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1337 transitions. [2021-12-06 23:34:06,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1337 transitions. [2021-12-06 23:34:06,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:34:06,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1337 transitions. [2021-12-06 23:34:06,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 95.5) internal successors, (1337), 14 states have internal predecessors, (1337), 0 states have call successors, (0), 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-06 23:34:06,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 0 states have call successors, (0), 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-06 23:34:06,841 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 0 states have call successors, (0), 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-06 23:34:06,841 INFO L186 Difference]: Start difference. First operand has 118 places, 97 transitions, 257 flow. Second operand 14 states and 1337 transitions. [2021-12-06 23:34:06,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 164 transitions, 663 flow [2021-12-06 23:34:06,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 164 transitions, 609 flow, removed 21 selfloop flow, removed 6 redundant places. [2021-12-06 23:34:06,847 INFO L242 Difference]: Finished difference. Result has 134 places, 97 transitions, 272 flow [2021-12-06 23:34:06,847 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=272, PETRI_PLACES=134, PETRI_TRANSITIONS=97} [2021-12-06 23:34:06,848 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 15 predicate places. [2021-12-06 23:34:06,848 INFO L470 AbstractCegarLoop]: Abstraction has has 134 places, 97 transitions, 272 flow [2021-12-06 23:34:06,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 0 states have call successors, (0), 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-06 23:34:06,848 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:34:06,849 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] [2021-12-06 23:34:06,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-06 23:34:06,849 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 23:34:06,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:34:06,849 INFO L85 PathProgramCache]: Analyzing trace with hash 640013343, now seen corresponding path program 1 times [2021-12-06 23:34:06,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:34:06,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217229739] [2021-12-06 23:34:06,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:34:06,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:34:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:34:06,935 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-06 23:34:06,935 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:34:06,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217229739] [2021-12-06 23:34:06,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217229739] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:34:06,936 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:34:06,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 23:34:06,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641046625] [2021-12-06 23:34:06,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:34:06,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 23:34:06,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:34:06,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 23:34:06,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 23:34:06,938 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2021-12-06 23:34:06,939 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 97 transitions, 272 flow. Second operand has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 0 states have call successors, (0), 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-06 23:34:06,939 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:34:06,939 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2021-12-06 23:34:06,939 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:34:07,209 INFO L129 PetriNetUnfolder]: 356/941 cut-off events. [2021-12-06 23:34:07,209 INFO L130 PetriNetUnfolder]: For 1603/1603 co-relation queries the response was YES. [2021-12-06 23:34:07,212 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2250 conditions, 941 events. 356/941 cut-off events. For 1603/1603 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5889 event pairs, 139 based on Foata normal form. 24/909 useless extension candidates. Maximal degree in co-relation 2180. Up to 186 conditions per place. [2021-12-06 23:34:07,214 INFO L132 encePairwiseOnDemand]: 105/114 looper letters, 20 selfloop transitions, 4 changer transitions 27/126 dead transitions. [2021-12-06 23:34:07,214 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 126 transitions, 506 flow [2021-12-06 23:34:07,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 23:34:07,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-06 23:34:07,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 675 transitions. [2021-12-06 23:34:07,217 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8458646616541353 [2021-12-06 23:34:07,217 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 675 transitions. [2021-12-06 23:34:07,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 675 transitions. [2021-12-06 23:34:07,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:34:07,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 675 transitions. [2021-12-06 23:34:07,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 96.42857142857143) internal successors, (675), 7 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-06 23:34:07,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 114.0) internal successors, (912), 8 states have internal predecessors, (912), 0 states have call successors, (0), 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-06 23:34:07,221 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 114.0) internal successors, (912), 8 states have internal predecessors, (912), 0 states have call successors, (0), 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-06 23:34:07,221 INFO L186 Difference]: Start difference. First operand has 134 places, 97 transitions, 272 flow. Second operand 7 states and 675 transitions. [2021-12-06 23:34:07,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 126 transitions, 506 flow [2021-12-06 23:34:07,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 126 transitions, 441 flow, removed 29 selfloop flow, removed 12 redundant places. [2021-12-06 23:34:07,227 INFO L242 Difference]: Finished difference. Result has 121 places, 95 transitions, 244 flow [2021-12-06 23:34:07,227 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=244, PETRI_PLACES=121, PETRI_TRANSITIONS=95} [2021-12-06 23:34:07,228 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 2 predicate places. [2021-12-06 23:34:07,228 INFO L470 AbstractCegarLoop]: Abstraction has has 121 places, 95 transitions, 244 flow [2021-12-06 23:34:07,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 0 states have call successors, (0), 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-06 23:34:07,229 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:34:07,229 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] [2021-12-06 23:34:07,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-06 23:34:07,229 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 23:34:07,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:34:07,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1826589658, now seen corresponding path program 1 times [2021-12-06 23:34:07,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:34:07,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135888746] [2021-12-06 23:34:07,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:34:07,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:34:07,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:34:07,436 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-06 23:34:07,436 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:34:07,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135888746] [2021-12-06 23:34:07,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135888746] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:34:07,436 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:34:07,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-06 23:34:07,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445769520] [2021-12-06 23:34:07,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:34:07,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 23:34:07,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:34:07,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 23:34:07,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-12-06 23:34:07,439 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114 [2021-12-06 23:34:07,441 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 95 transitions, 244 flow. Second operand has 11 states, 11 states have (on average 89.54545454545455) internal successors, (985), 11 states have internal predecessors, (985), 0 states have call successors, (0), 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-06 23:34:07,441 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:34:07,441 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114 [2021-12-06 23:34:07,441 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:34:07,712 INFO L129 PetriNetUnfolder]: 203/511 cut-off events. [2021-12-06 23:34:07,712 INFO L130 PetriNetUnfolder]: For 258/264 co-relation queries the response was YES. [2021-12-06 23:34:07,713 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1082 conditions, 511 events. 203/511 cut-off events. For 258/264 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2065 event pairs, 71 based on Foata normal form. 12/518 useless extension candidates. Maximal degree in co-relation 1012. Up to 220 conditions per place. [2021-12-06 23:34:07,716 INFO L132 encePairwiseOnDemand]: 101/114 looper letters, 20 selfloop transitions, 9 changer transitions 28/131 dead transitions. [2021-12-06 23:34:07,716 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 131 transitions, 458 flow [2021-12-06 23:34:07,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 23:34:07,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-06 23:34:07,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1203 transitions. [2021-12-06 23:34:07,721 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8117408906882592 [2021-12-06 23:34:07,721 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1203 transitions. [2021-12-06 23:34:07,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1203 transitions. [2021-12-06 23:34:07,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:34:07,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1203 transitions. [2021-12-06 23:34:07,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 92.53846153846153) internal successors, (1203), 13 states have internal predecessors, (1203), 0 states have call successors, (0), 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-06 23:34:07,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 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-06 23:34:07,731 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 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-06 23:34:07,731 INFO L186 Difference]: Start difference. First operand has 121 places, 95 transitions, 244 flow. Second operand 13 states and 1203 transitions. [2021-12-06 23:34:07,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 131 transitions, 458 flow [2021-12-06 23:34:07,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 131 transitions, 404 flow, removed 20 selfloop flow, removed 12 redundant places. [2021-12-06 23:34:07,736 INFO L242 Difference]: Finished difference. Result has 126 places, 100 transitions, 289 flow [2021-12-06 23:34:07,736 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=289, PETRI_PLACES=126, PETRI_TRANSITIONS=100} [2021-12-06 23:34:07,737 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 7 predicate places. [2021-12-06 23:34:07,737 INFO L470 AbstractCegarLoop]: Abstraction has has 126 places, 100 transitions, 289 flow [2021-12-06 23:34:07,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 89.54545454545455) internal successors, (985), 11 states have internal predecessors, (985), 0 states have call successors, (0), 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-06 23:34:07,738 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:34:07,738 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] [2021-12-06 23:34:07,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-06 23:34:07,738 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 23:34:07,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:34:07,739 INFO L85 PathProgramCache]: Analyzing trace with hash -242474442, now seen corresponding path program 2 times [2021-12-06 23:34:07,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:34:07,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089710147] [2021-12-06 23:34:07,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:34:07,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:34:07,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:34:07,901 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-06 23:34:07,901 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:34:07,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089710147] [2021-12-06 23:34:07,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089710147] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:34:07,901 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:34:07,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-06 23:34:07,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350056553] [2021-12-06 23:34:07,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:34:07,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 23:34:07,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:34:07,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 23:34:07,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-12-06 23:34:07,904 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2021-12-06 23:34:07,906 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 100 transitions, 289 flow. Second operand has 11 states, 11 states have (on average 90.45454545454545) internal successors, (995), 11 states have internal predecessors, (995), 0 states have call successors, (0), 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-06 23:34:07,906 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:34:07,906 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2021-12-06 23:34:07,906 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:34:08,154 INFO L129 PetriNetUnfolder]: 188/495 cut-off events. [2021-12-06 23:34:08,154 INFO L130 PetriNetUnfolder]: For 1202/1216 co-relation queries the response was YES. [2021-12-06 23:34:08,155 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1667 conditions, 495 events. 188/495 cut-off events. For 1202/1216 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2048 event pairs, 57 based on Foata normal form. 19/509 useless extension candidates. Maximal degree in co-relation 1597. Up to 198 conditions per place. [2021-12-06 23:34:08,158 INFO L132 encePairwiseOnDemand]: 101/114 looper letters, 18 selfloop transitions, 13 changer transitions 28/134 dead transitions. [2021-12-06 23:34:08,158 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 134 transitions, 669 flow [2021-12-06 23:34:08,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 23:34:08,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-06 23:34:08,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1303 transitions. [2021-12-06 23:34:08,162 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8164160401002506 [2021-12-06 23:34:08,162 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1303 transitions. [2021-12-06 23:34:08,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1303 transitions. [2021-12-06 23:34:08,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:34:08,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1303 transitions. [2021-12-06 23:34:08,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 93.07142857142857) internal successors, (1303), 14 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-06 23:34:08,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 0 states have call successors, (0), 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-06 23:34:08,170 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 0 states have call successors, (0), 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-06 23:34:08,170 INFO L186 Difference]: Start difference. First operand has 126 places, 100 transitions, 289 flow. Second operand 14 states and 1303 transitions. [2021-12-06 23:34:08,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 134 transitions, 669 flow [2021-12-06 23:34:08,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 134 transitions, 644 flow, removed 7 selfloop flow, removed 7 redundant places. [2021-12-06 23:34:08,174 INFO L242 Difference]: Finished difference. Result has 133 places, 103 transitions, 374 flow [2021-12-06 23:34:08,174 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=374, PETRI_PLACES=133, PETRI_TRANSITIONS=103} [2021-12-06 23:34:08,175 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 14 predicate places. [2021-12-06 23:34:08,175 INFO L470 AbstractCegarLoop]: Abstraction has has 133 places, 103 transitions, 374 flow [2021-12-06 23:34:08,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 90.45454545454545) internal successors, (995), 11 states have internal predecessors, (995), 0 states have call successors, (0), 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-06 23:34:08,175 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:34:08,176 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] [2021-12-06 23:34:08,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-06 23:34:08,176 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 23:34:08,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:34:08,176 INFO L85 PathProgramCache]: Analyzing trace with hash -316062698, now seen corresponding path program 1 times [2021-12-06 23:34:08,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:34:08,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534495992] [2021-12-06 23:34:08,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:34:08,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:34:08,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:34:08,253 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-06 23:34:08,253 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:34:08,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534495992] [2021-12-06 23:34:08,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534495992] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:34:08,254 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:34:08,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 23:34:08,254 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685650070] [2021-12-06 23:34:08,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:34:08,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 23:34:08,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:34:08,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 23:34:08,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 23:34:08,256 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2021-12-06 23:34:08,257 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 103 transitions, 374 flow. Second operand has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 0 states have call successors, (0), 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-06 23:34:08,257 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:34:08,257 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2021-12-06 23:34:08,257 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:34:08,572 INFO L129 PetriNetUnfolder]: 711/1549 cut-off events. [2021-12-06 23:34:08,573 INFO L130 PetriNetUnfolder]: For 9743/10073 co-relation queries the response was YES. [2021-12-06 23:34:08,576 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5522 conditions, 1549 events. 711/1549 cut-off events. For 9743/10073 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 9288 event pairs, 43 based on Foata normal form. 7/1487 useless extension candidates. Maximal degree in co-relation 5450. Up to 435 conditions per place. [2021-12-06 23:34:08,582 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 33 selfloop transitions, 7 changer transitions 40/156 dead transitions. [2021-12-06 23:34:08,582 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 156 transitions, 860 flow [2021-12-06 23:34:08,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 23:34:08,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-06 23:34:08,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 976 transitions. [2021-12-06 23:34:08,585 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.856140350877193 [2021-12-06 23:34:08,585 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 976 transitions. [2021-12-06 23:34:08,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 976 transitions. [2021-12-06 23:34:08,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:34:08,586 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 976 transitions. [2021-12-06 23:34:08,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.6) internal successors, (976), 10 states have internal predecessors, (976), 0 states have call successors, (0), 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-06 23:34:08,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 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-06 23:34:08,590 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 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-06 23:34:08,590 INFO L186 Difference]: Start difference. First operand has 133 places, 103 transitions, 374 flow. Second operand 10 states and 976 transitions. [2021-12-06 23:34:08,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 156 transitions, 860 flow [2021-12-06 23:34:08,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 156 transitions, 660 flow, removed 76 selfloop flow, removed 16 redundant places. [2021-12-06 23:34:08,594 INFO L242 Difference]: Finished difference. Result has 126 places, 102 transitions, 320 flow [2021-12-06 23:34:08,595 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=320, PETRI_PLACES=126, PETRI_TRANSITIONS=102} [2021-12-06 23:34:08,595 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 7 predicate places. [2021-12-06 23:34:08,595 INFO L470 AbstractCegarLoop]: Abstraction has has 126 places, 102 transitions, 320 flow [2021-12-06 23:34:08,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 0 states have call successors, (0), 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-06 23:34:08,596 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:34:08,596 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-06 23:34:08,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-06 23:34:08,596 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 23:34:08,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:34:08,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1979785821, now seen corresponding path program 1 times [2021-12-06 23:34:08,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:34:08,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134359239] [2021-12-06 23:34:08,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:34:08,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:34:08,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:34:08,670 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-06 23:34:08,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:34:08,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134359239] [2021-12-06 23:34:08,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134359239] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:34:08,671 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:34:08,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 23:34:08,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940510879] [2021-12-06 23:34:08,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:34:08,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 23:34:08,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:34:08,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 23:34:08,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 23:34:08,673 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2021-12-06 23:34:08,674 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 102 transitions, 320 flow. Second operand has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 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-06 23:34:08,674 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:34:08,674 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2021-12-06 23:34:08,674 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:34:08,906 INFO L129 PetriNetUnfolder]: 303/832 cut-off events. [2021-12-06 23:34:08,906 INFO L130 PetriNetUnfolder]: For 2009/2068 co-relation queries the response was YES. [2021-12-06 23:34:08,908 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2728 conditions, 832 events. 303/832 cut-off events. For 2009/2068 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4531 event pairs, 26 based on Foata normal form. 23/839 useless extension candidates. Maximal degree in co-relation 2662. Up to 203 conditions per place. [2021-12-06 23:34:08,911 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 41 selfloop transitions, 18 changer transitions 22/157 dead transitions. [2021-12-06 23:34:08,911 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 157 transitions, 871 flow [2021-12-06 23:34:08,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 23:34:08,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-06 23:34:08,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1071 transitions. [2021-12-06 23:34:08,914 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.854066985645933 [2021-12-06 23:34:08,914 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1071 transitions. [2021-12-06 23:34:08,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1071 transitions. [2021-12-06 23:34:08,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:34:08,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1071 transitions. [2021-12-06 23:34:08,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 97.36363636363636) internal successors, (1071), 11 states have internal predecessors, (1071), 0 states have call successors, (0), 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-06 23:34:08,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 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-06 23:34:08,919 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 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-06 23:34:08,919 INFO L186 Difference]: Start difference. First operand has 126 places, 102 transitions, 320 flow. Second operand 11 states and 1071 transitions. [2021-12-06 23:34:08,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 157 transitions, 871 flow [2021-12-06 23:34:08,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 157 transitions, 855 flow, removed 4 selfloop flow, removed 4 redundant places. [2021-12-06 23:34:08,929 INFO L242 Difference]: Finished difference. Result has 134 places, 117 transitions, 497 flow [2021-12-06 23:34:08,930 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=497, PETRI_PLACES=134, PETRI_TRANSITIONS=117} [2021-12-06 23:34:08,930 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 15 predicate places. [2021-12-06 23:34:08,930 INFO L470 AbstractCegarLoop]: Abstraction has has 134 places, 117 transitions, 497 flow [2021-12-06 23:34:08,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 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-06 23:34:08,931 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:34:08,931 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-06 23:34:08,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-06 23:34:08,931 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 23:34:08,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:34:08,931 INFO L85 PathProgramCache]: Analyzing trace with hash -287565212, now seen corresponding path program 1 times [2021-12-06 23:34:08,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:34:08,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129169677] [2021-12-06 23:34:08,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:34:08,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:34:08,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:34:09,010 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-06 23:34:09,010 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:34:09,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129169677] [2021-12-06 23:34:09,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129169677] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:34:09,011 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:34:09,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 23:34:09,011 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776046621] [2021-12-06 23:34:09,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:34:09,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 23:34:09,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:34:09,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 23:34:09,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:34:09,012 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2021-12-06 23:34:09,013 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 117 transitions, 497 flow. Second operand has 8 states, 8 states have (on average 92.125) internal successors, (737), 8 states have internal predecessors, (737), 0 states have call successors, (0), 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-06 23:34:09,013 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:34:09,013 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2021-12-06 23:34:09,013 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:34:09,295 INFO L129 PetriNetUnfolder]: 247/693 cut-off events. [2021-12-06 23:34:09,295 INFO L130 PetriNetUnfolder]: For 2536/2596 co-relation queries the response was YES. [2021-12-06 23:34:09,297 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2662 conditions, 693 events. 247/693 cut-off events. For 2536/2596 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3867 event pairs, 15 based on Foata normal form. 10/687 useless extension candidates. Maximal degree in co-relation 2591. Up to 169 conditions per place. [2021-12-06 23:34:09,299 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 34 selfloop transitions, 22 changer transitions 24/156 dead transitions. [2021-12-06 23:34:09,299 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 156 transitions, 941 flow [2021-12-06 23:34:09,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 23:34:09,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-06 23:34:09,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1332 transitions. [2021-12-06 23:34:09,303 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8345864661654135 [2021-12-06 23:34:09,303 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1332 transitions. [2021-12-06 23:34:09,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1332 transitions. [2021-12-06 23:34:09,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:34:09,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1332 transitions. [2021-12-06 23:34:09,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 95.14285714285714) internal successors, (1332), 14 states have internal predecessors, (1332), 0 states have call successors, (0), 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-06 23:34:09,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 0 states have call successors, (0), 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-06 23:34:09,309 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 0 states have call successors, (0), 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-06 23:34:09,309 INFO L186 Difference]: Start difference. First operand has 134 places, 117 transitions, 497 flow. Second operand 14 states and 1332 transitions. [2021-12-06 23:34:09,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 156 transitions, 941 flow [2021-12-06 23:34:09,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 156 transitions, 871 flow, removed 31 selfloop flow, removed 3 redundant places. [2021-12-06 23:34:09,317 INFO L242 Difference]: Finished difference. Result has 151 places, 118 transitions, 515 flow [2021-12-06 23:34:09,318 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=515, PETRI_PLACES=151, PETRI_TRANSITIONS=118} [2021-12-06 23:34:09,318 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 32 predicate places. [2021-12-06 23:34:09,318 INFO L470 AbstractCegarLoop]: Abstraction has has 151 places, 118 transitions, 515 flow [2021-12-06 23:34:09,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.125) internal successors, (737), 8 states have internal predecessors, (737), 0 states have call successors, (0), 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-06 23:34:09,319 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:34:09,319 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-06 23:34:09,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-06 23:34:09,319 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 23:34:09,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:34:09,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1749023714, now seen corresponding path program 1 times [2021-12-06 23:34:09,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:34:09,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141966495] [2021-12-06 23:34:09,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:34:09,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:34:09,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:34:09,511 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-06 23:34:09,512 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:34:09,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141966495] [2021-12-06 23:34:09,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141966495] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:34:09,512 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:34:09,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-06 23:34:09,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484224553] [2021-12-06 23:34:09,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:34:09,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-06 23:34:09,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:34:09,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-06 23:34:09,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-12-06 23:34:09,514 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 114 [2021-12-06 23:34:09,515 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 118 transitions, 515 flow. Second operand has 13 states, 13 states have (on average 88.6923076923077) internal successors, (1153), 13 states have internal predecessors, (1153), 0 states have call successors, (0), 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-06 23:34:09,515 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:34:09,515 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 114 [2021-12-06 23:34:09,515 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:34:09,687 INFO L129 PetriNetUnfolder]: 74/522 cut-off events. [2021-12-06 23:34:09,687 INFO L130 PetriNetUnfolder]: For 1327/1374 co-relation queries the response was YES. [2021-12-06 23:34:09,688 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1557 conditions, 522 events. 74/522 cut-off events. For 1327/1374 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3626 event pairs, 1 based on Foata normal form. 1/500 useless extension candidates. Maximal degree in co-relation 1494. Up to 74 conditions per place. [2021-12-06 23:34:09,690 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 20 selfloop transitions, 7 changer transitions 7/127 dead transitions. [2021-12-06 23:34:09,690 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 127 transitions, 619 flow [2021-12-06 23:34:09,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 23:34:09,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-06 23:34:09,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 902 transitions. [2021-12-06 23:34:09,691 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7912280701754386 [2021-12-06 23:34:09,691 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 902 transitions. [2021-12-06 23:34:09,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 902 transitions. [2021-12-06 23:34:09,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:34:09,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 902 transitions. [2021-12-06 23:34:09,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 90.2) internal successors, (902), 10 states have internal predecessors, (902), 0 states have call successors, (0), 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-06 23:34:09,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 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-06 23:34:09,695 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 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-06 23:34:09,695 INFO L186 Difference]: Start difference. First operand has 151 places, 118 transitions, 515 flow. Second operand 10 states and 902 transitions. [2021-12-06 23:34:09,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 127 transitions, 619 flow [2021-12-06 23:34:09,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 127 transitions, 511 flow, removed 36 selfloop flow, removed 16 redundant places. [2021-12-06 23:34:09,702 INFO L242 Difference]: Finished difference. Result has 145 places, 117 transitions, 440 flow [2021-12-06 23:34:09,702 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=440, PETRI_PLACES=145, PETRI_TRANSITIONS=117} [2021-12-06 23:34:09,703 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 26 predicate places. [2021-12-06 23:34:09,703 INFO L470 AbstractCegarLoop]: Abstraction has has 145 places, 117 transitions, 440 flow [2021-12-06 23:34:09,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 88.6923076923077) internal successors, (1153), 13 states have internal predecessors, (1153), 0 states have call successors, (0), 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-06 23:34:09,703 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:34:09,704 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-06 23:34:09,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-06 23:34:09,704 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 23:34:09,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:34:09,704 INFO L85 PathProgramCache]: Analyzing trace with hash -500552962, now seen corresponding path program 2 times [2021-12-06 23:34:09,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:34:09,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399584985] [2021-12-06 23:34:09,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:34:09,705 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:34:09,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 23:34:09,743 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 23:34:09,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 23:34:09,810 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 23:34:09,811 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-06 23:34:09,811 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2021-12-06 23:34:09,813 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2021-12-06 23:34:09,813 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2021-12-06 23:34:09,813 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2021-12-06 23:34:09,813 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2021-12-06 23:34:09,813 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2021-12-06 23:34:09,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-06 23:34:09,816 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:34:09,820 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-06 23:34:09,820 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 23:34:09,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 11:34:09 BasicIcfg [2021-12-06 23:34:09,904 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 23:34:09,905 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 23:34:09,905 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 23:34:09,905 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 23:34:09,905 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 11:34:03" (3/4) ... [2021-12-06 23:34:09,907 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-06 23:34:09,994 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_464e63f8-428e-47c5-857f-d4e334f41837/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-06 23:34:09,994 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 23:34:09,994 INFO L158 Benchmark]: Toolchain (without parser) took 7255.73ms. Allocated memory was 123.7MB in the beginning and 220.2MB in the end (delta: 96.5MB). Free memory was 87.5MB in the beginning and 160.1MB in the end (delta: -72.6MB). Peak memory consumption was 130.7MB. Max. memory is 16.1GB. [2021-12-06 23:34:09,995 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 123.7MB. Free memory was 105.4MB in the beginning and 105.2MB in the end (delta: 119.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 23:34:09,995 INFO L158 Benchmark]: CACSL2BoogieTranslator took 417.15ms. Allocated memory is still 123.7MB. Free memory was 87.3MB in the beginning and 88.1MB in the end (delta: -824.3kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-06 23:34:09,995 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.45ms. Allocated memory is still 123.7MB. Free memory was 88.1MB in the beginning and 85.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-06 23:34:09,996 INFO L158 Benchmark]: Boogie Preprocessor took 26.06ms. Allocated memory is still 123.7MB. Free memory was 84.9MB in the beginning and 82.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 23:34:09,996 INFO L158 Benchmark]: RCFGBuilder took 706.00ms. Allocated memory is still 123.7MB. Free memory was 82.8MB in the beginning and 64.3MB in the end (delta: 18.5MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. [2021-12-06 23:34:09,996 INFO L158 Benchmark]: TraceAbstraction took 5964.42ms. Allocated memory was 123.7MB in the beginning and 220.2MB in the end (delta: 96.5MB). Free memory was 63.5MB in the beginning and 61.2MB in the end (delta: 2.3MB). Peak memory consumption was 98.5MB. Max. memory is 16.1GB. [2021-12-06 23:34:09,996 INFO L158 Benchmark]: Witness Printer took 89.23ms. Allocated memory is still 220.2MB. Free memory was 61.2MB in the beginning and 160.1MB in the end (delta: -98.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-06 23:34:09,998 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.13ms. Allocated memory is still 123.7MB. Free memory was 105.4MB in the beginning and 105.2MB in the end (delta: 119.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 417.15ms. Allocated memory is still 123.7MB. Free memory was 87.3MB in the beginning and 88.1MB in the end (delta: -824.3kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.45ms. Allocated memory is still 123.7MB. Free memory was 88.1MB in the beginning and 85.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.06ms. Allocated memory is still 123.7MB. Free memory was 84.9MB in the beginning and 82.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 706.00ms. Allocated memory is still 123.7MB. Free memory was 82.8MB in the beginning and 64.3MB in the end (delta: 18.5MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5964.42ms. Allocated memory was 123.7MB in the beginning and 220.2MB in the end (delta: 96.5MB). Free memory was 63.5MB in the beginning and 61.2MB in the end (delta: 2.3MB). Peak memory consumption was 98.5MB. Max. memory is 16.1GB. * Witness Printer took 89.23ms. Allocated memory is still 220.2MB. Free memory was 61.2MB in the beginning and 160.1MB in the end (delta: -98.9MB). Peak memory consumption was 8.4MB. 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: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L718] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L719] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L720] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L721] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L722] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L723] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L724] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L725] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L726] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L727] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L728] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L729] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L730] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L731] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L732] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L733] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L735] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L818] 0 pthread_t t1804; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1804={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L819] FCALL, FORK 0 pthread_create(&t1804, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1804, ((void *)0), P0, ((void *)0))=-2, t1804={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] 0 pthread_t t1805; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1804={5:0}, t1805={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L821] FCALL, FORK 0 pthread_create(&t1805, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1805, ((void *)0), P1, ((void *)0))=-1, t1804={5:0}, t1805={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L822] 0 pthread_t t1806; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1804={5:0}, t1805={6:0}, t1806={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L823] FCALL, FORK 0 pthread_create(&t1806, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1806, ((void *)0), P2, ((void *)0))=0, t1804={5:0}, t1805={6:0}, t1806={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L793] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1804={5:0}, t1805={6:0}, t1806={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1804={5:0}, t1805={6:0}, t1806={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, 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=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, 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=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - 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: 819]: 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: 823]: 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: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 141 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.8s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 597 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 597 mSDsluCounter, 504 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 948 mSDsCounter, 121 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1372 IncrementalHoareTripleChecker+Invalid, 1493 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 121 mSolverCounterUnsat, 112 mSDtfsCounter, 1372 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=515occurred in iteration=11, InterpolantAutomatonStates: 121, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1021 NumberOfCodeBlocks, 1021 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 921 ConstructedInterpolants, 0 QuantifiedInterpolants, 4090 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-06 23:34:10,026 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_464e63f8-428e-47c5-857f-d4e334f41837/bin/uautomizer-DrprNOufMa/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