./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe029_pso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7325dc0f-6f8d-4013-856f-61a9a5308ebf/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_7325dc0f-6f8d-4013-856f-61a9a5308ebf/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7325dc0f-6f8d-4013-856f-61a9a5308ebf/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7325dc0f-6f8d-4013-856f-61a9a5308ebf/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe029_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_7325dc0f-6f8d-4013-856f-61a9a5308ebf/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7325dc0f-6f8d-4013-856f-61a9a5308ebf/bin/uautomizer --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 a17df1fba77819f5184121d2d7522e7b6e3b3c7f .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-a4ecdab [2020-11-28 03:11:26,576 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 03:11:26,579 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 03:11:26,631 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 03:11:26,631 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 03:11:26,633 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 03:11:26,650 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 03:11:26,653 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 03:11:26,656 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 03:11:26,657 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 03:11:26,659 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 03:11:26,661 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 03:11:26,661 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 03:11:26,663 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 03:11:26,665 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 03:11:26,667 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 03:11:26,669 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 03:11:26,674 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 03:11:26,677 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 03:11:26,691 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 03:11:26,693 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 03:11:26,699 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 03:11:26,701 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 03:11:26,702 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 03:11:26,705 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 03:11:26,706 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 03:11:26,706 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 03:11:26,708 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 03:11:26,708 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 03:11:26,710 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 03:11:26,710 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 03:11:26,711 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 03:11:26,713 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 03:11:26,714 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 03:11:26,715 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 03:11:26,716 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 03:11:26,717 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 03:11:26,718 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 03:11:26,719 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 03:11:26,720 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 03:11:26,721 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 03:11:26,723 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7325dc0f-6f8d-4013-856f-61a9a5308ebf/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-28 03:11:26,755 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 03:11:26,765 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 03:11:26,767 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 03:11:26,769 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 03:11:26,769 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 03:11:26,769 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 03:11:26,770 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 03:11:26,770 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 03:11:26,770 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 03:11:26,771 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 03:11:26,772 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-28 03:11:26,772 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-28 03:11:26,773 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-28 03:11:26,773 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 03:11:26,773 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 03:11:26,773 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 03:11:26,774 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-28 03:11:26,774 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 03:11:26,774 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 03:11:26,774 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-28 03:11:26,775 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-28 03:11:26,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 03:11:26,775 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 03:11:26,776 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-28 03:11:26,776 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-28 03:11:26,776 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 03:11:26,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-28 03:11:26,777 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-28 03:11:26,777 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 03:11:26,777 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-vcloud-master/worker/run_dir_7325dc0f-6f8d-4013-856f-61a9a5308ebf/bin/uautomizer/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-vcloud-master/worker/run_dir_7325dc0f-6f8d-4013-856f-61a9a5308ebf/bin/uautomizer 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 -> a17df1fba77819f5184121d2d7522e7b6e3b3c7f [2020-11-28 03:11:27,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 03:11:27,151 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 03:11:27,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 03:11:27,156 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 03:11:27,158 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 03:11:27,160 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7325dc0f-6f8d-4013-856f-61a9a5308ebf/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe029_pso.oepc.i [2020-11-28 03:11:27,255 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7325dc0f-6f8d-4013-856f-61a9a5308ebf/bin/uautomizer/data/840fbed41/89ba98635d6b4411bde7f0aa212db339/FLAGce61dd9b7 [2020-11-28 03:11:28,046 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 03:11:28,048 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7325dc0f-6f8d-4013-856f-61a9a5308ebf/sv-benchmarks/c/pthread-wmm/safe029_pso.oepc.i [2020-11-28 03:11:28,076 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7325dc0f-6f8d-4013-856f-61a9a5308ebf/bin/uautomizer/data/840fbed41/89ba98635d6b4411bde7f0aa212db339/FLAGce61dd9b7 [2020-11-28 03:11:28,234 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7325dc0f-6f8d-4013-856f-61a9a5308ebf/bin/uautomizer/data/840fbed41/89ba98635d6b4411bde7f0aa212db339 [2020-11-28 03:11:28,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 03:11:28,239 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 03:11:28,251 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 03:11:28,251 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 03:11:28,255 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 03:11:28,256 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:11:28" (1/1) ... [2020-11-28 03:11:28,260 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@887594e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:11:28, skipping insertion in model container [2020-11-28 03:11:28,261 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:11:28" (1/1) ... [2020-11-28 03:11:28,271 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 03:11:28,330 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 03:11:28,790 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:11:28,802 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 03:11:28,889 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:11:29,014 INFO L208 MainTranslator]: Completed translation [2020-11-28 03:11:29,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:11:29 WrapperNode [2020-11-28 03:11:29,016 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 03:11:29,019 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 03:11:29,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 03:11:29,019 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 03:11:29,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:11:29" (1/1) ... [2020-11-28 03:11:29,070 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:11:29" (1/1) ... [2020-11-28 03:11:29,142 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 03:11:29,147 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 03:11:29,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 03:11:29,148 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 03:11:29,159 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:11:29" (1/1) ... [2020-11-28 03:11:29,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:11:29" (1/1) ... [2020-11-28 03:11:29,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:11:29" (1/1) ... [2020-11-28 03:11:29,182 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:11:29" (1/1) ... [2020-11-28 03:11:29,193 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:11:29" (1/1) ... [2020-11-28 03:11:29,209 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:11:29" (1/1) ... [2020-11-28 03:11:29,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:11:29" (1/1) ... [2020-11-28 03:11:29,226 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 03:11:29,235 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 03:11:29,236 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 03:11:29,236 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 03:11:29,237 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:11:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7325dc0f-6f8d-4013-856f-61a9a5308ebf/bin/uautomizer/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 [2020-11-28 03:11:29,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-28 03:11:29,329 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-28 03:11:29,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 03:11:29,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-28 03:11:29,330 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-28 03:11:29,330 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-28 03:11:29,330 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-28 03:11:29,331 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-28 03:11:29,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 03:11:29,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-28 03:11:29,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 03:11:29,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 03:11:29,334 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-28 03:11:32,190 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 03:11:32,191 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-28 03:11:32,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:11:32 BoogieIcfgContainer [2020-11-28 03:11:32,193 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 03:11:32,195 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-28 03:11:32,195 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-28 03:11:32,200 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-28 03:11:32,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:11:28" (1/3) ... [2020-11-28 03:11:32,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32faee36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:11:32, skipping insertion in model container [2020-11-28 03:11:32,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:11:29" (2/3) ... [2020-11-28 03:11:32,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32faee36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:11:32, skipping insertion in model container [2020-11-28 03:11:32,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:11:32" (3/3) ... [2020-11-28 03:11:32,207 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_pso.oepc.i [2020-11-28 03:11:32,220 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-28 03:11:32,220 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-28 03:11:32,226 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-28 03:11:32,227 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-28 03:11:32,277 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,277 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,278 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,278 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,279 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,280 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,280 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,280 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,281 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,281 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,281 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,282 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,282 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,282 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,282 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,283 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,283 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,286 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,287 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,287 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,295 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,295 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,295 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,296 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,296 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,296 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,296 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,297 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,297 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,297 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,297 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,298 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,298 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,298 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,304 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,304 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:11:32,307 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-28 03:11:32,322 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-11-28 03:11:32,363 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-28 03:11:32,363 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-28 03:11:32,363 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-28 03:11:32,363 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 03:11:32,364 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 03:11:32,364 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-28 03:11:32,365 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 03:11:32,365 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-28 03:11:32,387 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-28 03:11:32,390 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 83 transitions, 176 flow [2020-11-28 03:11:32,394 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 83 transitions, 176 flow [2020-11-28 03:11:32,396 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 87 places, 83 transitions, 176 flow [2020-11-28 03:11:32,469 INFO L129 PetriNetUnfolder]: 3/81 cut-off events. [2020-11-28 03:11:32,470 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-28 03:11:32,474 INFO L80 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 81 events. 3/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2020-11-28 03:11:32,477 INFO L116 LiptonReduction]: Number of co-enabled transitions 1046 [2020-11-28 03:11:32,752 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:11:32,752 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:32,755 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:32,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:32,767 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:32,768 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:11:32,777 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:11:32,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:11:32,836 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:32,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:32,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:32,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:32,850 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:32,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:11:32,857 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:11:32,859 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:11:33,394 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-11-28 03:11:33,436 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:11:33,437 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:33,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:33,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:33,444 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:33,445 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:11:33,451 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:11:33,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:11:33,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:11:33,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:33,498 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:33,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:33,505 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:33,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:11:33,511 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:11:33,512 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:11:34,263 WARN L193 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-28 03:11:34,418 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-28 03:11:34,620 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-28 03:11:34,762 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-28 03:11:34,808 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:34,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:34,814 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:34,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:34,817 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:34,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:11:34,820 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:11:34,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:11:34,863 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:11:34,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:34,864 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:34,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:34,867 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:34,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:11:34,870 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:11:34,871 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:11:35,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:35,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:35,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:35,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:35,094 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:35,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:11:35,097 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:11:35,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:11:35,129 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:11:35,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:35,131 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:35,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:35,133 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:35,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:11:35,136 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:11:35,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:11:35,491 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:11:35,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:35,492 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:35,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:35,495 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:35,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:11:35,498 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:11:35,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:11:35,522 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:11:35,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:35,523 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:35,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:35,526 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:35,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:11:35,528 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:11:35,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:11:35,571 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:11:35,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:35,572 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:35,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:35,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:35,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:11:35,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:11:35,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:11:35,602 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:35,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:35,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:35,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:35,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:35,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:11:35,611 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:11:35,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:11:35,684 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:11:35,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:35,686 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-11-28 03:11:35,686 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:35,689 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:11:35,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 03:11:35,699 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 03:11:35,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:35,754 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:11:35,754 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:35,766 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:11:35,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:35,768 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:35,768 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:35,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:35,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:11:35,773 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:35,774 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:11:35,776 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:35,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:11:35,779 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 03:11:35,779 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:35,782 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:11:35,783 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:35,784 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:11:35,785 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:35,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 03:11:35,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:35,988 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-28 03:11:35,989 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:35,990 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-11-28 03:11:35,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:36,018 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-28 03:11:36,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:36,019 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-11-28 03:11:36,020 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:36,049 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-28 03:11:36,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:36,050 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-11-28 03:11:36,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:36,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-28 03:11:36,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:36,079 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-11-28 03:11:36,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:36,353 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:11:36,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:36,355 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:36,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:36,357 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:36,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:36,359 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:11:36,359 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:36,378 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:11:36,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:36,380 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:36,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:36,382 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:36,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:11:36,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:11:36,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:11:36,418 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:11:36,419 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:36,420 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:36,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:36,422 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:36,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:11:36,424 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:11:36,425 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:11:36,452 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:36,453 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:36,454 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:36,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:36,456 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:36,456 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:36,457 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:11:36,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:36,904 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2020-11-28 03:11:36,970 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:11:36,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:36,972 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:36,972 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:36,974 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:36,974 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:11:36,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:11:36,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:11:36,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:36,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:36,996 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:36,997 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:36,998 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:36,999 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:37,000 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:11:37,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:37,026 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:37,026 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:37,027 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:37,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:37,029 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:37,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:11:37,031 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:11:37,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:11:37,050 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:11:37,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:37,052 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:37,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:37,053 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:37,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:37,055 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:11:37,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:37,089 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:11:37,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:37,122 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:11:37,122 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:37,123 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:37,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:37,127 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:37,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:11:37,129 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:37,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:11:37,131 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:37,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:11:37,133 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 03:11:37,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:37,136 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:11:37,136 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:37,138 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 03:11:37,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:37,200 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:11:37,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:37,201 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-11-28 03:11:37,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:37,205 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:11:37,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 03:11:37,208 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 03:11:37,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:38,981 WARN L193 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 227 DAG size of output: 186 [2020-11-28 03:11:39,010 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-11-28 03:11:39,010 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:39,011 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-11-28 03:11:39,011 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:40,238 WARN L193 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 141 DAG size of output: 104 [2020-11-28 03:11:41,627 WARN L193 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 235 DAG size of output: 194 [2020-11-28 03:11:41,641 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-11-28 03:11:41,641 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:41,642 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-11-28 03:11:41,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:43,116 WARN L193 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 149 DAG size of output: 120 [2020-11-28 03:11:44,576 WARN L193 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 227 DAG size of output: 187 [2020-11-28 03:11:44,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-11-28 03:11:44,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:44,586 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-11-28 03:11:44,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:46,029 WARN L193 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 142 DAG size of output: 105 [2020-11-28 03:11:46,056 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:46,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:46,057 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:46,057 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:46,060 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:46,060 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:46,062 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:11:46,063 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:46,094 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:46,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:46,095 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:46,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:46,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:46,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:11:46,100 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:11:46,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:11:46,230 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:46,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:46,231 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:46,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:46,233 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:46,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:46,235 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:11:46,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:46,267 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:11:46,267 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:46,268 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:46,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:46,270 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:46,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:11:46,273 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:11:46,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:11:46,379 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 3, 5, 2, 2, 1] term [2020-11-28 03:11:46,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:46,380 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-28 03:11:46,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:46,382 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:46,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:46,383 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:46,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:46,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:46,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:46,387 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:46,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:46,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 5, 3, 5, 3, 2, 1] term [2020-11-28 03:11:46,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:46,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 3, 5, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:46,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:46,394 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 3, 5, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:46,395 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:46,423 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 5, 3, 5, 3, 2, 1] term [2020-11-28 03:11:46,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:11:46,425 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 2, 1] term [2020-11-28 03:11:46,426 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:46,461 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 2, 2, 1] term [2020-11-28 03:11:46,461 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:46,462 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:11:46,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:46,463 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:46,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:46,464 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:46,465 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:46,468 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:46,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:46,469 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:46,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:46,472 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-11-28 03:11:46,473 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:46,475 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:46,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:46,477 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:46,477 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:46,500 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 2, 1] term [2020-11-28 03:11:46,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:11:46,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-11-28 03:11:46,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:46,981 WARN L193 SmtUtils]: Spent 445.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-11-28 03:11:47,332 WARN L193 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2020-11-28 03:11:47,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 5, 3, 5, 3, 2, 1] term [2020-11-28 03:11:47,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:11:47,391 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 2, 1] term [2020-11-28 03:11:47,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:47,411 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 3, 5, 2, 2, 1] term [2020-11-28 03:11:47,412 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:47,413 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-28 03:11:47,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:47,414 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:47,414 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:47,415 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:47,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:47,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:47,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:47,419 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:47,419 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:47,421 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 5, 3, 5, 3, 2, 1] term [2020-11-28 03:11:47,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:47,423 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 3, 5, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:47,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:47,425 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 3, 5, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:47,426 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:47,648 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-11-28 03:11:47,711 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 2, 2, 1] term [2020-11-28 03:11:47,711 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:47,712 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:11:47,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:47,714 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:47,714 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:47,715 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:47,716 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:47,719 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:47,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:47,721 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:47,721 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:47,724 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-11-28 03:11:47,724 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:47,727 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:47,727 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:47,729 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:47,729 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:47,754 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 2, 1] term [2020-11-28 03:11:47,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:11:47,757 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-11-28 03:11:47,758 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:48,208 WARN L193 SmtUtils]: Spent 419.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-11-28 03:11:48,649 WARN L193 SmtUtils]: Spent 438.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-11-28 03:11:49,180 WARN L193 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2020-11-28 03:11:49,394 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-11-28 03:11:49,447 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 2, 1] term [2020-11-28 03:11:49,448 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:11:49,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-11-28 03:11:49,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:49,483 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 2, 2, 1] term [2020-11-28 03:11:49,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:49,484 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:11:49,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:49,485 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:49,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:49,487 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:49,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:11:49,488 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:49,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:49,490 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:49,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:49,492 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-11-28 03:11:49,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:49,495 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:49,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:49,497 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:11:49,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:11:49,565 INFO L131 LiptonReduction]: Checked pairs total: 2642 [2020-11-28 03:11:49,565 INFO L133 LiptonReduction]: Total number of compositions: 83 [2020-11-28 03:11:49,572 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 19 transitions, 48 flow [2020-11-28 03:11:49,602 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 164 states. [2020-11-28 03:11:49,604 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states. [2020-11-28 03:11:49,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-11-28 03:11:49,610 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:11:49,610 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-11-28 03:11:49,611 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:11:49,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:11:49,620 INFO L82 PathProgramCache]: Analyzing trace with hash 948624, now seen corresponding path program 1 times [2020-11-28 03:11:49,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:11:49,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926469720] [2020-11-28 03:11:49,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:11:49,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:11:49,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:11:49,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926469720] [2020-11-28 03:11:49,934 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:11:49,934 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 03:11:49,935 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201233901] [2020-11-28 03:11:49,939 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:11:49,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:11:49,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:11:49,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:11:49,961 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 3 states. [2020-11-28 03:11:50,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:11:50,071 INFO L93 Difference]: Finished difference Result 137 states and 320 transitions. [2020-11-28 03:11:50,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:11:50,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-11-28 03:11:50,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:11:50,093 INFO L225 Difference]: With dead ends: 137 [2020-11-28 03:11:50,093 INFO L226 Difference]: Without dead ends: 112 [2020-11-28 03:11:50,095 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 [2020-11-28 03:11:50,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-11-28 03:11:50,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-11-28 03:11:50,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-11-28 03:11:50,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 255 transitions. [2020-11-28 03:11:50,175 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 255 transitions. Word has length 3 [2020-11-28 03:11:50,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:11:50,175 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 255 transitions. [2020-11-28 03:11:50,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:11:50,176 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 255 transitions. [2020-11-28 03:11:50,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-28 03:11:50,178 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:11:50,178 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:11:50,179 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-28 03:11:50,179 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:11:50,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:11:50,183 INFO L82 PathProgramCache]: Analyzing trace with hash -51811783, now seen corresponding path program 1 times [2020-11-28 03:11:50,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:11:50,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545154323] [2020-11-28 03:11:50,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:11:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:11:50,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:11:50,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545154323] [2020-11-28 03:11:50,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:11:50,376 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 03:11:50,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259086210] [2020-11-28 03:11:50,377 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:11:50,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:11:50,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:11:50,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:11:50,381 INFO L87 Difference]: Start difference. First operand 112 states and 255 transitions. Second operand 3 states. [2020-11-28 03:11:50,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:11:50,440 INFO L93 Difference]: Finished difference Result 111 states and 252 transitions. [2020-11-28 03:11:50,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:11:50,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-11-28 03:11:50,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:11:50,448 INFO L225 Difference]: With dead ends: 111 [2020-11-28 03:11:50,448 INFO L226 Difference]: Without dead ends: 111 [2020-11-28 03:11:50,449 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 [2020-11-28 03:11:50,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-11-28 03:11:50,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2020-11-28 03:11:50,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-11-28 03:11:50,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 252 transitions. [2020-11-28 03:11:50,469 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 252 transitions. Word has length 7 [2020-11-28 03:11:50,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:11:50,470 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 252 transitions. [2020-11-28 03:11:50,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:11:50,470 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 252 transitions. [2020-11-28 03:11:50,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-28 03:11:50,471 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:11:50,471 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:11:50,471 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-28 03:11:50,471 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:11:50,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:11:50,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1592805591, now seen corresponding path program 1 times [2020-11-28 03:11:50,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:11:50,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226122434] [2020-11-28 03:11:50,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:11:50,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:11:50,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:11:50,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226122434] [2020-11-28 03:11:50,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:11:50,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:11:50,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651178893] [2020-11-28 03:11:50,625 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:11:50,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:11:50,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:11:50,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:11:50,626 INFO L87 Difference]: Start difference. First operand 111 states and 252 transitions. Second operand 4 states. [2020-11-28 03:11:50,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:11:50,745 INFO L93 Difference]: Finished difference Result 107 states and 241 transitions. [2020-11-28 03:11:50,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:11:50,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-11-28 03:11:50,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:11:50,751 INFO L225 Difference]: With dead ends: 107 [2020-11-28 03:11:50,751 INFO L226 Difference]: Without dead ends: 107 [2020-11-28 03:11:50,751 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 [2020-11-28 03:11:50,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-11-28 03:11:50,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2020-11-28 03:11:50,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-11-28 03:11:50,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 241 transitions. [2020-11-28 03:11:50,770 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 241 transitions. Word has length 8 [2020-11-28 03:11:50,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:11:50,771 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 241 transitions. [2020-11-28 03:11:50,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:11:50,771 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 241 transitions. [2020-11-28 03:11:50,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-28 03:11:50,772 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:11:50,772 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:11:50,772 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-28 03:11:50,772 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:11:50,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:11:50,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1606197126, now seen corresponding path program 1 times [2020-11-28 03:11:50,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:11:50,773 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215192977] [2020-11-28 03:11:50,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:11:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:11:50,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:11:50,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215192977] [2020-11-28 03:11:50,973 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:11:50,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:11:50,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634943310] [2020-11-28 03:11:50,974 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:11:50,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:11:50,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:11:50,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:11:50,975 INFO L87 Difference]: Start difference. First operand 107 states and 241 transitions. Second operand 4 states. [2020-11-28 03:11:51,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:11:51,029 INFO L93 Difference]: Finished difference Result 106 states and 238 transitions. [2020-11-28 03:11:51,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:11:51,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-11-28 03:11:51,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:11:51,031 INFO L225 Difference]: With dead ends: 106 [2020-11-28 03:11:51,031 INFO L226 Difference]: Without dead ends: 106 [2020-11-28 03:11:51,032 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:11:51,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-11-28 03:11:51,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2020-11-28 03:11:51,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-11-28 03:11:51,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 238 transitions. [2020-11-28 03:11:51,041 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 238 transitions. Word has length 8 [2020-11-28 03:11:51,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:11:51,048 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 238 transitions. [2020-11-28 03:11:51,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:11:51,048 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 238 transitions. [2020-11-28 03:11:51,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-28 03:11:51,050 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:11:51,050 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:11:51,051 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-28 03:11:51,051 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:11:51,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:11:51,051 INFO L82 PathProgramCache]: Analyzing trace with hash -2132364918, now seen corresponding path program 1 times [2020-11-28 03:11:51,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:11:51,052 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573625140] [2020-11-28 03:11:51,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:11:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:11:51,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:11:51,344 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573625140] [2020-11-28 03:11:51,345 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:11:51,345 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:11:51,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778401354] [2020-11-28 03:11:51,345 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:11:51,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:11:51,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:11:51,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:11:51,346 INFO L87 Difference]: Start difference. First operand 106 states and 238 transitions. Second operand 5 states. [2020-11-28 03:11:51,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:11:51,460 INFO L93 Difference]: Finished difference Result 104 states and 232 transitions. [2020-11-28 03:11:51,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:11:51,462 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-11-28 03:11:51,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:11:51,464 INFO L225 Difference]: With dead ends: 104 [2020-11-28 03:11:51,464 INFO L226 Difference]: Without dead ends: 104 [2020-11-28 03:11:51,464 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:11:51,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-11-28 03:11:51,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-11-28 03:11:51,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-11-28 03:11:51,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 232 transitions. [2020-11-28 03:11:51,491 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 232 transitions. Word has length 9 [2020-11-28 03:11:51,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:11:51,492 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 232 transitions. [2020-11-28 03:11:51,492 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:11:51,492 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 232 transitions. [2020-11-28 03:11:51,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-28 03:11:51,493 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:11:51,493 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:11:51,494 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-28 03:11:51,494 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:11:51,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:11:51,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1747427314, now seen corresponding path program 1 times [2020-11-28 03:11:51,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:11:51,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639840837] [2020-11-28 03:11:51,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:11:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:11:51,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:11:51,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639840837] [2020-11-28 03:11:51,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:11:51,620 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:11:51,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811453573] [2020-11-28 03:11:51,621 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:11:51,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:11:51,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:11:51,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:11:51,622 INFO L87 Difference]: Start difference. First operand 104 states and 232 transitions. Second operand 5 states. [2020-11-28 03:11:51,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:11:51,700 INFO L93 Difference]: Finished difference Result 102 states and 226 transitions. [2020-11-28 03:11:51,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:11:51,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-11-28 03:11:51,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:11:51,704 INFO L225 Difference]: With dead ends: 102 [2020-11-28 03:11:51,705 INFO L226 Difference]: Without dead ends: 102 [2020-11-28 03:11:51,705 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:11:51,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-11-28 03:11:51,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2020-11-28 03:11:51,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-11-28 03:11:51,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 224 transitions. [2020-11-28 03:11:51,728 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 224 transitions. Word has length 9 [2020-11-28 03:11:51,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:11:51,729 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 224 transitions. [2020-11-28 03:11:51,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:11:51,729 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 224 transitions. [2020-11-28 03:11:51,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-28 03:11:51,731 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:11:51,731 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:11:51,731 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-28 03:11:51,732 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:11:51,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:11:51,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1678872350, now seen corresponding path program 1 times [2020-11-28 03:11:51,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:11:51,734 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018022402] [2020-11-28 03:11:51,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:11:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:11:52,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:11:52,028 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018022402] [2020-11-28 03:11:52,028 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:11:52,028 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:11:52,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789750077] [2020-11-28 03:11:52,028 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 03:11:52,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:11:52,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 03:11:52,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:11:52,029 INFO L87 Difference]: Start difference. First operand 101 states and 224 transitions. Second operand 6 states. [2020-11-28 03:11:52,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:11:52,164 INFO L93 Difference]: Finished difference Result 119 states and 260 transitions. [2020-11-28 03:11:52,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:11:52,165 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-11-28 03:11:52,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:11:52,166 INFO L225 Difference]: With dead ends: 119 [2020-11-28 03:11:52,167 INFO L226 Difference]: Without dead ends: 119 [2020-11-28 03:11:52,167 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-28 03:11:52,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-11-28 03:11:52,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2020-11-28 03:11:52,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-11-28 03:11:52,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 257 transitions. [2020-11-28 03:11:52,176 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 257 transitions. Word has length 10 [2020-11-28 03:11:52,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:11:52,176 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 257 transitions. [2020-11-28 03:11:52,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 03:11:52,176 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 257 transitions. [2020-11-28 03:11:52,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-28 03:11:52,177 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:11:52,178 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:11:52,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-28 03:11:52,179 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:11:52,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:11:52,179 INFO L82 PathProgramCache]: Analyzing trace with hash -505503669, now seen corresponding path program 1 times [2020-11-28 03:11:52,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:11:52,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830199218] [2020-11-28 03:11:52,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:11:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:11:52,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:11:52,520 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830199218] [2020-11-28 03:11:52,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:11:52,521 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:11:52,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102033412] [2020-11-28 03:11:52,521 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-28 03:11:52,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:11:52,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-28 03:11:52,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:11:52,522 INFO L87 Difference]: Start difference. First operand 117 states and 257 transitions. Second operand 7 states. [2020-11-28 03:11:52,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:11:52,646 INFO L93 Difference]: Finished difference Result 153 states and 326 transitions. [2020-11-28 03:11:52,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:11:52,647 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-11-28 03:11:52,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:11:52,648 INFO L225 Difference]: With dead ends: 153 [2020-11-28 03:11:52,648 INFO L226 Difference]: Without dead ends: 135 [2020-11-28 03:11:52,649 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:11:52,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-11-28 03:11:52,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 117. [2020-11-28 03:11:52,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-11-28 03:11:52,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 254 transitions. [2020-11-28 03:11:52,656 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 254 transitions. Word has length 11 [2020-11-28 03:11:52,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:11:52,657 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 254 transitions. [2020-11-28 03:11:52,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-28 03:11:52,657 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 254 transitions. [2020-11-28 03:11:52,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-28 03:11:52,659 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:11:52,659 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:11:52,659 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-28 03:11:52,659 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:11:52,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:11:52,660 INFO L82 PathProgramCache]: Analyzing trace with hash -505718933, now seen corresponding path program 1 times [2020-11-28 03:11:52,660 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:11:52,661 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412586809] [2020-11-28 03:11:52,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:11:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:11:52,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:11:52,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412586809] [2020-11-28 03:11:52,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:11:52,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:11:52,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594265423] [2020-11-28 03:11:52,718 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:11:52,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:11:52,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:11:52,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:11:52,719 INFO L87 Difference]: Start difference. First operand 117 states and 254 transitions. Second operand 3 states. [2020-11-28 03:11:52,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:11:52,735 INFO L93 Difference]: Finished difference Result 157 states and 325 transitions. [2020-11-28 03:11:52,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:11:52,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-11-28 03:11:52,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:11:52,737 INFO L225 Difference]: With dead ends: 157 [2020-11-28 03:11:52,737 INFO L226 Difference]: Without dead ends: 94 [2020-11-28 03:11:52,738 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:11:52,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-11-28 03:11:52,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2020-11-28 03:11:52,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-11-28 03:11:52,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 171 transitions. [2020-11-28 03:11:52,743 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 171 transitions. Word has length 11 [2020-11-28 03:11:52,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:11:52,744 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 171 transitions. [2020-11-28 03:11:52,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:11:52,744 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 171 transitions. [2020-11-28 03:11:52,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-28 03:11:52,745 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:11:52,746 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:11:52,746 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-28 03:11:52,746 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:11:52,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:11:52,747 INFO L82 PathProgramCache]: Analyzing trace with hash -548127863, now seen corresponding path program 2 times [2020-11-28 03:11:52,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:11:52,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764220267] [2020-11-28 03:11:52,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:11:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:11:52,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:11:52,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764220267] [2020-11-28 03:11:52,855 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:11:52,855 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:11:52,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622404708] [2020-11-28 03:11:52,856 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:11:52,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:11:52,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:11:52,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:11:52,857 INFO L87 Difference]: Start difference. First operand 90 states and 171 transitions. Second operand 4 states. [2020-11-28 03:11:52,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:11:52,914 INFO L93 Difference]: Finished difference Result 79 states and 126 transitions. [2020-11-28 03:11:52,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:11:52,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-11-28 03:11:52,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:11:52,916 INFO L225 Difference]: With dead ends: 79 [2020-11-28 03:11:52,916 INFO L226 Difference]: Without dead ends: 57 [2020-11-28 03:11:52,916 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 [2020-11-28 03:11:52,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-11-28 03:11:52,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-11-28 03:11:52,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-11-28 03:11:52,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 85 transitions. [2020-11-28 03:11:52,919 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 85 transitions. Word has length 11 [2020-11-28 03:11:52,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:11:52,920 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 85 transitions. [2020-11-28 03:11:52,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:11:52,920 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 85 transitions. [2020-11-28 03:11:52,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-28 03:11:52,921 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:11:52,921 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:11:52,921 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-28 03:11:52,922 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:11:52,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:11:52,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1087278397, now seen corresponding path program 1 times [2020-11-28 03:11:52,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:11:52,923 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598569140] [2020-11-28 03:11:52,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:11:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:11:53,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:11:53,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598569140] [2020-11-28 03:11:53,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:11:53,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:11:53,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14949505] [2020-11-28 03:11:53,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:11:53,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:11:53,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:11:53,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:11:53,083 INFO L87 Difference]: Start difference. First operand 57 states and 85 transitions. Second operand 5 states. [2020-11-28 03:11:53,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:11:53,149 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2020-11-28 03:11:53,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:11:53,150 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-11-28 03:11:53,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:11:53,150 INFO L225 Difference]: With dead ends: 45 [2020-11-28 03:11:53,151 INFO L226 Difference]: Without dead ends: 24 [2020-11-28 03:11:53,151 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 [2020-11-28 03:11:53,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-11-28 03:11:53,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-11-28 03:11:53,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-11-28 03:11:53,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2020-11-28 03:11:53,153 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 12 [2020-11-28 03:11:53,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:11:53,153 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2020-11-28 03:11:53,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:11:53,153 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2020-11-28 03:11:53,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-28 03:11:53,154 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:11:53,155 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:11:53,155 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-28 03:11:53,155 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:11:53,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:11:53,156 INFO L82 PathProgramCache]: Analyzing trace with hash -521387093, now seen corresponding path program 1 times [2020-11-28 03:11:53,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:11:53,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629532343] [2020-11-28 03:11:53,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:11:53,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:11:53,239 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:11:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:11:53,308 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:11:53,341 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:11:53,342 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-28 03:11:53,342 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-28 03:11:53,343 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-11-28 03:11:53,353 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [911] [911] L797-->L804: Formula: (let ((.cse6 (= (mod ~y$w_buff0_used~0_In242326897 256) 0)) (.cse7 (= (mod ~y$r_buff0_thd0~0_In242326897 256) 0)) (.cse9 (= (mod ~y$r_buff1_thd0~0_In242326897 256) 0)) (.cse8 (= (mod ~y$w_buff1_used~0_In242326897 256) 0))) (let ((.cse2 (or .cse9 .cse8)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse3 (or .cse6 .cse7)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (or (and .cse0 (= ~y$w_buff1_used~0_Out242326897 0) .cse1) (and .cse2 (= ~y$w_buff1_used~0_Out242326897 ~y$w_buff1_used~0_In242326897))) (or (and (or (and .cse2 (= ~y~0_Out242326897 ~y~0_In242326897)) (and .cse0 (= ~y$w_buff1~0_In242326897 ~y~0_Out242326897) .cse1)) .cse3) (and .cse4 (= ~y$w_buff0~0_In242326897 ~y~0_Out242326897) .cse5)) (= ~y$r_buff1_thd0~0_Out242326897 ~y$r_buff1_thd0~0_In242326897) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In242326897| ULTIMATE.start_assume_abort_if_not_~cond_Out242326897) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out242326897 0)) (or (and (= ~y$w_buff0_used~0_In242326897 ~y$w_buff0_used~0_Out242326897) .cse3) (and .cse4 .cse5 (= 0 ~y$w_buff0_used~0_Out242326897))) (= ~y$r_buff0_thd0~0_In242326897 ~y$r_buff0_thd0~0_Out242326897)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In242326897|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In242326897, ~y$w_buff1~0=~y$w_buff1~0_In242326897, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In242326897, ~y$w_buff0~0=~y$w_buff0~0_In242326897, ~y~0=~y~0_In242326897, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In242326897, ~y$w_buff1_used~0=~y$w_buff1_used~0_In242326897} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out242326897, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out242326897|, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out242326897|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out242326897|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out242326897|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out242326897|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out242326897|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In242326897|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out242326897, ~y$w_buff1~0=~y$w_buff1~0_In242326897, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out242326897, ~y$w_buff0~0=~y$w_buff0~0_In242326897, ~y~0=~y~0_Out242326897, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out242326897, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out242326897} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite19, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite20, ~y~0, ULTIMATE.start_main_#t~ite21, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23, ~y$w_buff1_used~0] because there is no mapped edge [2020-11-28 03:11:53,357 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,357 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [733] [2020-11-28 03:11:53,359 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,359 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,359 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,360 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,360 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,360 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,360 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,360 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,361 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,361 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,361 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,362 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,362 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,362 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,362 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,363 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,363 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,363 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,363 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,363 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,364 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,364 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,364 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,365 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,365 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,365 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,365 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,366 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,366 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,366 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,366 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,366 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,367 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,367 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,367 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,367 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,367 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,368 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,368 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,368 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,368 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,368 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,369 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,369 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,369 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,369 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:11:53 BasicIcfg [2020-11-28 03:11:53,419 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-28 03:11:53,419 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 03:11:53,420 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 03:11:53,420 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 03:11:53,420 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:11:32" (3/4) ... [2020-11-28 03:11:53,423 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-28 03:11:53,428 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [911] [911] L797-->L804: Formula: (let ((.cse6 (= (mod ~y$w_buff0_used~0_In242326897 256) 0)) (.cse7 (= (mod ~y$r_buff0_thd0~0_In242326897 256) 0)) (.cse9 (= (mod ~y$r_buff1_thd0~0_In242326897 256) 0)) (.cse8 (= (mod ~y$w_buff1_used~0_In242326897 256) 0))) (let ((.cse2 (or .cse9 .cse8)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse3 (or .cse6 .cse7)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (or (and .cse0 (= ~y$w_buff1_used~0_Out242326897 0) .cse1) (and .cse2 (= ~y$w_buff1_used~0_Out242326897 ~y$w_buff1_used~0_In242326897))) (or (and (or (and .cse2 (= ~y~0_Out242326897 ~y~0_In242326897)) (and .cse0 (= ~y$w_buff1~0_In242326897 ~y~0_Out242326897) .cse1)) .cse3) (and .cse4 (= ~y$w_buff0~0_In242326897 ~y~0_Out242326897) .cse5)) (= ~y$r_buff1_thd0~0_Out242326897 ~y$r_buff1_thd0~0_In242326897) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In242326897| ULTIMATE.start_assume_abort_if_not_~cond_Out242326897) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out242326897 0)) (or (and (= ~y$w_buff0_used~0_In242326897 ~y$w_buff0_used~0_Out242326897) .cse3) (and .cse4 .cse5 (= 0 ~y$w_buff0_used~0_Out242326897))) (= ~y$r_buff0_thd0~0_In242326897 ~y$r_buff0_thd0~0_Out242326897)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In242326897|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In242326897, ~y$w_buff1~0=~y$w_buff1~0_In242326897, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In242326897, ~y$w_buff0~0=~y$w_buff0~0_In242326897, ~y~0=~y~0_In242326897, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In242326897, ~y$w_buff1_used~0=~y$w_buff1_used~0_In242326897} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out242326897, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out242326897|, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out242326897|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out242326897|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out242326897|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out242326897|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out242326897|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In242326897|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out242326897, ~y$w_buff1~0=~y$w_buff1~0_In242326897, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out242326897, ~y$w_buff0~0=~y$w_buff0~0_In242326897, ~y~0=~y~0_Out242326897, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out242326897, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out242326897} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite19, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite20, ~y~0, ULTIMATE.start_main_#t~ite21, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23, ~y$w_buff1_used~0] because there is no mapped edge [2020-11-28 03:11:53,430 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,430 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [733] [2020-11-28 03:11:53,431 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,432 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,433 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,433 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,433 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,434 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,434 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,434 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,434 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,434 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,435 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,436 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,436 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,436 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,436 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,437 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,437 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,437 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,437 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,437 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,437 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,437 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,438 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,438 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,438 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,438 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,439 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,439 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,439 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,439 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,439 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,439 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,440 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,440 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,440 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,440 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,440 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,440 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,441 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,441 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,441 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,441 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,441 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,441 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,442 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:11:53,442 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:11:53,549 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7325dc0f-6f8d-4013-856f-61a9a5308ebf/bin/uautomizer/witness.graphml [2020-11-28 03:11:53,565 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 03:11:53,567 INFO L168 Benchmark]: Toolchain (without parser) took 25328.04 ms. Allocated memory was 104.9 MB in the beginning and 272.6 MB in the end (delta: 167.8 MB). Free memory was 68.3 MB in the beginning and 240.0 MB in the end (delta: -171.7 MB). Peak memory consumption was 154.6 MB. Max. memory is 16.1 GB. [2020-11-28 03:11:53,568 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 104.9 MB. Free memory was 76.7 MB in the beginning and 76.7 MB in the end (delta: 26.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:11:53,568 INFO L168 Benchmark]: CACSL2BoogieTranslator took 766.49 ms. Allocated memory is still 104.9 MB. Free memory was 68.1 MB in the beginning and 56.8 MB in the end (delta: 11.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-28 03:11:53,569 INFO L168 Benchmark]: Boogie Procedure Inliner took 127.80 ms. Allocated memory is still 104.9 MB. Free memory was 56.8 MB in the beginning and 53.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:11:53,569 INFO L168 Benchmark]: Boogie Preprocessor took 79.03 ms. Allocated memory is still 104.9 MB. Free memory was 53.9 MB in the beginning and 51.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:11:53,570 INFO L168 Benchmark]: RCFGBuilder took 2958.03 ms. Allocated memory was 104.9 MB in the beginning and 127.9 MB in the end (delta: 23.1 MB). Free memory was 51.8 MB in the beginning and 47.5 MB in the end (delta: 4.3 MB). Peak memory consumption was 46.6 MB. Max. memory is 16.1 GB. [2020-11-28 03:11:53,571 INFO L168 Benchmark]: TraceAbstraction took 21223.91 ms. Allocated memory was 127.9 MB in the beginning and 272.6 MB in the end (delta: 144.7 MB). Free memory was 47.5 MB in the beginning and 92.0 MB in the end (delta: -44.6 MB). Peak memory consumption was 101.2 MB. Max. memory is 16.1 GB. [2020-11-28 03:11:53,571 INFO L168 Benchmark]: Witness Printer took 146.17 ms. Allocated memory is still 272.6 MB. Free memory was 92.0 MB in the beginning and 240.0 MB in the end (delta: -148.0 MB). Peak memory consumption was 11.4 MB. Max. memory is 16.1 GB. [2020-11-28 03:11:53,574 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.36 ms. Allocated memory is still 104.9 MB. Free memory was 76.7 MB in the beginning and 76.7 MB in the end (delta: 26.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 766.49 ms. Allocated memory is still 104.9 MB. Free memory was 68.1 MB in the beginning and 56.8 MB in the end (delta: 11.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 127.80 ms. Allocated memory is still 104.9 MB. Free memory was 56.8 MB in the beginning and 53.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 79.03 ms. Allocated memory is still 104.9 MB. Free memory was 53.9 MB in the beginning and 51.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2958.03 ms. Allocated memory was 104.9 MB in the beginning and 127.9 MB in the end (delta: 23.1 MB). Free memory was 51.8 MB in the beginning and 47.5 MB in the end (delta: 4.3 MB). Peak memory consumption was 46.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 21223.91 ms. Allocated memory was 127.9 MB in the beginning and 272.6 MB in the end (delta: 144.7 MB). Free memory was 47.5 MB in the beginning and 92.0 MB in the end (delta: -44.6 MB). Peak memory consumption was 101.2 MB. Max. memory is 16.1 GB. * Witness Printer took 146.17 ms. Allocated memory is still 272.6 MB. Free memory was 92.0 MB in the beginning and 240.0 MB in the end (delta: -148.0 MB). Peak memory consumption was 11.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 724 VarBasedMoverChecksPositive, 57 VarBasedMoverChecksNegative, 13 SemBasedMoverChecksPositive, 44 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.5s, 59 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 17.1s, 87 PlacesBefore, 26 PlacesAfterwards, 83 TransitionsBefore, 19 TransitionsAfterwards, 1046 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 3 ChoiceCompositions, 83 TotalNumberOfCompositions, 2642 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L714] 0 int y = 0; [L715] 0 _Bool y$flush_delayed; [L716] 0 int y$mem_tmp; [L717] 0 _Bool y$r_buff0_thd0; [L718] 0 _Bool y$r_buff0_thd1; [L719] 0 _Bool y$r_buff0_thd2; [L720] 0 _Bool y$r_buff1_thd0; [L721] 0 _Bool y$r_buff1_thd1; [L722] 0 _Bool y$r_buff1_thd2; [L723] 0 _Bool y$read_delayed; [L724] 0 int *y$read_delayed_var; [L725] 0 int y$w_buff0; [L726] 0 _Bool y$w_buff0_used; [L727] 0 int y$w_buff1; [L728] 0 _Bool y$w_buff1_used; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2477; [L791] FCALL, FORK 0 pthread_create(&t2477, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L792] 0 pthread_t t2478; [L734] 1 y$w_buff1 = y$w_buff0 [L735] 1 y$w_buff0 = 2 [L736] 1 y$w_buff1_used = y$w_buff0_used [L737] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=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] [L793] FCALL, FORK 0 pthread_create(&t2478, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L745] 1 x = 1 VAL [__unbuffered_cnt=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] [L762] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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] [L748] 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) [L748] 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) [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] 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 [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L752] 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 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L768] 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) [L768] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L768] 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) [L768] 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) [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] 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 [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L772] 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 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 y$flush_delayed = weak$$choice2 [L809] 0 y$mem_tmp = y [L810] 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) [L810] 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) [L811] 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)) [L811] 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)) [L812] 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)) [L812] 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)) [L813] 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)) [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_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L813] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [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_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L813] 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)) [L813] 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)) [L814] 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)) [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_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L814] 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)) [L814] 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)) [L815] 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)) [L815] 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) [L815] 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)) [L815] 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)) [L816] 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)) [L816] 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)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L818] 0 y = y$flush_delayed ? y$mem_tmp : y [L819] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe029_pso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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, 81 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 20.9s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 17.2s, HoareTripleCheckerStatistics: 162 SDtfs, 118 SDslu, 201 SDs, 0 SdLazy, 192 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164occurred 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.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 25 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 114 NumberOfCodeBlocks, 114 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 88 ConstructedInterpolants, 0 QuantifiedInterpolants, 6367 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...