./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe010_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa5f3f8e-dc5c-4de9-8f96-b2585223c040/bin/uautomizer-Z5i5R5N3CC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa5f3f8e-dc5c-4de9-8f96-b2585223c040/bin/uautomizer-Z5i5R5N3CC/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa5f3f8e-dc5c-4de9-8f96-b2585223c040/bin/uautomizer-Z5i5R5N3CC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa5f3f8e-dc5c-4de9-8f96-b2585223c040/bin/uautomizer-Z5i5R5N3CC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe010_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa5f3f8e-dc5c-4de9-8f96-b2585223c040/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa5f3f8e-dc5c-4de9-8f96-b2585223c040/bin/uautomizer-Z5i5R5N3CC --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 8f541a138480ce6ec56b62e26c3220f9edb5dd16 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2021-10-11 00:31:38,654 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 00:31:38,656 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 00:31:38,685 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 00:31:38,686 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 00:31:38,687 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 00:31:38,689 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 00:31:38,691 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 00:31:38,693 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 00:31:38,695 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 00:31:38,696 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 00:31:38,697 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 00:31:38,698 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 00:31:38,699 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 00:31:38,701 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 00:31:38,702 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 00:31:38,703 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 00:31:38,704 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 00:31:38,706 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 00:31:38,708 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 00:31:38,710 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 00:31:38,713 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 00:31:38,715 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 00:31:38,716 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 00:31:38,719 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 00:31:38,720 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 00:31:38,720 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 00:31:38,721 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 00:31:38,722 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 00:31:38,723 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 00:31:38,723 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 00:31:38,724 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 00:31:38,725 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 00:31:38,726 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 00:31:38,736 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 00:31:38,737 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 00:31:38,738 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 00:31:38,738 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 00:31:38,739 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 00:31:38,740 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 00:31:38,741 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 00:31:38,743 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa5f3f8e-dc5c-4de9-8f96-b2585223c040/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-11 00:31:38,786 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 00:31:38,787 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 00:31:38,789 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-11 00:31:38,789 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-11 00:31:38,789 INFO L138 SettingsManager]: * Use SBE=true [2021-10-11 00:31:38,790 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 00:31:38,790 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 00:31:38,790 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 00:31:38,791 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 00:31:38,798 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 00:31:38,799 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-11 00:31:38,799 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-11 00:31:38,799 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-11 00:31:38,800 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 00:31:38,800 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 00:31:38,800 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 00:31:38,800 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-11 00:31:38,801 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 00:31:38,801 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-11 00:31:38,801 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-11 00:31:38,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 00:31:38,802 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 00:31:38,802 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-11 00:31:38,802 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-11 00:31:38,803 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-11 00:31:38,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-11 00:31:38,803 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-11 00:31:38,803 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 00:31:38,804 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_fa5f3f8e-dc5c-4de9-8f96-b2585223c040/bin/uautomizer-Z5i5R5N3CC/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_fa5f3f8e-dc5c-4de9-8f96-b2585223c040/bin/uautomizer-Z5i5R5N3CC 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 -> 8f541a138480ce6ec56b62e26c3220f9edb5dd16 [2021-10-11 00:31:39,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 00:31:39,176 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 00:31:39,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 00:31:39,184 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 00:31:39,184 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 00:31:39,185 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa5f3f8e-dc5c-4de9-8f96-b2585223c040/bin/uautomizer-Z5i5R5N3CC/../../sv-benchmarks/c/pthread-wmm/safe010_power.opt.i [2021-10-11 00:31:39,269 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa5f3f8e-dc5c-4de9-8f96-b2585223c040/bin/uautomizer-Z5i5R5N3CC/data/da3cd4011/08a01e11051f40e291ada8d94bef098a/FLAG79eee1be0 [2021-10-11 00:31:39,815 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 00:31:39,816 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa5f3f8e-dc5c-4de9-8f96-b2585223c040/sv-benchmarks/c/pthread-wmm/safe010_power.opt.i [2021-10-11 00:31:39,840 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa5f3f8e-dc5c-4de9-8f96-b2585223c040/bin/uautomizer-Z5i5R5N3CC/data/da3cd4011/08a01e11051f40e291ada8d94bef098a/FLAG79eee1be0 [2021-10-11 00:31:40,116 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa5f3f8e-dc5c-4de9-8f96-b2585223c040/bin/uautomizer-Z5i5R5N3CC/data/da3cd4011/08a01e11051f40e291ada8d94bef098a [2021-10-11 00:31:40,120 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 00:31:40,122 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 00:31:40,125 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 00:31:40,125 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 00:31:40,130 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 00:31:40,131 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:31:40" (1/1) ... [2021-10-11 00:31:40,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ac19b7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:31:40, skipping insertion in model container [2021-10-11 00:31:40,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:31:40" (1/1) ... [2021-10-11 00:31:40,140 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 00:31:40,185 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 00:31:40,374 WARN L226 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_fa5f3f8e-dc5c-4de9-8f96-b2585223c040/sv-benchmarks/c/pthread-wmm/safe010_power.opt.i[951,964] [2021-10-11 00:31:40,560 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 00:31:40,576 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 00:31:40,593 WARN L226 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_fa5f3f8e-dc5c-4de9-8f96-b2585223c040/sv-benchmarks/c/pthread-wmm/safe010_power.opt.i[951,964] [2021-10-11 00:31:40,649 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 00:31:40,729 INFO L208 MainTranslator]: Completed translation [2021-10-11 00:31:40,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:31:40 WrapperNode [2021-10-11 00:31:40,729 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 00:31:40,730 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 00:31:40,731 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 00:31:40,731 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 00:31:40,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:31:40" (1/1) ... [2021-10-11 00:31:40,758 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:31:40" (1/1) ... [2021-10-11 00:31:40,792 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 00:31:40,793 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 00:31:40,793 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 00:31:40,794 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 00:31:40,802 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:31:40" (1/1) ... [2021-10-11 00:31:40,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:31:40" (1/1) ... [2021-10-11 00:31:40,807 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:31:40" (1/1) ... [2021-10-11 00:31:40,808 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:31:40" (1/1) ... [2021-10-11 00:31:40,818 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:31:40" (1/1) ... [2021-10-11 00:31:40,821 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:31:40" (1/1) ... [2021-10-11 00:31:40,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:31:40" (1/1) ... [2021-10-11 00:31:40,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 00:31:40,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 00:31:40,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 00:31:40,831 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 00:31:40,833 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:31:40" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa5f3f8e-dc5c-4de9-8f96-b2585223c040/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 00:31:40,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-11 00:31:40,922 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-11 00:31:40,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 00:31:40,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-11 00:31:40,923 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-10-11 00:31:40,923 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-10-11 00:31:40,923 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-10-11 00:31:40,923 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-10-11 00:31:40,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 00:31:40,928 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-11 00:31:40,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 00:31:40,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 00:31:40,931 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-11 00:31:43,018 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 00:31:43,019 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-10-11 00:31:43,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:31:43 BoogieIcfgContainer [2021-10-11 00:31:43,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 00:31:43,024 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-11 00:31:43,024 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-11 00:31:43,029 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-11 00:31:43,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:31:40" (1/3) ... [2021-10-11 00:31:43,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16befb8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:31:43, skipping insertion in model container [2021-10-11 00:31:43,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:31:40" (2/3) ... [2021-10-11 00:31:43,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16befb8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:31:43, skipping insertion in model container [2021-10-11 00:31:43,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:31:43" (3/3) ... [2021-10-11 00:31:43,032 INFO L111 eAbstractionObserver]: Analyzing ICFG safe010_power.opt.i [2021-10-11 00:31:43,050 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-11 00:31:43,050 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-11 00:31:43,053 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-10-11 00:31:43,054 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-11 00:31:43,096 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,096 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,096 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,096 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,097 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,097 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,097 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,097 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,098 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,098 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,098 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,098 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,098 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,099 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,099 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,099 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,099 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,100 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,100 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,100 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,100 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,100 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,101 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,101 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,102 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,102 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,102 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,103 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,103 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,104 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,104 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,107 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,107 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,108 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,108 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,115 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,115 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,116 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,116 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,116 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,116 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,116 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,117 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,117 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,117 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,117 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,117 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,119 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,120 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,120 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,120 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,120 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,120 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,121 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,121 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,121 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,121 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:31:43,123 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-10-11 00:31:43,134 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-10-11 00:31:43,173 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-10-11 00:31:43,173 INFO L378 AbstractCegarLoop]: Hoare is true [2021-10-11 00:31:43,173 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-10-11 00:31:43,173 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 00:31:43,173 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 00:31:43,174 INFO L382 AbstractCegarLoop]: Difference is false [2021-10-11 00:31:43,174 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 00:31:43,174 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-10-11 00:31:43,185 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-11 00:31:43,187 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 80 transitions, 170 flow [2021-10-11 00:31:43,190 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 80 transitions, 170 flow [2021-10-11 00:31:43,192 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 85 places, 80 transitions, 170 flow [2021-10-11 00:31:43,227 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2021-10-11 00:31:43,228 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-11 00:31:43,231 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 78 events. 2/78 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-10-11 00:31:43,233 INFO L116 LiptonReduction]: Number of co-enabled transitions 926 [2021-10-11 00:31:43,617 WARN L197 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-10-11 00:31:43,728 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2021-10-11 00:31:44,207 WARN L197 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-10-11 00:31:44,391 WARN L197 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-10-11 00:31:44,496 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 00:31:44,496 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:44,506 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2021-10-11 00:31:44,507 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:44,619 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2021-10-11 00:31:44,620 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:31:44,622 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-10-11 00:31:44,623 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:31:44,752 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:31:44,752 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:31:44,760 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2021-10-11 00:31:44,761 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:44,763 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:31:44,764 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:44,769 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:31:44,769 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 00:31:44,772 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:31:44,772 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 00:31:44,774 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:31:44,775 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 00:31:44,781 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-10-11 00:31:44,781 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:44,787 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-10-11 00:31:44,787 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:44,790 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-10-11 00:31:44,791 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:44,874 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 00:31:44,874 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:44,875 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2021-10-11 00:31:44,876 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:44,880 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2021-10-11 00:31:44,881 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-10-11 00:31:44,889 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 3, 2, 1] term [2021-10-11 00:31:44,890 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:45,418 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 00:31:45,418 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:45,427 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2021-10-11 00:31:45,428 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:45,443 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2021-10-11 00:31:45,443 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:45,444 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 00:31:45,444 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:45,445 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2021-10-11 00:31:45,446 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:45,501 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 2, 1] term [2021-10-11 00:31:45,501 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:45,502 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2021-10-11 00:31:45,503 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:46,677 WARN L197 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2021-10-11 00:31:47,144 WARN L197 SmtUtils]: Spent 465.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2021-10-11 00:31:48,943 WARN L197 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 308 DAG size of output: 264 [2021-10-11 00:31:49,697 WARN L197 SmtUtils]: Spent 749.00 ms on a formula simplification that was a NOOP. DAG size: 261 [2021-10-11 00:31:49,752 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 00:31:49,753 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:49,753 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2021-10-11 00:31:49,754 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:49,757 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2021-10-11 00:31:49,757 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-10-11 00:31:49,760 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 3, 2, 1] term [2021-10-11 00:31:49,761 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:49,813 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:31:49,813 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:31:49,827 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2021-10-11 00:31:49,827 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:49,828 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:31:49,829 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:49,832 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:31:49,832 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 00:31:49,833 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:31:49,834 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 00:31:49,836 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:31:49,836 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 00:31:49,839 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-10-11 00:31:49,839 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:49,841 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-10-11 00:31:49,841 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:49,844 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-10-11 00:31:49,844 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:49,994 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:31:49,994 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:31:49,996 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2021-10-11 00:31:49,997 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:49,998 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:31:49,998 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:50,001 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:31:50,001 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 00:31:50,003 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:31:50,003 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 00:31:50,005 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:31:50,005 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 00:31:50,007 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-10-11 00:31:50,008 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:50,009 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-10-11 00:31:50,009 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:50,011 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-10-11 00:31:50,012 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:50,076 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 00:31:50,076 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:50,077 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2021-10-11 00:31:50,078 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:50,080 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2021-10-11 00:31:50,080 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-10-11 00:31:50,089 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 3, 2, 1] term [2021-10-11 00:31:50,089 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:50,134 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 00:31:50,134 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:50,135 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2021-10-11 00:31:50,135 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:50,195 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 00:31:50,195 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:50,196 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2021-10-11 00:31:50,196 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:50,233 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2021-10-11 00:31:50,233 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:31:50,234 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-10-11 00:31:50,234 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:31:50,265 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 00:31:50,266 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:50,270 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2021-10-11 00:31:50,270 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:50,690 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 00:31:50,690 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:50,691 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2021-10-11 00:31:50,692 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:50,721 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2021-10-11 00:31:50,722 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:31:50,722 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-10-11 00:31:50,723 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:31:50,758 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2021-10-11 00:31:50,758 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:31:50,871 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 00:31:50,871 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:50,872 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2021-10-11 00:31:50,872 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:50,914 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 00:31:50,915 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:50,915 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2021-10-11 00:31:50,916 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:50,947 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2021-10-11 00:31:50,948 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:31:50,948 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-10-11 00:31:50,949 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:31:50,978 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 00:31:50,978 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:50,979 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2021-10-11 00:31:50,979 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:51,014 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2021-10-11 00:31:51,015 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:31:51,319 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 2, 1] term [2021-10-11 00:31:51,319 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:51,320 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2021-10-11 00:31:51,321 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:51,345 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 00:31:51,345 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:51,345 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2021-10-11 00:31:51,348 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:31:51,731 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2021-10-11 00:31:52,018 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2021-10-11 00:31:52,019 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:31:53,470 WARN L197 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2021-10-11 00:31:53,650 WARN L197 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-10-11 00:31:54,096 WARN L197 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2021-10-11 00:31:54,251 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-10-11 00:31:54,264 INFO L131 LiptonReduction]: Checked pairs total: 2423 [2021-10-11 00:31:54,264 INFO L133 LiptonReduction]: Total number of compositions: 73 [2021-10-11 00:31:54,271 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 27 places, 21 transitions, 52 flow [2021-10-11 00:31:54,294 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 194 states. [2021-10-11 00:31:54,296 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states. [2021-10-11 00:31:54,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-11 00:31:54,301 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:31:54,302 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-11 00:31:54,302 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:31:54,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:31:54,309 INFO L82 PathProgramCache]: Analyzing trace with hash 914219, now seen corresponding path program 1 times [2021-10-11 00:31:54,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:31:54,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537474517] [2021-10-11 00:31:54,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:31:54,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:31:54,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:31:54,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537474517] [2021-10-11 00:31:54,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:31:54,561 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-11 00:31:54,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296721162] [2021-10-11 00:31:54,566 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:31:54,566 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:31:54,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:31:54,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:31:54,588 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 3 states. [2021-10-11 00:31:54,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:31:54,657 INFO L93 Difference]: Finished difference Result 162 states and 385 transitions. [2021-10-11 00:31:54,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:31:54,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2021-10-11 00:31:54,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:31:54,670 INFO L225 Difference]: With dead ends: 162 [2021-10-11 00:31:54,670 INFO L226 Difference]: Without dead ends: 137 [2021-10-11 00:31:54,671 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:31:54,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-10-11 00:31:54,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2021-10-11 00:31:54,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2021-10-11 00:31:54,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 320 transitions. [2021-10-11 00:31:54,719 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 320 transitions. Word has length 3 [2021-10-11 00:31:54,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:31:54,719 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 320 transitions. [2021-10-11 00:31:54,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:31:54,719 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 320 transitions. [2021-10-11 00:31:54,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-11 00:31:54,720 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:31:54,721 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:31:54,721 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-11 00:31:54,721 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:31:54,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:31:54,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1599981207, now seen corresponding path program 1 times [2021-10-11 00:31:54,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:31:54,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561622516] [2021-10-11 00:31:54,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:31:54,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:31:54,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:31:54,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561622516] [2021-10-11 00:31:54,958 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:31:54,958 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 00:31:54,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625836401] [2021-10-11 00:31:54,959 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:31:54,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:31:54,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:31:54,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:31:54,960 INFO L87 Difference]: Start difference. First operand 137 states and 320 transitions. Second operand 4 states. [2021-10-11 00:31:54,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:31:54,992 INFO L93 Difference]: Finished difference Result 152 states and 337 transitions. [2021-10-11 00:31:54,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:31:54,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2021-10-11 00:31:54,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:31:54,994 INFO L225 Difference]: With dead ends: 152 [2021-10-11 00:31:54,994 INFO L226 Difference]: Without dead ends: 127 [2021-10-11 00:31:54,995 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:31:54,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-10-11 00:31:55,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2021-10-11 00:31:55,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2021-10-11 00:31:55,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 292 transitions. [2021-10-11 00:31:55,009 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 292 transitions. Word has length 8 [2021-10-11 00:31:55,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:31:55,009 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 292 transitions. [2021-10-11 00:31:55,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:31:55,009 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 292 transitions. [2021-10-11 00:31:55,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-11 00:31:55,011 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:31:55,011 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:31:55,011 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-11 00:31:55,011 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:31:55,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:31:55,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1939606054, now seen corresponding path program 1 times [2021-10-11 00:31:55,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:31:55,012 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916677995] [2021-10-11 00:31:55,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:31:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:31:55,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:31:55,121 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916677995] [2021-10-11 00:31:55,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:31:55,121 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:31:55,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068955152] [2021-10-11 00:31:55,122 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:31:55,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:31:55,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:31:55,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:31:55,123 INFO L87 Difference]: Start difference. First operand 127 states and 292 transitions. Second operand 5 states. [2021-10-11 00:31:55,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:31:55,188 INFO L93 Difference]: Finished difference Result 167 states and 374 transitions. [2021-10-11 00:31:55,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 00:31:55,189 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2021-10-11 00:31:55,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:31:55,190 INFO L225 Difference]: With dead ends: 167 [2021-10-11 00:31:55,190 INFO L226 Difference]: Without dead ends: 87 [2021-10-11 00:31:55,190 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-11 00:31:55,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-10-11 00:31:55,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-10-11 00:31:55,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2021-10-11 00:31:55,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 184 transitions. [2021-10-11 00:31:55,198 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 184 transitions. Word has length 9 [2021-10-11 00:31:55,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:31:55,198 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 184 transitions. [2021-10-11 00:31:55,198 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:31:55,199 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 184 transitions. [2021-10-11 00:31:55,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-11 00:31:55,200 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:31:55,200 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:31:55,200 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-11 00:31:55,200 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:31:55,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:31:55,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1839059167, now seen corresponding path program 1 times [2021-10-11 00:31:55,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:31:55,201 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295177149] [2021-10-11 00:31:55,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:31:55,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:31:55,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:31:55,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295177149] [2021-10-11 00:31:55,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:31:55,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:31:55,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629874365] [2021-10-11 00:31:55,485 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 00:31:55,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:31:55,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 00:31:55,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-11 00:31:55,487 INFO L87 Difference]: Start difference. First operand 87 states and 184 transitions. Second operand 6 states. [2021-10-11 00:31:55,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:31:55,623 INFO L93 Difference]: Finished difference Result 95 states and 191 transitions. [2021-10-11 00:31:55,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 00:31:55,623 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2021-10-11 00:31:55,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:31:55,624 INFO L225 Difference]: With dead ends: 95 [2021-10-11 00:31:55,624 INFO L226 Difference]: Without dead ends: 83 [2021-10-11 00:31:55,625 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-10-11 00:31:55,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-10-11 00:31:55,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2021-10-11 00:31:55,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2021-10-11 00:31:55,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 172 transitions. [2021-10-11 00:31:55,630 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 172 transitions. Word has length 11 [2021-10-11 00:31:55,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:31:55,631 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 172 transitions. [2021-10-11 00:31:55,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 00:31:55,631 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 172 transitions. [2021-10-11 00:31:55,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-11 00:31:55,632 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:31:55,632 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:31:55,632 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-11 00:31:55,632 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:31:55,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:31:55,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1175562397, now seen corresponding path program 1 times [2021-10-11 00:31:55,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:31:55,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440657305] [2021-10-11 00:31:55,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:31:55,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:31:55,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:31:55,773 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440657305] [2021-10-11 00:31:55,773 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:31:55,773 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:31:55,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531817642] [2021-10-11 00:31:55,774 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:31:55,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:31:55,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:31:55,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:31:55,774 INFO L87 Difference]: Start difference. First operand 83 states and 172 transitions. Second operand 4 states. [2021-10-11 00:31:55,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:31:55,800 INFO L93 Difference]: Finished difference Result 72 states and 126 transitions. [2021-10-11 00:31:55,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:31:55,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2021-10-11 00:31:55,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:31:55,802 INFO L225 Difference]: With dead ends: 72 [2021-10-11 00:31:55,802 INFO L226 Difference]: Without dead ends: 55 [2021-10-11 00:31:55,802 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:31:55,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-10-11 00:31:55,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2021-10-11 00:31:55,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2021-10-11 00:31:55,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 92 transitions. [2021-10-11 00:31:55,806 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 92 transitions. Word has length 12 [2021-10-11 00:31:55,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:31:55,806 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 92 transitions. [2021-10-11 00:31:55,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:31:55,806 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 92 transitions. [2021-10-11 00:31:55,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-11 00:31:55,807 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:31:55,807 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:31:55,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-11 00:31:55,807 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:31:55,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:31:55,808 INFO L82 PathProgramCache]: Analyzing trace with hash -554044553, now seen corresponding path program 1 times [2021-10-11 00:31:55,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:31:55,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189764243] [2021-10-11 00:31:55,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:31:55,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:31:55,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:31:55,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189764243] [2021-10-11 00:31:55,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:31:55,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:31:55,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108440524] [2021-10-11 00:31:55,879 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:31:55,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:31:55,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:31:55,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:31:55,880 INFO L87 Difference]: Start difference. First operand 55 states and 92 transitions. Second operand 5 states. [2021-10-11 00:31:55,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:31:55,916 INFO L93 Difference]: Finished difference Result 40 states and 60 transitions. [2021-10-11 00:31:55,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 00:31:55,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2021-10-11 00:31:55,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:31:55,917 INFO L225 Difference]: With dead ends: 40 [2021-10-11 00:31:55,917 INFO L226 Difference]: Without dead ends: 33 [2021-10-11 00:31:55,917 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-11 00:31:55,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-10-11 00:31:55,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2021-10-11 00:31:55,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2021-10-11 00:31:55,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 48 transitions. [2021-10-11 00:31:55,920 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 48 transitions. Word has length 13 [2021-10-11 00:31:55,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:31:55,920 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 48 transitions. [2021-10-11 00:31:55,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:31:55,920 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 48 transitions. [2021-10-11 00:31:55,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-11 00:31:55,920 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:31:55,921 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:31:55,921 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-11 00:31:55,921 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:31:55,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:31:55,921 INFO L82 PathProgramCache]: Analyzing trace with hash -647783936, now seen corresponding path program 1 times [2021-10-11 00:31:55,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:31:55,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020882824] [2021-10-11 00:31:55,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:31:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:31:56,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:31:56,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020882824] [2021-10-11 00:31:56,286 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:31:56,286 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-11 00:31:56,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579645711] [2021-10-11 00:31:56,286 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-10-11 00:31:56,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:31:56,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-11 00:31:56,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-10-11 00:31:56,287 INFO L87 Difference]: Start difference. First operand 33 states and 48 transitions. Second operand 9 states. [2021-10-11 00:31:56,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:31:56,406 INFO L93 Difference]: Finished difference Result 42 states and 58 transitions. [2021-10-11 00:31:56,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 00:31:56,407 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2021-10-11 00:31:56,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:31:56,407 INFO L225 Difference]: With dead ends: 42 [2021-10-11 00:31:56,407 INFO L226 Difference]: Without dead ends: 25 [2021-10-11 00:31:56,408 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-10-11 00:31:56,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-10-11 00:31:56,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-10-11 00:31:56,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2021-10-11 00:31:56,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2021-10-11 00:31:56,409 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 16 [2021-10-11 00:31:56,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:31:56,410 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2021-10-11 00:31:56,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-10-11 00:31:56,410 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2021-10-11 00:31:56,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-11 00:31:56,410 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:31:56,411 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:31:56,411 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-11 00:31:56,411 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:31:56,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:31:56,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1457285376, now seen corresponding path program 2 times [2021-10-11 00:31:56,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:31:56,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846397765] [2021-10-11 00:31:56,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:31:56,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:31:56,510 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:31:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:31:56,575 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:31:56,624 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:31:56,625 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-10-11 00:31:56,625 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-11 00:31:56,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:31:56 BasicIcfg [2021-10-11 00:31:56,716 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-11 00:31:56,717 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 00:31:56,717 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 00:31:56,717 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 00:31:56,718 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:31:43" (3/4) ... [2021-10-11 00:31:56,720 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-11 00:31:56,826 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa5f3f8e-dc5c-4de9-8f96-b2585223c040/bin/uautomizer-Z5i5R5N3CC/witness.graphml [2021-10-11 00:31:56,826 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 00:31:56,829 INFO L168 Benchmark]: Toolchain (without parser) took 16704.49 ms. Allocated memory was 90.2 MB in the beginning and 325.1 MB in the end (delta: 234.9 MB). Free memory was 54.5 MB in the beginning and 263.6 MB in the end (delta: -209.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 16.1 GB. [2021-10-11 00:31:56,829 INFO L168 Benchmark]: CDTParser took 0.83 ms. Allocated memory is still 90.2 MB. Free memory was 62.9 MB in the beginning and 62.9 MB in the end (delta: 30.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 00:31:56,830 INFO L168 Benchmark]: CACSL2BoogieTranslator took 604.52 ms. Allocated memory was 90.2 MB in the beginning and 117.4 MB in the end (delta: 27.3 MB). Free memory was 54.4 MB in the beginning and 70.8 MB in the end (delta: -16.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-11 00:31:56,830 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.25 ms. Allocated memory is still 117.4 MB. Free memory was 70.8 MB in the beginning and 67.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 00:31:56,830 INFO L168 Benchmark]: Boogie Preprocessor took 37.18 ms. Allocated memory is still 117.4 MB. Free memory was 67.8 MB in the beginning and 65.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 00:31:56,831 INFO L168 Benchmark]: RCFGBuilder took 2190.98 ms. Allocated memory was 117.4 MB in the beginning and 144.7 MB in the end (delta: 27.3 MB). Free memory was 65.7 MB in the beginning and 56.5 MB in the end (delta: 9.2 MB). Peak memory consumption was 41.6 MB. Max. memory is 16.1 GB. [2021-10-11 00:31:56,831 INFO L168 Benchmark]: TraceAbstraction took 13692.75 ms. Allocated memory was 144.7 MB in the beginning and 325.1 MB in the end (delta: 180.4 MB). Free memory was 55.5 MB in the beginning and 272.0 MB in the end (delta: -216.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 00:31:56,831 INFO L168 Benchmark]: Witness Printer took 109.01 ms. Allocated memory is still 325.1 MB. Free memory was 272.0 MB in the beginning and 263.6 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-11 00:31:56,834 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.83 ms. Allocated memory is still 90.2 MB. Free memory was 62.9 MB in the beginning and 62.9 MB in the end (delta: 30.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 604.52 ms. Allocated memory was 90.2 MB in the beginning and 117.4 MB in the end (delta: 27.3 MB). Free memory was 54.4 MB in the beginning and 70.8 MB in the end (delta: -16.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 62.25 ms. Allocated memory is still 117.4 MB. Free memory was 70.8 MB in the beginning and 67.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 37.18 ms. Allocated memory is still 117.4 MB. Free memory was 67.8 MB in the beginning and 65.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2190.98 ms. Allocated memory was 117.4 MB in the beginning and 144.7 MB in the end (delta: 27.3 MB). Free memory was 65.7 MB in the beginning and 56.5 MB in the end (delta: 9.2 MB). Peak memory consumption was 41.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 13692.75 ms. Allocated memory was 144.7 MB in the beginning and 325.1 MB in the end (delta: 180.4 MB). Free memory was 55.5 MB in the beginning and 272.0 MB in the end (delta: -216.6 MB). There was no memory consumed. Max. memory is 16.1 GB. * Witness Printer took 109.01 ms. Allocated memory is still 325.1 MB. Free memory was 272.0 MB in the beginning and 263.6 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 577 VarBasedMoverChecksPositive, 42 VarBasedMoverChecksNegative, 12 SemBasedMoverChecksPositive, 30 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 61 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 11.0s, 85 PlacesBefore, 27 PlacesAfterwards, 80 TransitionsBefore, 21 TransitionsAfterwards, 926 CoEnabledTransitionPairs, 6 FixpointIterations, 32 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 73 TotalNumberOfCompositions, 2423 MoverChecksTotal - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L716] 0 int y = 0; [L717] 0 _Bool y$flush_delayed; [L718] 0 int y$mem_tmp; [L719] 0 _Bool y$r_buff0_thd0; [L720] 0 _Bool y$r_buff0_thd1; [L721] 0 _Bool y$r_buff0_thd2; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$read_delayed; [L726] 0 int *y$read_delayed_var; [L727] 0 int y$w_buff0; [L728] 0 _Bool y$w_buff0_used; [L729] 0 int y$w_buff1; [L730] 0 _Bool y$w_buff1_used; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t2011; [L793] FCALL, FORK 0 pthread_create(&t2011, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y$w_buff1 = y$w_buff0 [L737] 1 y$w_buff0 = 2 [L738] 1 y$w_buff1_used = y$w_buff0_used [L739] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L741] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L794] 0 pthread_t t2012; [L795] FCALL, FORK 0 pthread_create(&t2012, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L750] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L751] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L752] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L753] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L754] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L774] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L804] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L804] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L805] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L805] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 y$flush_delayed = weak$$choice2 [L811] 0 y$mem_tmp = y [L812] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L812] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L813] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L813] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L813] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L813] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L814] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L814] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L814] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L814] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L815] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L815] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L815] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L815] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L816] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L816] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L817] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L817] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L817] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L818] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L818] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) [L820] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L820] 0 y = y$flush_delayed ? y$mem_tmp : y [L821] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 79 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.4s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.1s, HoareTripleCheckerStatistics: 126 SDtfs, 125 SDslu, 267 SDs, 0 SdLazy, 148 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=194occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 88 NumberOfCodeBlocks, 88 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 65 ConstructedInterpolants, 0 QuantifiedInterpolants, 9153 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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! Received shutdown request...