./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem10_label13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label13.c -s /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e2bc1e4005bcecf5516ad11dc2c84ed2ceb2f363 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label13.c -s /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e2bc1e4005bcecf5516ad11dc2c84ed2ceb2f363 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 17:57:27,436 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 17:57:27,437 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 17:57:27,468 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 17:57:27,469 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 17:57:27,470 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 17:57:27,472 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 17:57:27,474 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 17:57:27,476 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 17:57:27,477 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 17:57:27,478 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 17:57:27,479 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 17:57:27,480 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 17:57:27,481 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 17:57:27,482 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 17:57:27,483 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 17:57:27,484 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 17:57:27,485 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 17:57:27,487 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 17:57:27,489 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 17:57:27,491 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 17:57:27,492 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 17:57:27,494 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 17:57:27,495 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 17:57:27,498 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 17:57:27,498 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 17:57:27,498 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 17:57:27,499 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 17:57:27,500 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 17:57:27,501 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 17:57:27,501 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 17:57:27,502 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 17:57:27,503 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 17:57:27,504 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 17:57:27,506 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 17:57:27,506 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 17:57:27,507 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 17:57:27,507 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 17:57:27,507 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 17:57:27,508 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 17:57:27,509 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 17:57:27,509 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 17:57:27,525 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 17:57:27,525 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 17:57:27,526 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 17:57:27,526 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 17:57:27,526 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 17:57:27,526 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 17:57:27,526 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 17:57:27,527 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 17:57:27,527 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 17:57:27,527 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 17:57:27,527 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 17:57:27,527 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 17:57:27,527 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 17:57:27,527 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 17:57:27,527 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 17:57:27,528 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 17:57:27,528 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 17:57:27,528 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 17:57:27,528 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 17:57:27,528 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 17:57:27,528 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 17:57:27,528 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 17:57:27,528 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 17:57:27,529 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 17:57:27,529 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 17:57:27,529 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 17:57:27,529 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 17:57:27,529 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 17:57:27,529 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 17:57:27,529 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 17:57:27,529 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 17:57:27,529 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 17:57:27,530 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 17:57:27,530 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 17:57:27,530 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 17:57:27,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 17:57:27,530 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 17:57:27,530 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 17:57:27,530 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 17:57:27,530 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan/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_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan 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 -> Taipan 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 -> e2bc1e4005bcecf5516ad11dc2c84ed2ceb2f363 [2020-12-09 17:57:27,709 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 17:57:27,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 17:57:27,731 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 17:57:27,732 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 17:57:27,733 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 17:57:27,734 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem10_label13.c [2020-12-09 17:57:27,775 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan/data/1acef7e17/f6294c2b41ff46de81f1813a8a6caf2d/FLAG15e0a4b5b [2020-12-09 17:57:28,217 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 17:57:28,217 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/sv-benchmarks/c/eca-rers2012/Problem10_label13.c [2020-12-09 17:57:28,229 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan/data/1acef7e17/f6294c2b41ff46de81f1813a8a6caf2d/FLAG15e0a4b5b [2020-12-09 17:57:28,242 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan/data/1acef7e17/f6294c2b41ff46de81f1813a8a6caf2d [2020-12-09 17:57:28,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 17:57:28,245 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 17:57:28,247 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 17:57:28,247 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 17:57:28,253 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 17:57:28,254 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:57:28" (1/1) ... [2020-12-09 17:57:28,255 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e9564ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:57:28, skipping insertion in model container [2020-12-09 17:57:28,255 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:57:28" (1/1) ... [2020-12-09 17:57:28,261 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 17:57:28,301 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 17:57:28,435 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/sv-benchmarks/c/eca-rers2012/Problem10_label13.c[6334,6347] [2020-12-09 17:57:28,517 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 17:57:28,523 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 17:57:28,544 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/sv-benchmarks/c/eca-rers2012/Problem10_label13.c[6334,6347] [2020-12-09 17:57:28,588 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 17:57:28,599 INFO L208 MainTranslator]: Completed translation [2020-12-09 17:57:28,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:57:28 WrapperNode [2020-12-09 17:57:28,600 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 17:57:28,600 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 17:57:28,600 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 17:57:28,601 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 17:57:28,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:57:28" (1/1) ... [2020-12-09 17:57:28,621 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:57:28" (1/1) ... [2020-12-09 17:57:28,658 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 17:57:28,658 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 17:57:28,658 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 17:57:28,658 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 17:57:28,664 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:57:28" (1/1) ... [2020-12-09 17:57:28,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:57:28" (1/1) ... [2020-12-09 17:57:28,669 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:57:28" (1/1) ... [2020-12-09 17:57:28,669 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:57:28" (1/1) ... [2020-12-09 17:57:28,688 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:57:28" (1/1) ... [2020-12-09 17:57:28,695 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:57:28" (1/1) ... [2020-12-09 17:57:28,702 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:57:28" (1/1) ... [2020-12-09 17:57:28,708 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 17:57:28,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 17:57:28,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 17:57:28,709 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 17:57:28,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:57:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan/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-12-09 17:57:28,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 17:57:28,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 17:57:28,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 17:57:28,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 17:57:34,705 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 17:57:34,705 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-09 17:57:34,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:57:34 BoogieIcfgContainer [2020-12-09 17:57:34,707 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 17:57:34,708 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 17:57:34,708 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 17:57:34,710 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 17:57:34,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:57:28" (1/3) ... [2020-12-09 17:57:34,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33bc7a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:57:34, skipping insertion in model container [2020-12-09 17:57:34,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:57:28" (2/3) ... [2020-12-09 17:57:34,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33bc7a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:57:34, skipping insertion in model container [2020-12-09 17:57:34,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:57:34" (3/3) ... [2020-12-09 17:57:34,712 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label13.c [2020-12-09 17:57:34,722 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 17:57:34,725 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 17:57:34,731 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 17:57:34,747 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 17:57:34,747 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 17:57:34,747 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 17:57:34,747 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 17:57:34,747 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 17:57:34,747 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 17:57:34,747 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 17:57:34,747 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 17:57:34,755 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2020-12-09 17:57:34,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-09 17:57:34,758 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:57:34,758 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-09 17:57:34,759 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:57:34,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:57:34,762 INFO L82 PathProgramCache]: Analyzing trace with hash 856693721, now seen corresponding path program 1 times [2020-12-09 17:57:34,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:57:34,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336419646] [2020-12-09 17:57:34,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:57:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:57:34,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:57:34,912 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336419646] [2020-12-09 17:57:34,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:57:34,913 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 17:57:34,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092987371] [2020-12-09 17:57:34,916 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:57:34,917 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:57:34,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:57:34,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:57:34,929 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2020-12-09 17:57:34,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:57:34,989 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2020-12-09 17:57:34,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:57:34,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-12-09 17:57:34,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:57:34,999 INFO L225 Difference]: With dead ends: 23 [2020-12-09 17:57:34,999 INFO L226 Difference]: Without dead ends: 11 [2020-12-09 17:57:35,002 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-12-09 17:57:35,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-12-09 17:57:35,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2020-12-09 17:57:35,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-12-09 17:57:35,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2020-12-09 17:57:35,030 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 5 [2020-12-09 17:57:35,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:57:35,030 INFO L481 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2020-12-09 17:57:35,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:57:35,031 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2020-12-09 17:57:35,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 17:57:35,031 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:57:35,031 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2020-12-09 17:57:35,031 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 17:57:35,032 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:57:35,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:57:35,032 INFO L82 PathProgramCache]: Analyzing trace with hash -396514605, now seen corresponding path program 1 times [2020-12-09 17:57:35,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:57:35,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827206454] [2020-12-09 17:57:35,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:57:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:57:35,284 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:57:35,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827206454] [2020-12-09 17:57:35,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294252582] [2020-12-09 17:57:35,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 17:57:35,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:57:35,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 20 conjunts are in the unsatisfiable core [2020-12-09 17:57:35,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 17:57:35,564 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 1002 DAG size of output: 127 [2020-12-09 17:57:35,597 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 3, 2, 3, 2, 3, 2, 3, 2, 3, 1] term [2020-12-09 17:57:35,597 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 17:57:35,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:57:35,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 17:57:35,862 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 1666 DAG size of output: 1031 [2020-12-09 17:57:35,926 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 9, 7, 7, 5, 9, 7, 8, 6, 8, 6, 7, 5, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:35,927 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:35,935 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 9, 7, 7, 5, 9, 7, 8, 6, 8, 6, 7, 5, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:35,935 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:35,942 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 9, 7, 7, 5, 9, 7, 8, 6, 8, 6, 7, 5, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:35,942 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:35,943 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 17:57:35,943 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:35,951 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 7, 5, 9, 7, 8, 6, 8, 6, 7, 5, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:35,951 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:35,957 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 5, 9, 7, 8, 6, 8, 6, 7, 5, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:35,957 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:35,958 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 2, 1] term [2020-12-09 17:57:35,958 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:35,959 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 17:57:35,959 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:35,961 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 17:57:35,961 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:35,967 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 8, 6, 8, 6, 7, 5, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:35,968 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:35,969 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 17:57:35,969 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:35,975 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 7, 5, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:35,975 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:35,981 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 7, 5, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:35,981 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:35,985 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 5, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:35,985 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:35,988 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:35,989 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:35,991 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:35,992 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:35,994 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:35,994 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:35,997 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:35,997 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:35,999 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:35,999 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,002 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,002 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,004 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,004 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,006 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,007 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,008 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,009 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,011 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,011 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,013 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 9, 7, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,013 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,014 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 17:57:36,014 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,017 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 9, 7, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,017 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,018 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 17:57:36,018 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,020 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,020 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,022 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,022 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,024 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,024 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,026 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,027 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,027 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 17:57:36,027 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,030 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,030 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,032 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 7, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,032 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,034 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,034 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,036 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,036 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,037 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,038 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,039 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,039 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,041 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,041 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,042 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,043 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,044 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,044 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,045 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,045 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,046 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,046 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,047 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,047 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,048 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 17:57:36,048 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,049 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,050 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,051 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,051 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,051 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 17:57:36,051 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,053 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,053 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,054 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 17:57:36,054 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,056 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 17:57:36,056 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,057 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 17:57:36,057 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,057 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 17:57:36,058 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,059 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 17:57:36,059 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,059 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 17:57:36,059 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,060 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 3, 2, 1] term [2020-12-09 17:57:36,061 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,061 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 2, 1] term [2020-12-09 17:57:36,061 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,062 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 17:57:36,062 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,063 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 17:57:36,063 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,063 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 2, 1] term [2020-12-09 17:57:36,064 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,064 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 17:57:36,064 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,065 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 17:57:36,065 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,065 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 17:57:36,066 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,067 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 17:57:36,067 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,068 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 17:57:36,068 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,069 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 17:57:36,070 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,071 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 17:57:36,071 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,072 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 17:57:36,072 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,074 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 17:57:36,074 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,076 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 17:57:36,077 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,077 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 17:57:36,077 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,078 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 17:57:36,078 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,080 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 17:57:36,081 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,081 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 17:57:36,082 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,084 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 17:57:36,084 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,087 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 17:57:36,087 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,089 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 17:57:36,089 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,090 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 17:57:36,090 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,091 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 17:57:36,092 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,092 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 17:57:36,093 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,094 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 2, 2, 2, 3, 2, 1] term [2020-12-09 17:57:36,094 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,095 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 3, 2, 1] term [2020-12-09 17:57:36,095 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,096 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 2, 1] term [2020-12-09 17:57:36,096 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,097 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 17:57:36,097 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,098 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 17:57:36,098 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,099 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 2, 1] term [2020-12-09 17:57:36,099 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,100 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 17:57:36,100 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,101 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 17:57:36,101 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,102 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 3, 2, 1] term [2020-12-09 17:57:36,102 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,103 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 2, 1] term [2020-12-09 17:57:36,103 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,104 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 17:57:36,104 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,105 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 17:57:36,105 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,106 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 2, 1] term [2020-12-09 17:57:36,106 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,106 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 17:57:36,107 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,107 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 17:57:36,108 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,109 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 17:57:36,109 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,110 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 17:57:36,110 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,110 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 17:57:36,111 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,111 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 17:57:36,111 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,112 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 17:57:36,112 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,113 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 17:57:36,113 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,113 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 17:57:36,113 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,115 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 9, 7, 7, 5, 9, 7, 8, 6, 7, 6, 7, 5, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,116 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,118 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 9, 7, 7, 5, 9, 7, 8, 6, 7, 6, 7, 5, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,118 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,120 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 9, 7, 7, 5, 9, 7, 8, 6, 7, 6, 7, 5, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,120 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,122 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 7, 5, 9, 7, 8, 6, 7, 6, 7, 5, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,122 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,124 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 5, 9, 7, 8, 6, 7, 6, 7, 5, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,124 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,126 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 8, 6, 7, 6, 7, 5, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,126 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,128 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 7, 6, 7, 5, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,128 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,130 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 6, 7, 5, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,130 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,132 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 5, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,132 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,134 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,134 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,136 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,136 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,137 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,137 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,139 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,139 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,141 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,141 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,142 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,142 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,144 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,144 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,145 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,145 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,146 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,147 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,159 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 9, 7, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,160 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,161 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 9, 7, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,162 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,163 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,163 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,165 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,165 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,166 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 5, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,166 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,168 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,169 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,170 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 6, 9, 7, 7, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,170 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,171 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 7, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,172 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,173 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,173 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,174 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,174 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,176 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,176 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,177 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,177 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,178 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,178 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,179 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,179 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,181 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,181 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,182 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,182 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,182 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,183 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,183 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,183 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,184 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,184 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,185 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,185 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:36,186 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 8, 7, 2, 1] term [2020-12-09 17:57:36,186 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 17:57:38,053 WARN L197 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 442 DAG size of output: 115 [2020-12-09 17:57:38,822 WARN L197 SmtUtils]: Spent 706.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 104 [2020-12-09 17:57:38,832 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 5, 5, 5, 6, 6, 5, 5, 5, 5, 7, 5, 6, 5, 1] term [2020-12-09 17:57:38,832 INFO L639 QuantifierPusher]: Distributing 5 disjuncts over 3 conjuncts [2020-12-09 17:57:39,150 WARN L197 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 54 [2020-12-09 17:57:39,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:57:39,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1691863350] [2020-12-09 17:57:39,166 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2020-12-09 17:57:39,166 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 17:57:39,169 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 17:57:39,173 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 17:57:39,173 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 17:57:39,293 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 50 [2020-12-09 17:57:39,973 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 50 [2020-12-09 17:57:40,979 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 1668 DAG size of output: 1583 [2020-12-09 18:06:34,116 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-12-09 18:06:34,118 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: variable got div captured at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:426) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer$IDerHelper.findBestReplacementSbr(DualJunctionDer.java:305) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer$IDerHelper.tryToEliminateSbr(DualJunctionDer.java:319) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer.tryToEliminateOne(DualJunctionDer.java:223) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer.tryExhaustivelyToEliminate(DualJunctionDer.java:190) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer.tryToEliminateOne(DualJunctionDer.java:174) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer.tryExhaustivelyToEliminate(DualJunctionDer.java:141) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer.tryToEliminate(DualJunctionDer.java:119) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:776) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:739) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:656) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:358) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.doit(QuantifierPusher.java:523) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:378) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.eliminate(QuantifierPusher.java:151) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.eliminate(QuantifierPusher.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elimPushPull(PartialQuantifierElimination.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elimPushPull(PartialQuantifierElimination.java:202) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.quantifier(PartialQuantifierElimination.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:279) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpretForSingleMarker(DagInterpreter.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarizeInternal(FixpointLoopSummarizer.java:118) at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1133) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 18:06:34,128 INFO L168 Benchmark]: Toolchain (without parser) took 545880.02 ms. Allocated memory was 81.8 MB in the beginning and 704.6 MB in the end (delta: 622.9 MB). Free memory was 59.2 MB in the beginning and 386.7 MB in the end (delta: -327.5 MB). Peak memory consumption was 480.7 MB. Max. memory is 16.1 GB. [2020-12-09 18:06:34,129 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 81.8 MB. Free memory is still 57.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 18:06:34,132 INFO L168 Benchmark]: CACSL2BoogieTranslator took 353.17 ms. Allocated memory is still 81.8 MB. Free memory was 59.0 MB in the beginning and 57.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 27.0 MB. Max. memory is 16.1 GB. [2020-12-09 18:06:34,134 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.33 ms. Allocated memory is still 81.8 MB. Free memory was 57.5 MB in the beginning and 49.5 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-12-09 18:06:34,136 INFO L168 Benchmark]: Boogie Preprocessor took 49.76 ms. Allocated memory is still 81.8 MB. Free memory was 49.5 MB in the beginning and 44.5 MB in the end (delta: 5.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-09 18:06:34,139 INFO L168 Benchmark]: RCFGBuilder took 5998.52 ms. Allocated memory was 81.8 MB in the beginning and 253.8 MB in the end (delta: 172.0 MB). Free memory was 44.5 MB in the beginning and 134.7 MB in the end (delta: -90.2 MB). Peak memory consumption was 139.8 MB. Max. memory is 16.1 GB. [2020-12-09 18:06:34,142 INFO L168 Benchmark]: TraceAbstraction took 539416.93 ms. Allocated memory was 253.8 MB in the beginning and 704.6 MB in the end (delta: 450.9 MB). Free memory was 133.6 MB in the beginning and 386.7 MB in the end (delta: -253.0 MB). Peak memory consumption was 383.5 MB. Max. memory is 16.1 GB. [2020-12-09 18:06:34,151 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.16 ms. Allocated memory is still 81.8 MB. Free memory is still 57.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 353.17 ms. Allocated memory is still 81.8 MB. Free memory was 59.0 MB in the beginning and 57.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 27.0 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 57.33 ms. Allocated memory is still 81.8 MB. Free memory was 57.5 MB in the beginning and 49.5 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 49.76 ms. Allocated memory is still 81.8 MB. Free memory was 49.5 MB in the beginning and 44.5 MB in the end (delta: 5.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 5998.52 ms. Allocated memory was 81.8 MB in the beginning and 253.8 MB in the end (delta: 172.0 MB). Free memory was 44.5 MB in the beginning and 134.7 MB in the end (delta: -90.2 MB). Peak memory consumption was 139.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 539416.93 ms. Allocated memory was 253.8 MB in the beginning and 704.6 MB in the end (delta: 450.9 MB). Free memory was 133.6 MB in the beginning and 386.7 MB in the end (delta: -253.0 MB). Peak memory consumption was 383.5 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: variable got div captured de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: variable got div captured: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:426) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-7b2dab5 [2020-12-09 18:06:35,659 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 18:06:35,660 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 18:06:35,685 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 18:06:35,685 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 18:06:35,686 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 18:06:35,687 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 18:06:35,689 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 18:06:35,691 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 18:06:35,691 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 18:06:35,692 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 18:06:35,693 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 18:06:35,694 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 18:06:35,694 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 18:06:35,695 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 18:06:35,696 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 18:06:35,697 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 18:06:35,698 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 18:06:35,699 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 18:06:35,701 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 18:06:35,702 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 18:06:35,703 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 18:06:35,704 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 18:06:35,705 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 18:06:35,708 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 18:06:35,708 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 18:06:35,708 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 18:06:35,709 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 18:06:35,709 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 18:06:35,710 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 18:06:35,711 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 18:06:35,711 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 18:06:35,712 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 18:06:35,712 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 18:06:35,713 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 18:06:35,713 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 18:06:35,714 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 18:06:35,714 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 18:06:35,714 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 18:06:35,715 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 18:06:35,715 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 18:06:35,716 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2020-12-09 18:06:35,733 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 18:06:35,734 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 18:06:35,734 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 18:06:35,734 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 18:06:35,734 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 18:06:35,735 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 18:06:35,735 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 18:06:35,735 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 18:06:35,735 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 18:06:35,735 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 18:06:35,735 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 18:06:35,736 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 18:06:35,736 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 18:06:35,736 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 18:06:35,736 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 18:06:35,736 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 18:06:35,736 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 18:06:35,736 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-09 18:06:35,736 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-09 18:06:35,737 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 18:06:35,737 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 18:06:35,737 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 18:06:35,737 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 18:06:35,737 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 18:06:35,737 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-09 18:06:35,737 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 18:06:35,737 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 18:06:35,737 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 18:06:35,738 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 18:06:35,738 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 18:06:35,738 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-12-09 18:06:35,738 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2020-12-09 18:06:35,738 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 18:06:35,738 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 18:06:35,738 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 18:06:35,738 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan/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_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan 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 -> Taipan 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 -> e2bc1e4005bcecf5516ad11dc2c84ed2ceb2f363 [2020-12-09 18:06:35,967 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 18:06:35,983 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 18:06:35,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 18:06:35,985 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 18:06:35,986 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 18:06:35,987 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem10_label13.c [2020-12-09 18:06:36,030 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan/data/bc4e519ae/3e6a821ec9994ba6bc0359b19f81cb39/FLAG82e9a44f5 [2020-12-09 18:06:36,465 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 18:06:36,465 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/sv-benchmarks/c/eca-rers2012/Problem10_label13.c [2020-12-09 18:06:36,476 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan/data/bc4e519ae/3e6a821ec9994ba6bc0359b19f81cb39/FLAG82e9a44f5 [2020-12-09 18:06:36,486 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan/data/bc4e519ae/3e6a821ec9994ba6bc0359b19f81cb39 [2020-12-09 18:06:36,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 18:06:36,489 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 18:06:36,489 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 18:06:36,490 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 18:06:36,492 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 18:06:36,492 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:06:36" (1/1) ... [2020-12-09 18:06:36,494 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ffa1768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:06:36, skipping insertion in model container [2020-12-09 18:06:36,494 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:06:36" (1/1) ... [2020-12-09 18:06:36,499 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 18:06:36,533 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 18:06:36,674 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/sv-benchmarks/c/eca-rers2012/Problem10_label13.c[6334,6347] [2020-12-09 18:06:36,778 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 18:06:36,798 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 18:06:36,822 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/sv-benchmarks/c/eca-rers2012/Problem10_label13.c[6334,6347] [2020-12-09 18:06:36,875 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 18:06:36,886 INFO L208 MainTranslator]: Completed translation [2020-12-09 18:06:36,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:06:36 WrapperNode [2020-12-09 18:06:36,886 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 18:06:36,887 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 18:06:36,887 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 18:06:36,887 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 18:06:36,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:06:36" (1/1) ... [2020-12-09 18:06:36,908 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:06:36" (1/1) ... [2020-12-09 18:06:36,940 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 18:06:36,940 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 18:06:36,941 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 18:06:36,941 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 18:06:36,947 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:06:36" (1/1) ... [2020-12-09 18:06:36,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:06:36" (1/1) ... [2020-12-09 18:06:36,951 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:06:36" (1/1) ... [2020-12-09 18:06:36,951 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:06:36" (1/1) ... [2020-12-09 18:06:36,978 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:06:36" (1/1) ... [2020-12-09 18:06:36,987 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:06:36" (1/1) ... [2020-12-09 18:06:36,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:06:36" (1/1) ... [2020-12-09 18:06:36,999 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 18:06:37,000 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 18:06:37,000 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 18:06:37,000 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 18:06:37,001 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:06:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan/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-12-09 18:06:37,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-12-09 18:06:37,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 18:06:37,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 18:06:37,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 18:06:39,074 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 18:06:39,074 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-09 18:06:39,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:06:39 BoogieIcfgContainer [2020-12-09 18:06:39,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 18:06:39,077 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 18:06:39,077 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 18:06:39,079 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 18:06:39,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 06:06:36" (1/3) ... [2020-12-09 18:06:39,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54ab17ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:06:39, skipping insertion in model container [2020-12-09 18:06:39,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:06:36" (2/3) ... [2020-12-09 18:06:39,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54ab17ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:06:39, skipping insertion in model container [2020-12-09 18:06:39,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:06:39" (3/3) ... [2020-12-09 18:06:39,081 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label13.c [2020-12-09 18:06:39,090 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 18:06:39,093 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 18:06:39,100 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 18:06:39,118 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 18:06:39,118 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 18:06:39,118 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 18:06:39,118 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 18:06:39,118 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 18:06:39,118 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 18:06:39,118 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 18:06:39,119 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 18:06:39,131 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states. [2020-12-09 18:06:39,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-12-09 18:06:39,136 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:06:39,137 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:06:39,137 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:06:39,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:06:39,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1246856209, now seen corresponding path program 1 times [2020-12-09 18:06:39,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 18:06:39,152 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1051340452] [2020-12-09 18:06:39,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-12-09 18:06:39,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:06:39,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 18:06:39,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:06:39,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:06:39,287 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 18:06:39,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1051340452] [2020-12-09 18:06:39,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:06:39,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 18:06:39,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267325967] [2020-12-09 18:06:39,294 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 18:06:39,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 18:06:39,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 18:06:39,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 18:06:39,308 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 3 states. [2020-12-09 18:06:42,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:06:42,051 INFO L93 Difference]: Finished difference Result 552 states and 966 transitions. [2020-12-09 18:06:42,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 18:06:42,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2020-12-09 18:06:42,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:06:42,064 INFO L225 Difference]: With dead ends: 552 [2020-12-09 18:06:42,065 INFO L226 Difference]: Without dead ends: 282 [2020-12-09 18:06:42,068 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 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-12-09 18:06:42,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-12-09 18:06:42,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2020-12-09 18:06:42,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-12-09 18:06:42,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 407 transitions. [2020-12-09 18:06:42,113 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 407 transitions. Word has length 55 [2020-12-09 18:06:42,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:06:42,113 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 407 transitions. [2020-12-09 18:06:42,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 18:06:42,114 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 407 transitions. [2020-12-09 18:06:42,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-12-09 18:06:42,118 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:06:42,118 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:06:42,319 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-09 18:06:42,320 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:06:42,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:06:42,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1729755479, now seen corresponding path program 1 times [2020-12-09 18:06:42,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 18:06:42,329 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [693673238] [2020-12-09 18:06:42,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-12-09 18:06:42,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:06:42,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 18:06:42,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:06:42,512 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:06:42,512 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 18:06:42,513 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [693673238] [2020-12-09 18:06:42,513 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:06:42,513 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 18:06:42,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717191241] [2020-12-09 18:06:42,514 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 18:06:42,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 18:06:42,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 18:06:42,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 18:06:42,516 INFO L87 Difference]: Start difference. First operand 282 states and 407 transitions. Second operand 3 states. [2020-12-09 18:06:45,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:06:45,051 INFO L93 Difference]: Finished difference Result 840 states and 1216 transitions. [2020-12-09 18:06:45,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 18:06:45,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2020-12-09 18:06:45,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:06:45,055 INFO L225 Difference]: With dead ends: 840 [2020-12-09 18:06:45,055 INFO L226 Difference]: Without dead ends: 560 [2020-12-09 18:06:45,056 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 121 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-12-09 18:06:45,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-12-09 18:06:45,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2020-12-09 18:06:45,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2020-12-09 18:06:45,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 715 transitions. [2020-12-09 18:06:45,076 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 715 transitions. Word has length 123 [2020-12-09 18:06:45,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:06:45,077 INFO L481 AbstractCegarLoop]: Abstraction has 560 states and 715 transitions. [2020-12-09 18:06:45,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 18:06:45,077 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 715 transitions. [2020-12-09 18:06:45,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2020-12-09 18:06:45,079 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:06:45,079 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:06:45,280 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-09 18:06:45,281 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:06:45,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:06:45,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1762411064, now seen corresponding path program 1 times [2020-12-09 18:06:45,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 18:06:45,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [114571694] [2020-12-09 18:06:45,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-12-09 18:06:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:06:45,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 18:06:45,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:06:45,571 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 34 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:06:45,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:06:45,820 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:06:45,821 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [114571694] [2020-12-09 18:06:45,821 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-09 18:06:45,821 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2020-12-09 18:06:45,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342909566] [2020-12-09 18:06:45,821 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 18:06:45,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 18:06:45,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 18:06:45,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-09 18:06:45,822 INFO L87 Difference]: Start difference. First operand 560 states and 715 transitions. Second operand 4 states. [2020-12-09 18:07:13,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:07:13,185 INFO L93 Difference]: Finished difference Result 1554 states and 2000 transitions. [2020-12-09 18:07:13,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 18:07:13,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2020-12-09 18:07:13,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:07:13,192 INFO L225 Difference]: With dead ends: 1554 [2020-12-09 18:07:13,192 INFO L226 Difference]: Without dead ends: 977 [2020-12-09 18:07:13,193 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 254 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-12-09 18:07:13,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2020-12-09 18:07:13,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 560. [2020-12-09 18:07:13,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2020-12-09 18:07:13,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 711 transitions. [2020-12-09 18:07:13,209 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 711 transitions. Word has length 130 [2020-12-09 18:07:13,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:07:13,209 INFO L481 AbstractCegarLoop]: Abstraction has 560 states and 711 transitions. [2020-12-09 18:07:13,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 18:07:13,209 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 711 transitions. [2020-12-09 18:07:13,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2020-12-09 18:07:13,212 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:07:13,212 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:07:13,413 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-09 18:07:13,414 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:07:13,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:07:13,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1803492732, now seen corresponding path program 1 times [2020-12-09 18:07:13,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 18:07:13,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [820731044] [2020-12-09 18:07:13,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-12-09 18:07:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:07:13,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 18:07:13,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:07:13,669 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:07:13,669 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 18:07:13,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [820731044] [2020-12-09 18:07:13,669 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:07:13,669 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 18:07:13,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402997352] [2020-12-09 18:07:13,670 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 18:07:13,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 18:07:13,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 18:07:13,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 18:07:13,671 INFO L87 Difference]: Start difference. First operand 560 states and 711 transitions. Second operand 3 states. [2020-12-09 18:07:16,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:07:16,225 INFO L93 Difference]: Finished difference Result 1396 states and 1822 transitions. [2020-12-09 18:07:16,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 18:07:16,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2020-12-09 18:07:16,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:07:16,228 INFO L225 Difference]: With dead ends: 1396 [2020-12-09 18:07:16,228 INFO L226 Difference]: Without dead ends: 838 [2020-12-09 18:07:16,229 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 187 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-12-09 18:07:16,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2020-12-09 18:07:16,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 699. [2020-12-09 18:07:16,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2020-12-09 18:07:16,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 860 transitions. [2020-12-09 18:07:16,240 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 860 transitions. Word has length 189 [2020-12-09 18:07:16,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:07:16,240 INFO L481 AbstractCegarLoop]: Abstraction has 699 states and 860 transitions. [2020-12-09 18:07:16,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 18:07:16,241 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 860 transitions. [2020-12-09 18:07:16,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2020-12-09 18:07:16,242 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:07:16,242 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:07:16,443 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-12-09 18:07:16,444 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:07:16,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:07:16,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1349145835, now seen corresponding path program 1 times [2020-12-09 18:07:16,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 18:07:16,449 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [593192427] [2020-12-09 18:07:16,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-12-09 18:07:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:07:16,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 18:07:16,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:07:16,712 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2020-12-09 18:07:16,712 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 18:07:16,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [593192427] [2020-12-09 18:07:16,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:07:16,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 18:07:16,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488824292] [2020-12-09 18:07:16,713 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 18:07:16,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 18:07:16,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 18:07:16,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 18:07:16,713 INFO L87 Difference]: Start difference. First operand 699 states and 860 transitions. Second operand 3 states. [2020-12-09 18:07:18,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:07:18,702 INFO L93 Difference]: Finished difference Result 1535 states and 1866 transitions. [2020-12-09 18:07:18,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 18:07:18,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2020-12-09 18:07:18,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:07:18,706 INFO L225 Difference]: With dead ends: 1535 [2020-12-09 18:07:18,706 INFO L226 Difference]: Without dead ends: 838 [2020-12-09 18:07:18,707 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 194 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-12-09 18:07:18,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2020-12-09 18:07:18,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2020-12-09 18:07:18,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2020-12-09 18:07:18,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1003 transitions. [2020-12-09 18:07:18,719 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1003 transitions. Word has length 196 [2020-12-09 18:07:18,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:07:18,719 INFO L481 AbstractCegarLoop]: Abstraction has 838 states and 1003 transitions. [2020-12-09 18:07:18,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 18:07:18,720 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1003 transitions. [2020-12-09 18:07:18,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2020-12-09 18:07:18,722 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:07:18,722 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:07:18,922 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-12-09 18:07:18,923 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:07:18,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:07:18,923 INFO L82 PathProgramCache]: Analyzing trace with hash 69018730, now seen corresponding path program 1 times [2020-12-09 18:07:18,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 18:07:18,925 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2052530670] [2020-12-09 18:07:18,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-12-09 18:07:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:07:19,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 18:07:19,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:07:19,167 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2020-12-09 18:07:19,167 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 18:07:19,167 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2052530670] [2020-12-09 18:07:19,167 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:07:19,167 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 18:07:19,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363467523] [2020-12-09 18:07:19,168 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 18:07:19,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 18:07:19,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 18:07:19,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 18:07:19,169 INFO L87 Difference]: Start difference. First operand 838 states and 1003 transitions. Second operand 3 states. [2020-12-09 18:07:21,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:07:21,657 INFO L93 Difference]: Finished difference Result 1813 states and 2233 transitions. [2020-12-09 18:07:21,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 18:07:21,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2020-12-09 18:07:21,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:07:21,662 INFO L225 Difference]: With dead ends: 1813 [2020-12-09 18:07:21,662 INFO L226 Difference]: Without dead ends: 1116 [2020-12-09 18:07:21,662 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 232 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-12-09 18:07:21,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2020-12-09 18:07:21,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1116. [2020-12-09 18:07:21,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1116 states. [2020-12-09 18:07:21,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1316 transitions. [2020-12-09 18:07:21,677 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1316 transitions. Word has length 234 [2020-12-09 18:07:21,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:07:21,677 INFO L481 AbstractCegarLoop]: Abstraction has 1116 states and 1316 transitions. [2020-12-09 18:07:21,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 18:07:21,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1316 transitions. [2020-12-09 18:07:21,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2020-12-09 18:07:21,680 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:07:21,680 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:07:21,881 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-12-09 18:07:21,882 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:07:21,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:07:21,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1784057475, now seen corresponding path program 1 times [2020-12-09 18:07:21,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 18:07:21,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [968402544] [2020-12-09 18:07:21,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-12-09 18:07:22,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:07:22,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 18:07:22,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:07:22,192 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:07:22,192 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 18:07:22,192 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [968402544] [2020-12-09 18:07:22,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:07:22,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 18:07:22,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488840528] [2020-12-09 18:07:22,193 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 18:07:22,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 18:07:22,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 18:07:22,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 18:07:22,194 INFO L87 Difference]: Start difference. First operand 1116 states and 1316 transitions. Second operand 3 states. [2020-12-09 18:07:24,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:07:24,772 INFO L93 Difference]: Finished difference Result 2369 states and 2889 transitions. [2020-12-09 18:07:24,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 18:07:24,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2020-12-09 18:07:24,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:07:24,777 INFO L225 Difference]: With dead ends: 2369 [2020-12-09 18:07:24,777 INFO L226 Difference]: Without dead ends: 1394 [2020-12-09 18:07:24,778 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 242 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-12-09 18:07:24,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-12-09 18:07:24,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1394. [2020-12-09 18:07:24,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1394 states. [2020-12-09 18:07:24,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1639 transitions. [2020-12-09 18:07:24,795 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1639 transitions. Word has length 244 [2020-12-09 18:07:24,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:07:24,795 INFO L481 AbstractCegarLoop]: Abstraction has 1394 states and 1639 transitions. [2020-12-09 18:07:24,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 18:07:24,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1639 transitions. [2020-12-09 18:07:24,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2020-12-09 18:07:24,797 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:07:24,798 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:07:24,998 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-12-09 18:07:24,998 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:07:24,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:07:24,999 INFO L82 PathProgramCache]: Analyzing trace with hash 953764562, now seen corresponding path program 1 times [2020-12-09 18:07:25,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 18:07:25,000 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [231222404] [2020-12-09 18:07:25,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-12-09 18:07:25,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:07:25,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 18:07:25,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:07:25,561 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 74 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:07:25,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:07:26,703 WARN L197 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2020-12-09 18:07:27,119 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 74 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:07:27,119 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [231222404] [2020-12-09 18:07:27,119 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [140985979] [2020-12-09 18:07:27,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt [2020-12-09 18:07:27,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:07:27,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 18:07:27,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:07:27,781 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 18:07:27,781 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 18:07:27,782 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 18:07:27,786 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 18:07:27,789 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 18:07:27,792 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-09 18:07:27,794 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 18:07:27,796 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 18:07:28,009 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2020-12-09 18:07:28,009 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 18:07:28,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2020-12-09 18:07:28,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4, 4] total 13 [2020-12-09 18:07:28,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166659791] [2020-12-09 18:07:28,010 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 18:07:28,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 18:07:28,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 18:07:28,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-12-09 18:07:28,011 INFO L87 Difference]: Start difference. First operand 1394 states and 1639 transitions. Second operand 7 states. [2020-12-09 18:07:31,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:07:31,654 INFO L93 Difference]: Finished difference Result 2811 states and 3372 transitions. [2020-12-09 18:07:31,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 18:07:31,655 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 303 [2020-12-09 18:07:31,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:07:31,659 INFO L225 Difference]: With dead ends: 2811 [2020-12-09 18:07:31,659 INFO L226 Difference]: Without dead ends: 1394 [2020-12-09 18:07:31,660 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 908 GetRequests, 896 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2020-12-09 18:07:31,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-12-09 18:07:31,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1394. [2020-12-09 18:07:31,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1394 states. [2020-12-09 18:07:31,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1630 transitions. [2020-12-09 18:07:31,676 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1630 transitions. Word has length 303 [2020-12-09 18:07:31,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:07:31,677 INFO L481 AbstractCegarLoop]: Abstraction has 1394 states and 1630 transitions. [2020-12-09 18:07:31,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 18:07:31,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1630 transitions. [2020-12-09 18:07:31,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2020-12-09 18:07:31,682 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:07:31,683 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:07:32,084 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3,10 cvc4 --incremental --print-success --lang smt [2020-12-09 18:07:32,085 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:07:32,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:07:32,087 INFO L82 PathProgramCache]: Analyzing trace with hash -524971941, now seen corresponding path program 1 times [2020-12-09 18:07:32,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 18:07:32,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697089437] [2020-12-09 18:07:32,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2020-12-09 18:07:32,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:07:32,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 18:07:32,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:07:32,552 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 288 proven. 72 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2020-12-09 18:07:32,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:07:33,086 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2020-12-09 18:07:33,372 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 288 proven. 72 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2020-12-09 18:07:33,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697089437] [2020-12-09 18:07:33,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1483410045] [2020-12-09 18:07:33,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt [2020-12-09 18:07:33,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:07:33,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 18:07:33,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:07:34,166 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 288 proven. 72 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2020-12-09 18:07:34,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:07:34,590 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 288 proven. 72 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2020-12-09 18:07:34,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195471201] [2020-12-09 18:07:34,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:07:34,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:07:34,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 18:07:34,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:07:35,035 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 288 proven. 72 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2020-12-09 18:07:35,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:07:35,419 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 288 proven. 72 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2020-12-09 18:07:35,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 18:07:35,420 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3, 3, 3, 3] total 5 [2020-12-09 18:07:35,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239755895] [2020-12-09 18:07:35,421 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 18:07:35,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 18:07:35,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 18:07:35,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-09 18:07:35,422 INFO L87 Difference]: Start difference. First operand 1394 states and 1630 transitions. Second operand 6 states. [2020-12-09 18:07:36,102 WARN L197 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2020-12-09 18:08:39,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:08:39,386 INFO L93 Difference]: Finished difference Result 3620 states and 4192 transitions. [2020-12-09 18:08:39,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 18:08:39,389 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 354 [2020-12-09 18:08:39,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:08:39,397 INFO L225 Difference]: With dead ends: 3620 [2020-12-09 18:08:39,397 INFO L226 Difference]: Without dead ends: 2367 [2020-12-09 18:08:39,398 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2119 GetRequests, 2114 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-12-09 18:08:39,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2020-12-09 18:08:39,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 1950. [2020-12-09 18:08:39,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1950 states. [2020-12-09 18:08:39,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 2202 transitions. [2020-12-09 18:08:39,421 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 2202 transitions. Word has length 354 [2020-12-09 18:08:39,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:08:39,422 INFO L481 AbstractCegarLoop]: Abstraction has 1950 states and 2202 transitions. [2020-12-09 18:08:39,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 18:08:39,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 2202 transitions. [2020-12-09 18:08:39,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2020-12-09 18:08:39,425 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:08:39,425 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:08:40,027 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,11 mathsat -unsat_core_generation=3,12 cvc4 --incremental --print-success --lang smt [2020-12-09 18:08:40,029 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:08:40,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:08:40,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1147776074, now seen corresponding path program 1 times [2020-12-09 18:08:40,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 18:08:40,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1595448961] [2020-12-09 18:08:40,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2020-12-09 18:08:40,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:08:40,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 18:08:40,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:08:40,548 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 135 proven. 294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:08:40,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:08:41,399 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 341 proven. 8 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2020-12-09 18:08:41,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1595448961] [2020-12-09 18:08:41,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1448622236] [2020-12-09 18:08:41,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt [2020-12-09 18:08:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:08:41,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 18:08:41,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:08:42,120 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2020-12-09 18:08:42,120 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 18:08:42,120 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2020-12-09 18:08:42,121 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 4] total 12 [2020-12-09 18:08:42,121 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967147320] [2020-12-09 18:08:42,121 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 18:08:42,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 18:08:42,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 18:08:42,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-12-09 18:08:42,122 INFO L87 Difference]: Start difference. First operand 1950 states and 2202 transitions. Second operand 6 states. [2020-12-09 18:08:47,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:08:47,010 INFO L93 Difference]: Finished difference Result 3929 states and 4544 transitions. [2020-12-09 18:08:47,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 18:08:47,010 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 368 [2020-12-09 18:08:47,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:08:47,018 INFO L225 Difference]: With dead ends: 3929 [2020-12-09 18:08:47,018 INFO L226 Difference]: Without dead ends: 2398 [2020-12-09 18:08:47,019 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1103 GetRequests, 1091 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-12-09 18:08:47,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2398 states. [2020-12-09 18:08:47,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2398 to 2089. [2020-12-09 18:08:47,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2089 states. [2020-12-09 18:08:47,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 2355 transitions. [2020-12-09 18:08:47,048 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 2355 transitions. Word has length 368 [2020-12-09 18:08:47,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:08:47,048 INFO L481 AbstractCegarLoop]: Abstraction has 2089 states and 2355 transitions. [2020-12-09 18:08:47,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 18:08:47,048 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 2355 transitions. [2020-12-09 18:08:47,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2020-12-09 18:08:47,051 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:08:47,052 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:08:47,453 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3,15 cvc4 --incremental --print-success --lang smt [2020-12-09 18:08:47,454 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:08:47,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:08:47,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1196231667, now seen corresponding path program 1 times [2020-12-09 18:08:47,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 18:08:47,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306778801] [2020-12-09 18:08:47,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2020-12-09 18:08:47,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:08:47,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 18:08:47,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:08:48,078 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 158 proven. 259 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:08:48,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:08:48,782 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2020-12-09 18:08:48,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1306778801] [2020-12-09 18:08:48,783 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-09 18:08:48,783 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2020-12-09 18:08:48,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034764854] [2020-12-09 18:08:48,783 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 18:08:48,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 18:08:48,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 18:08:48,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-09 18:08:48,784 INFO L87 Difference]: Start difference. First operand 2089 states and 2355 transitions. Second operand 4 states. [2020-12-09 18:08:52,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:08:52,221 INFO L93 Difference]: Finished difference Result 3937 states and 4499 transitions. [2020-12-09 18:08:52,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 18:08:52,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 373 [2020-12-09 18:08:52,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:08:52,229 INFO L225 Difference]: With dead ends: 3937 [2020-12-09 18:08:52,229 INFO L226 Difference]: Without dead ends: 2267 [2020-12-09 18:08:52,230 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 746 GetRequests, 739 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-12-09 18:08:52,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2267 states. [2020-12-09 18:08:52,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2267 to 2228. [2020-12-09 18:08:52,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2228 states. [2020-12-09 18:08:52,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 2438 transitions. [2020-12-09 18:08:52,262 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 2438 transitions. Word has length 373 [2020-12-09 18:08:52,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:08:52,262 INFO L481 AbstractCegarLoop]: Abstraction has 2228 states and 2438 transitions. [2020-12-09 18:08:52,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 18:08:52,262 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 2438 transitions. [2020-12-09 18:08:52,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2020-12-09 18:08:52,266 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:08:52,266 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:08:52,467 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2020-12-09 18:08:52,467 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:08:52,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:08:52,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1300505292, now seen corresponding path program 1 times [2020-12-09 18:08:52,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 18:08:52,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2134186050] [2020-12-09 18:08:52,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2020-12-09 18:08:52,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:08:52,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 18:08:52,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:08:53,061 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 9 proven. 428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:08:53,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:08:53,566 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2020-12-09 18:08:53,566 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2134186050] [2020-12-09 18:08:53,566 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-09 18:08:53,567 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2020-12-09 18:08:53,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122015811] [2020-12-09 18:08:53,567 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 18:08:53,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 18:08:53,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 18:08:53,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-09 18:08:53,568 INFO L87 Difference]: Start difference. First operand 2228 states and 2438 transitions. Second operand 4 states. [2020-12-09 18:08:56,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:08:56,852 INFO L93 Difference]: Finished difference Result 2655 states and 2898 transitions. [2020-12-09 18:08:56,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 18:08:56,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 383 [2020-12-09 18:08:56,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:08:56,853 INFO L225 Difference]: With dead ends: 2655 [2020-12-09 18:08:56,853 INFO L226 Difference]: Without dead ends: 0 [2020-12-09 18:08:56,855 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 766 GetRequests, 758 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-12-09 18:08:56,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-09 18:08:56,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-09 18:08:56,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-09 18:08:56,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-09 18:08:56,855 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 383 [2020-12-09 18:08:56,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:08:56,855 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-09 18:08:56,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 18:08:56,856 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-09 18:08:56,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-09 18:08:57,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2020-12-09 18:08:57,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-09 18:08:57,210 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 101 [2020-12-09 18:09:01,663 WARN L197 SmtUtils]: Spent 4.40 s on a formula simplification. DAG size of input: 92 DAG size of output: 59 [2020-12-09 18:09:06,119 WARN L197 SmtUtils]: Spent 4.45 s on a formula simplification. DAG size of input: 92 DAG size of output: 59 [2020-12-09 18:09:06,123 INFO L262 CegarLoopResult]: For program point L597(line 597) no Hoare annotation was computed. [2020-12-09 18:09:06,123 INFO L262 CegarLoopResult]: For program point L564(lines 564 582) no Hoare annotation was computed. [2020-12-09 18:09:06,123 INFO L262 CegarLoopResult]: For program point L333(lines 333 582) no Hoare annotation was computed. [2020-12-09 18:09:06,123 INFO L262 CegarLoopResult]: For program point L367(lines 367 582) no Hoare annotation was computed. [2020-12-09 18:09:06,123 INFO L262 CegarLoopResult]: For program point L301(lines 301 582) no Hoare annotation was computed. [2020-12-09 18:09:06,123 INFO L262 CegarLoopResult]: For program point L235(lines 235 582) no Hoare annotation was computed. [2020-12-09 18:09:06,123 INFO L262 CegarLoopResult]: For program point L202-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,124 INFO L262 CegarLoopResult]: For program point L169-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,124 INFO L262 CegarLoopResult]: For program point L136-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,124 INFO L262 CegarLoopResult]: For program point L103-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,124 INFO L262 CegarLoopResult]: For program point L70-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,124 INFO L262 CegarLoopResult]: For program point L37-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,124 INFO L262 CegarLoopResult]: For program point L533(lines 533 582) no Hoare annotation was computed. [2020-12-09 18:09:06,124 INFO L262 CegarLoopResult]: For program point L203(line 203) no Hoare annotation was computed. [2020-12-09 18:09:06,124 INFO L262 CegarLoopResult]: For program point L170(line 170) no Hoare annotation was computed. [2020-12-09 18:09:06,124 INFO L262 CegarLoopResult]: For program point L137(line 137) no Hoare annotation was computed. [2020-12-09 18:09:06,124 INFO L262 CegarLoopResult]: For program point L104(line 104) no Hoare annotation was computed. [2020-12-09 18:09:06,124 INFO L262 CegarLoopResult]: For program point L71(line 71) no Hoare annotation was computed. [2020-12-09 18:09:06,124 INFO L262 CegarLoopResult]: For program point L38(line 38) no Hoare annotation was computed. [2020-12-09 18:09:06,124 INFO L262 CegarLoopResult]: For program point L567(lines 567 582) no Hoare annotation was computed. [2020-12-09 18:09:06,124 INFO L262 CegarLoopResult]: For program point L435(lines 435 582) no Hoare annotation was computed. [2020-12-09 18:09:06,124 INFO L262 CegarLoopResult]: For program point L336(lines 336 582) no Hoare annotation was computed. [2020-12-09 18:09:06,124 INFO L262 CegarLoopResult]: For program point L270(lines 270 582) no Hoare annotation was computed. [2020-12-09 18:09:06,124 INFO L262 CegarLoopResult]: For program point L403(lines 403 582) no Hoare annotation was computed. [2020-12-09 18:09:06,124 INFO L262 CegarLoopResult]: For program point L370(lines 370 582) no Hoare annotation was computed. [2020-12-09 18:09:06,124 INFO L262 CegarLoopResult]: For program point L205-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,124 INFO L262 CegarLoopResult]: For program point L172-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,124 INFO L262 CegarLoopResult]: For program point L139-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,124 INFO L262 CegarLoopResult]: For program point L106-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,124 INFO L262 CegarLoopResult]: For program point L73-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,125 INFO L262 CegarLoopResult]: For program point L40-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,125 INFO L262 CegarLoopResult]: For program point L536(lines 536 582) no Hoare annotation was computed. [2020-12-09 18:09:06,125 INFO L262 CegarLoopResult]: For program point L503(lines 503 582) no Hoare annotation was computed. [2020-12-09 18:09:06,125 INFO L262 CegarLoopResult]: For program point L470(lines 470 582) no Hoare annotation was computed. [2020-12-09 18:09:06,125 INFO L262 CegarLoopResult]: For program point L206(line 206) no Hoare annotation was computed. [2020-12-09 18:09:06,125 INFO L262 CegarLoopResult]: For program point L173(line 173) no Hoare annotation was computed. [2020-12-09 18:09:06,125 INFO L262 CegarLoopResult]: For program point L140(line 140) no Hoare annotation was computed. [2020-12-09 18:09:06,125 INFO L262 CegarLoopResult]: For program point L107(line 107) no Hoare annotation was computed. [2020-12-09 18:09:06,125 INFO L262 CegarLoopResult]: For program point L74(line 74) no Hoare annotation was computed. [2020-12-09 18:09:06,125 INFO L262 CegarLoopResult]: For program point L41(line 41) no Hoare annotation was computed. [2020-12-09 18:09:06,125 INFO L262 CegarLoopResult]: For program point L339(lines 339 582) no Hoare annotation was computed. [2020-12-09 18:09:06,125 INFO L262 CegarLoopResult]: For program point L306(lines 306 582) no Hoare annotation was computed. [2020-12-09 18:09:06,125 INFO L262 CegarLoopResult]: For program point L241(lines 241 582) no Hoare annotation was computed. [2020-12-09 18:09:06,125 INFO L262 CegarLoopResult]: For program point L208-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,125 INFO L262 CegarLoopResult]: For program point L175-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,125 INFO L262 CegarLoopResult]: For program point L142-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,125 INFO L262 CegarLoopResult]: For program point L109-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,125 INFO L262 CegarLoopResult]: For program point L76-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,125 INFO L262 CegarLoopResult]: For program point L43-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,125 INFO L262 CegarLoopResult]: For program point L539(lines 539 582) no Hoare annotation was computed. [2020-12-09 18:09:06,125 INFO L262 CegarLoopResult]: For program point L440(lines 440 582) no Hoare annotation was computed. [2020-12-09 18:09:06,125 INFO L262 CegarLoopResult]: For program point L275(lines 275 582) no Hoare annotation was computed. [2020-12-09 18:09:06,125 INFO L262 CegarLoopResult]: For program point L209(line 209) no Hoare annotation was computed. [2020-12-09 18:09:06,125 INFO L262 CegarLoopResult]: For program point L176(line 176) no Hoare annotation was computed. [2020-12-09 18:09:06,125 INFO L262 CegarLoopResult]: For program point L143(line 143) no Hoare annotation was computed. [2020-12-09 18:09:06,126 INFO L262 CegarLoopResult]: For program point L110(line 110) no Hoare annotation was computed. [2020-12-09 18:09:06,126 INFO L262 CegarLoopResult]: For program point L77(line 77) no Hoare annotation was computed. [2020-12-09 18:09:06,126 INFO L262 CegarLoopResult]: For program point L44(line 44) no Hoare annotation was computed. [2020-12-09 18:09:06,126 INFO L262 CegarLoopResult]: For program point L573(lines 573 582) no Hoare annotation was computed. [2020-12-09 18:09:06,126 INFO L262 CegarLoopResult]: For program point L408(lines 408 582) no Hoare annotation was computed. [2020-12-09 18:09:06,126 INFO L262 CegarLoopResult]: For program point L375(lines 375 582) no Hoare annotation was computed. [2020-12-09 18:09:06,126 INFO L262 CegarLoopResult]: For program point L475(lines 475 582) no Hoare annotation was computed. [2020-12-09 18:09:06,126 INFO L262 CegarLoopResult]: For program point L211-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,126 INFO L262 CegarLoopResult]: For program point L178-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,126 INFO L262 CegarLoopResult]: For program point L145-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,126 INFO L262 CegarLoopResult]: For program point L112-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,126 INFO L262 CegarLoopResult]: For program point L79-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,126 INFO L262 CegarLoopResult]: For program point L46-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,126 INFO L262 CegarLoopResult]: For program point L509(lines 509 582) no Hoare annotation was computed. [2020-12-09 18:09:06,126 INFO L262 CegarLoopResult]: For program point L311(lines 311 582) no Hoare annotation was computed. [2020-12-09 18:09:06,126 INFO L262 CegarLoopResult]: For program point L212(line 212) no Hoare annotation was computed. [2020-12-09 18:09:06,126 INFO L262 CegarLoopResult]: For program point L179(line 179) no Hoare annotation was computed. [2020-12-09 18:09:06,126 INFO L262 CegarLoopResult]: For program point L146(line 146) no Hoare annotation was computed. [2020-12-09 18:09:06,126 INFO L262 CegarLoopResult]: For program point L113(line 113) no Hoare annotation was computed. [2020-12-09 18:09:06,126 INFO L262 CegarLoopResult]: For program point L80(line 80) no Hoare annotation was computed. [2020-12-09 18:09:06,126 INFO L262 CegarLoopResult]: For program point L47(line 47) no Hoare annotation was computed. [2020-12-09 18:09:06,126 INFO L262 CegarLoopResult]: For program point L345(lines 345 582) no Hoare annotation was computed. [2020-12-09 18:09:06,126 INFO L262 CegarLoopResult]: For program point L246(lines 246 582) no Hoare annotation was computed. [2020-12-09 18:09:06,126 INFO L262 CegarLoopResult]: For program point L544(lines 544 582) no Hoare annotation was computed. [2020-12-09 18:09:06,126 INFO L262 CegarLoopResult]: For program point L181-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,127 INFO L262 CegarLoopResult]: For program point L148-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,127 INFO L262 CegarLoopResult]: For program point L115-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,127 INFO L262 CegarLoopResult]: For program point L82-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,127 INFO L262 CegarLoopResult]: For program point L49-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,127 INFO L262 CegarLoopResult]: For program point L446(lines 446 582) no Hoare annotation was computed. [2020-12-09 18:09:06,127 INFO L262 CegarLoopResult]: For program point L413(lines 413 582) no Hoare annotation was computed. [2020-12-09 18:09:06,127 INFO L262 CegarLoopResult]: For program point L380(lines 380 582) no Hoare annotation was computed. [2020-12-09 18:09:06,127 INFO L262 CegarLoopResult]: For program point L281(lines 281 582) no Hoare annotation was computed. [2020-12-09 18:09:06,127 INFO L262 CegarLoopResult]: For program point L182(line 182) no Hoare annotation was computed. [2020-12-09 18:09:06,127 INFO L262 CegarLoopResult]: For program point L149(line 149) no Hoare annotation was computed. [2020-12-09 18:09:06,127 INFO L262 CegarLoopResult]: For program point L116(line 116) no Hoare annotation was computed. [2020-12-09 18:09:06,127 INFO L262 CegarLoopResult]: For program point L83(line 83) no Hoare annotation was computed. [2020-12-09 18:09:06,127 INFO L262 CegarLoopResult]: For program point L50(line 50) no Hoare annotation was computed. [2020-12-09 18:09:06,127 INFO L262 CegarLoopResult]: For program point L579(lines 579 582) no Hoare annotation was computed. [2020-12-09 18:09:06,127 INFO L262 CegarLoopResult]: For program point L249(lines 249 582) no Hoare annotation was computed. [2020-12-09 18:09:06,127 INFO L262 CegarLoopResult]: For program point L514(lines 514 582) no Hoare annotation was computed. [2020-12-09 18:09:06,127 INFO L262 CegarLoopResult]: For program point L481(lines 481 582) no Hoare annotation was computed. [2020-12-09 18:09:06,127 INFO L262 CegarLoopResult]: For program point L316(lines 316 582) no Hoare annotation was computed. [2020-12-09 18:09:06,127 INFO L262 CegarLoopResult]: For program point L184-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,127 INFO L262 CegarLoopResult]: For program point L151-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,127 INFO L262 CegarLoopResult]: For program point L118-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,127 INFO L262 CegarLoopResult]: For program point L85-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,127 INFO L262 CegarLoopResult]: For program point L52-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,127 INFO L262 CegarLoopResult]: For program point L350(lines 350 582) no Hoare annotation was computed. [2020-12-09 18:09:06,127 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-09 18:09:06,128 INFO L262 CegarLoopResult]: For program point L185(line 185) no Hoare annotation was computed. [2020-12-09 18:09:06,128 INFO L262 CegarLoopResult]: For program point L152(line 152) no Hoare annotation was computed. [2020-12-09 18:09:06,128 INFO L262 CegarLoopResult]: For program point L119(line 119) no Hoare annotation was computed. [2020-12-09 18:09:06,128 INFO L262 CegarLoopResult]: For program point L86(line 86) no Hoare annotation was computed. [2020-12-09 18:09:06,128 INFO L262 CegarLoopResult]: For program point L53(line 53) no Hoare annotation was computed. [2020-12-09 18:09:06,128 INFO L258 CegarLoopResult]: At program point L583(lines 30 584) the Hoare annotation is: (let ((.cse7 (bvsdiv ~a1~0 (_ bv5 32)))) (let ((.cse0 (= (_ bv1 32) ~a10~0)) (.cse2 (not (= (_ bv6 32) ~a19~0))) (.cse4 (bvslt (_ bv218 32) (bvadd .cse7 (_ bv331501 32)))) (.cse5 (= (_ bv4 32) ~a10~0)) (.cse3 (= (_ bv0 32) ~a10~0)) (.cse6 (= (_ bv9 32) ~a19~0)) (.cse1 (not (bvsle (bvadd (bvsdiv (bvmul .cse7 (_ bv5 32)) (_ bv5 32)) (_ bv505228 32)) (_ bv4294967283 32))))) (or (and (= (_ bv0 32) (bvadd ~a4~0 (_ bv4294967282 32))) (bvslt (_ bv4294967283 32) ~a1~0) (bvsge (_ bv38 32) ~a1~0) (= (_ bv3 32) ~a10~0) (= (_ bv0 32) ~a12~0)) (and (= (_ bv10 32) ~a19~0) .cse0 .cse1) (and (= (_ bv2 32) ~a10~0) .cse2) (and (not (bvsle ~a1~0 (_ bv4294967283 32))) .cse2 .cse0) (and (not (bvslt (_ bv218 32) ~a1~0)) .cse3 .cse4) (and .cse5 .cse1) (and .cse2 .cse3 .cse4) (and .cse5 (= (_ bv8 32) ~a19~0)) (and .cse6 .cse3) (and .cse6 .cse1)))) [2020-12-09 18:09:06,128 INFO L262 CegarLoopResult]: For program point L550(lines 550 582) no Hoare annotation was computed. [2020-12-09 18:09:06,128 INFO L262 CegarLoopResult]: For program point L418(lines 418 582) no Hoare annotation was computed. [2020-12-09 18:09:06,128 INFO L262 CegarLoopResult]: For program point L385(lines 385 582) no Hoare annotation was computed. [2020-12-09 18:09:06,128 INFO L262 CegarLoopResult]: For program point L220(lines 220 582) no Hoare annotation was computed. [2020-12-09 18:09:06,128 INFO L262 CegarLoopResult]: For program point L187-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,128 INFO L262 CegarLoopResult]: For program point L154-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,128 INFO L262 CegarLoopResult]: For program point L121-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,128 INFO L262 CegarLoopResult]: For program point L88-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,128 INFO L262 CegarLoopResult]: For program point L55-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,128 INFO L262 CegarLoopResult]: For program point L452(lines 452 582) no Hoare annotation was computed. [2020-12-09 18:09:06,129 INFO L262 CegarLoopResult]: For program point L287(lines 287 582) no Hoare annotation was computed. [2020-12-09 18:09:06,129 INFO L262 CegarLoopResult]: For program point L254(lines 254 582) no Hoare annotation was computed. [2020-12-09 18:09:06,129 INFO L262 CegarLoopResult]: For program point L188(line 188) no Hoare annotation was computed. [2020-12-09 18:09:06,129 INFO L262 CegarLoopResult]: For program point L155(line 155) no Hoare annotation was computed. [2020-12-09 18:09:06,129 INFO L262 CegarLoopResult]: For program point L122(line 122) no Hoare annotation was computed. [2020-12-09 18:09:06,129 INFO L262 CegarLoopResult]: For program point L89(line 89) no Hoare annotation was computed. [2020-12-09 18:09:06,129 INFO L262 CegarLoopResult]: For program point L56(line 56) no Hoare annotation was computed. [2020-12-09 18:09:06,129 INFO L262 CegarLoopResult]: For program point L519(lines 519 582) no Hoare annotation was computed. [2020-12-09 18:09:06,129 INFO L262 CegarLoopResult]: For program point L486(lines 486 582) no Hoare annotation was computed. [2020-12-09 18:09:06,129 INFO L265 CegarLoopResult]: At program point L586(lines 586 602) the Hoare annotation is: true [2020-12-09 18:09:06,129 INFO L262 CegarLoopResult]: For program point L388(lines 388 582) no Hoare annotation was computed. [2020-12-09 18:09:06,129 INFO L262 CegarLoopResult]: For program point L355(lines 355 582) no Hoare annotation was computed. [2020-12-09 18:09:06,129 INFO L262 CegarLoopResult]: For program point L322(lines 322 582) no Hoare annotation was computed. [2020-12-09 18:09:06,129 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-09 18:09:06,129 INFO L262 CegarLoopResult]: For program point L190-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,129 INFO L262 CegarLoopResult]: For program point L157-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,129 INFO L262 CegarLoopResult]: For program point L124-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,129 INFO L262 CegarLoopResult]: For program point L91-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,129 INFO L262 CegarLoopResult]: For program point L58-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,129 INFO L262 CegarLoopResult]: For program point L191(line 191) no Hoare annotation was computed. [2020-12-09 18:09:06,129 INFO L262 CegarLoopResult]: For program point L158(line 158) no Hoare annotation was computed. [2020-12-09 18:09:06,129 INFO L262 CegarLoopResult]: For program point L125(line 125) no Hoare annotation was computed. [2020-12-09 18:09:06,129 INFO L262 CegarLoopResult]: For program point L92(line 92) no Hoare annotation was computed. [2020-12-09 18:09:06,129 INFO L262 CegarLoopResult]: For program point L59(line 59) no Hoare annotation was computed. [2020-12-09 18:09:06,129 INFO L262 CegarLoopResult]: For program point L555(lines 555 582) no Hoare annotation was computed. [2020-12-09 18:09:06,130 INFO L262 CegarLoopResult]: For program point L225(lines 225 582) no Hoare annotation was computed. [2020-12-09 18:09:06,130 INFO L262 CegarLoopResult]: For program point L424(lines 424 582) no Hoare annotation was computed. [2020-12-09 18:09:06,130 INFO L262 CegarLoopResult]: For program point L259(lines 259 582) no Hoare annotation was computed. [2020-12-09 18:09:06,130 INFO L262 CegarLoopResult]: For program point L193-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,130 INFO L262 CegarLoopResult]: For program point L160-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,130 INFO L262 CegarLoopResult]: For program point L127-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,130 INFO L262 CegarLoopResult]: For program point L94-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,130 INFO L262 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-09 18:09:06,130 INFO L262 CegarLoopResult]: For program point L61-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,130 INFO L262 CegarLoopResult]: For program point L524(lines 524 582) no Hoare annotation was computed. [2020-12-09 18:09:06,130 INFO L262 CegarLoopResult]: For program point L491(lines 491 582) no Hoare annotation was computed. [2020-12-09 18:09:06,130 INFO L262 CegarLoopResult]: For program point L458(lines 458 582) no Hoare annotation was computed. [2020-12-09 18:09:06,130 INFO L262 CegarLoopResult]: For program point L293(lines 293 582) no Hoare annotation was computed. [2020-12-09 18:09:06,130 INFO L262 CegarLoopResult]: For program point L194(line 194) no Hoare annotation was computed. [2020-12-09 18:09:06,130 INFO L262 CegarLoopResult]: For program point L161(line 161) no Hoare annotation was computed. [2020-12-09 18:09:06,130 INFO L262 CegarLoopResult]: For program point L128(line 128) no Hoare annotation was computed. [2020-12-09 18:09:06,130 INFO L262 CegarLoopResult]: For program point L95(line 95) no Hoare annotation was computed. [2020-12-09 18:09:06,130 INFO L262 CegarLoopResult]: For program point L62(line 62) no Hoare annotation was computed. [2020-12-09 18:09:06,130 INFO L262 CegarLoopResult]: For program point L558(lines 558 582) no Hoare annotation was computed. [2020-12-09 18:09:06,130 INFO L262 CegarLoopResult]: For program point L393(lines 393 582) no Hoare annotation was computed. [2020-12-09 18:09:06,130 INFO L262 CegarLoopResult]: For program point L327(lines 327 582) no Hoare annotation was computed. [2020-12-09 18:09:06,131 INFO L258 CegarLoopResult]: At program point L592-2(lines 592 601) the Hoare annotation is: (let ((.cse7 (bvsdiv ~a1~0 (_ bv5 32)))) (let ((.cse0 (= (_ bv1 32) ~a10~0)) (.cse2 (not (= (_ bv6 32) ~a19~0))) (.cse4 (bvslt (_ bv218 32) (bvadd .cse7 (_ bv331501 32)))) (.cse5 (= (_ bv4 32) ~a10~0)) (.cse3 (= (_ bv0 32) ~a10~0)) (.cse6 (= (_ bv9 32) ~a19~0)) (.cse1 (not (bvsle (bvadd (bvsdiv (bvmul .cse7 (_ bv5 32)) (_ bv5 32)) (_ bv505228 32)) (_ bv4294967283 32))))) (or (and (= (_ bv0 32) (bvadd ~a4~0 (_ bv4294967282 32))) (bvslt (_ bv4294967283 32) ~a1~0) (bvsge (_ bv38 32) ~a1~0) (= (_ bv3 32) ~a10~0) (= (_ bv0 32) ~a12~0)) (and (= (_ bv10 32) ~a19~0) .cse0 .cse1) (and (= (_ bv2 32) ~a10~0) .cse2) (and (not (bvsle ~a1~0 (_ bv4294967283 32))) .cse2 .cse0) (and (not (bvslt (_ bv218 32) ~a1~0)) .cse3 .cse4) (and .cse5 .cse1) (and .cse2 .cse3 .cse4) (and .cse5 (= (_ bv8 32) ~a19~0)) (and .cse6 .cse3) (and .cse6 .cse1)))) [2020-12-09 18:09:06,131 INFO L262 CegarLoopResult]: For program point L361(lines 361 582) no Hoare annotation was computed. [2020-12-09 18:09:06,131 INFO L262 CegarLoopResult]: For program point L196-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,131 INFO L262 CegarLoopResult]: For program point L163-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,131 INFO L262 CegarLoopResult]: For program point L130-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,131 INFO L262 CegarLoopResult]: For program point L97-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,131 INFO L262 CegarLoopResult]: For program point L31(lines 31 33) no Hoare annotation was computed. [2020-12-09 18:09:06,131 INFO L262 CegarLoopResult]: For program point L64-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,131 INFO L262 CegarLoopResult]: For program point L31-2(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,131 INFO L262 CegarLoopResult]: For program point L527(lines 527 582) no Hoare annotation was computed. [2020-12-09 18:09:06,131 INFO L262 CegarLoopResult]: For program point L296(lines 296 582) no Hoare annotation was computed. [2020-12-09 18:09:06,131 INFO L262 CegarLoopResult]: For program point L230(lines 230 582) no Hoare annotation was computed. [2020-12-09 18:09:06,131 INFO L262 CegarLoopResult]: For program point L197(line 197) no Hoare annotation was computed. [2020-12-09 18:09:06,131 INFO L262 CegarLoopResult]: For program point L164(line 164) no Hoare annotation was computed. [2020-12-09 18:09:06,131 INFO L262 CegarLoopResult]: For program point L131(line 131) no Hoare annotation was computed. [2020-12-09 18:09:06,131 INFO L262 CegarLoopResult]: For program point L98(line 98) no Hoare annotation was computed. [2020-12-09 18:09:06,131 INFO L262 CegarLoopResult]: For program point L65(line 65) no Hoare annotation was computed. [2020-12-09 18:09:06,131 INFO L262 CegarLoopResult]: For program point L32(line 32) no Hoare annotation was computed. [2020-12-09 18:09:06,131 INFO L262 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-09 18:09:06,131 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 179) no Hoare annotation was computed. [2020-12-09 18:09:06,131 INFO L262 CegarLoopResult]: For program point L429(lines 429 582) no Hoare annotation was computed. [2020-12-09 18:09:06,131 INFO L262 CegarLoopResult]: For program point L330(lines 330 582) no Hoare annotation was computed. [2020-12-09 18:09:06,131 INFO L262 CegarLoopResult]: For program point L264(lines 264 582) no Hoare annotation was computed. [2020-12-09 18:09:06,131 INFO L262 CegarLoopResult]: For program point L364(lines 364 582) no Hoare annotation was computed. [2020-12-09 18:09:06,132 INFO L262 CegarLoopResult]: For program point L199-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,132 INFO L262 CegarLoopResult]: For program point L166-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,132 INFO L262 CegarLoopResult]: For program point L133-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,132 INFO L262 CegarLoopResult]: For program point L100-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,132 INFO L262 CegarLoopResult]: For program point L67-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,132 INFO L262 CegarLoopResult]: For program point L34-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 18:09:06,132 INFO L262 CegarLoopResult]: For program point L497(lines 497 582) no Hoare annotation was computed. [2020-12-09 18:09:06,132 INFO L262 CegarLoopResult]: For program point L464(lines 464 582) no Hoare annotation was computed. [2020-12-09 18:09:06,132 INFO L262 CegarLoopResult]: For program point L398(lines 398 582) no Hoare annotation was computed. [2020-12-09 18:09:06,132 INFO L262 CegarLoopResult]: For program point L200(line 200) no Hoare annotation was computed. [2020-12-09 18:09:06,132 INFO L262 CegarLoopResult]: For program point L167(line 167) no Hoare annotation was computed. [2020-12-09 18:09:06,132 INFO L262 CegarLoopResult]: For program point L134(line 134) no Hoare annotation was computed. [2020-12-09 18:09:06,132 INFO L262 CegarLoopResult]: For program point L101(line 101) no Hoare annotation was computed. [2020-12-09 18:09:06,132 INFO L262 CegarLoopResult]: For program point L68(line 68) no Hoare annotation was computed. [2020-12-09 18:09:06,132 INFO L262 CegarLoopResult]: For program point L35(line 35) no Hoare annotation was computed. [2020-12-09 18:09:06,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 06:09:06 BoogieIcfgContainer [2020-12-09 18:09:06,147 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 18:09:06,147 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 18:09:06,147 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 18:09:06,147 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 18:09:06,148 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:06:39" (3/4) ... [2020-12-09 18:09:06,150 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-09 18:09:06,163 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2020-12-09 18:09:06,164 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-12-09 18:09:06,165 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-09 18:09:06,166 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-09 18:09:06,237 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_778089fa-eed0-4dd3-b608-ece12fc24e43/bin/utaipan/witness.graphml [2020-12-09 18:09:06,238 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 18:09:06,238 INFO L168 Benchmark]: Toolchain (without parser) took 149749.44 ms. Allocated memory was 58.7 MB in the beginning and 182.5 MB in the end (delta: 123.7 MB). Free memory was 36.6 MB in the beginning and 95.2 MB in the end (delta: -58.6 MB). Peak memory consumption was 65.9 MB. Max. memory is 16.1 GB. [2020-12-09 18:09:06,239 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 58.7 MB. Free memory was 41.7 MB in the beginning and 41.7 MB in the end (delta: 73.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 18:09:06,239 INFO L168 Benchmark]: CACSL2BoogieTranslator took 396.97 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 36.5 MB in the beginning and 42.1 MB in the end (delta: -5.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-12-09 18:09:06,239 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.13 ms. Allocated memory is still 71.3 MB. Free memory was 42.1 MB in the beginning and 36.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-09 18:09:06,239 INFO L168 Benchmark]: Boogie Preprocessor took 58.80 ms. Allocated memory is still 71.3 MB. Free memory was 36.7 MB in the beginning and 49.1 MB in the end (delta: -12.3 MB). Peak memory consumption was 6.2 MB. Max. memory is 16.1 GB. [2020-12-09 18:09:06,240 INFO L168 Benchmark]: RCFGBuilder took 2075.73 ms. Allocated memory was 71.3 MB in the beginning and 86.0 MB in the end (delta: 14.7 MB). Free memory was 49.1 MB in the beginning and 48.9 MB in the end (delta: 137.0 kB). Peak memory consumption was 30.8 MB. Max. memory is 16.1 GB. [2020-12-09 18:09:06,240 INFO L168 Benchmark]: TraceAbstraction took 147070.38 ms. Allocated memory was 86.0 MB in the beginning and 182.5 MB in the end (delta: 96.5 MB). Free memory was 48.3 MB in the beginning and 110.1 MB in the end (delta: -61.8 MB). Peak memory consumption was 114.9 MB. Max. memory is 16.1 GB. [2020-12-09 18:09:06,240 INFO L168 Benchmark]: Witness Printer took 90.26 ms. Allocated memory is still 182.5 MB. Free memory was 110.1 MB in the beginning and 95.2 MB in the end (delta: 14.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-12-09 18:09:06,242 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.13 ms. Allocated memory is still 58.7 MB. Free memory was 41.7 MB in the beginning and 41.7 MB in the end (delta: 73.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 396.97 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 36.5 MB in the beginning and 42.1 MB in the end (delta: -5.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 53.13 ms. Allocated memory is still 71.3 MB. Free memory was 42.1 MB in the beginning and 36.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 58.80 ms. Allocated memory is still 71.3 MB. Free memory was 36.7 MB in the beginning and 49.1 MB in the end (delta: -12.3 MB). Peak memory consumption was 6.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2075.73 ms. Allocated memory was 71.3 MB in the beginning and 86.0 MB in the end (delta: 14.7 MB). Free memory was 49.1 MB in the beginning and 48.9 MB in the end (delta: 137.0 kB). Peak memory consumption was 30.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 147070.38 ms. Allocated memory was 86.0 MB in the beginning and 182.5 MB in the end (delta: 96.5 MB). Free memory was 48.3 MB in the beginning and 110.1 MB in the end (delta: -61.8 MB). Peak memory consumption was 114.9 MB. Max. memory is 16.1 GB. * Witness Printer took 90.26 ms. Allocated memory is still 182.5 MB. Free memory was 110.1 MB in the beginning and 95.2 MB in the end (delta: 14.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 179]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 592]: Loop Invariant Derived loop invariant: ((((((((((((0bv32 == ~bvadd64(a4, 4294967282bv32) && ~bvslt32(4294967283bv32, a1)) && ~bvsge32(38bv32, a1)) && 3bv32 == a10) && 0bv32 == a12) || ((10bv32 == a19 && 1bv32 == a10) && !~bvsle32(~bvadd64(~bvsdiv32(~bvmul32(~bvsdiv32(a1, 5bv32), 5bv32), 5bv32), 505228bv32), 4294967283bv32))) || (2bv32 == a10 && !(6bv32 == a19))) || ((!~bvsle32(a1, 4294967283bv32) && !(6bv32 == a19)) && 1bv32 == a10)) || ((!~bvslt32(218bv32, a1) && 0bv32 == a10) && ~bvslt32(218bv32, ~bvadd64(~bvsdiv32(a1, 5bv32), 331501bv32)))) || (4bv32 == a10 && !~bvsle32(~bvadd64(~bvsdiv32(~bvmul32(~bvsdiv32(a1, 5bv32), 5bv32), 5bv32), 505228bv32), 4294967283bv32))) || ((!(6bv32 == a19) && 0bv32 == a10) && ~bvslt32(218bv32, ~bvadd64(~bvsdiv32(a1, 5bv32), 331501bv32)))) || (4bv32 == a10 && 8bv32 == a19)) || (9bv32 == a19 && 0bv32 == a10)) || (9bv32 == a19 && !~bvsle32(~bvadd64(~bvsdiv32(~bvmul32(~bvsdiv32(a1, 5bv32), 5bv32), 5bv32), 505228bv32), 4294967283bv32)) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((((0bv32 == ~bvadd64(a4, 4294967282bv32) && ~bvslt32(4294967283bv32, a1)) && ~bvsge32(38bv32, a1)) && 3bv32 == a10) && 0bv32 == a12) || ((10bv32 == a19 && 1bv32 == a10) && !~bvsle32(~bvadd64(~bvsdiv32(~bvmul32(~bvsdiv32(a1, 5bv32), 5bv32), 5bv32), 505228bv32), 4294967283bv32))) || (2bv32 == a10 && !(6bv32 == a19))) || ((!~bvsle32(a1, 4294967283bv32) && !(6bv32 == a19)) && 1bv32 == a10)) || ((!~bvslt32(218bv32, a1) && 0bv32 == a10) && ~bvslt32(218bv32, ~bvadd64(~bvsdiv32(a1, 5bv32), 331501bv32)))) || (4bv32 == a10 && !~bvsle32(~bvadd64(~bvsdiv32(~bvmul32(~bvsdiv32(a1, 5bv32), 5bv32), 5bv32), 505228bv32), 4294967283bv32))) || ((!(6bv32 == a19) && 0bv32 == a10) && ~bvslt32(218bv32, ~bvadd64(~bvsdiv32(a1, 5bv32), 331501bv32)))) || (4bv32 == a10 && 8bv32 == a19)) || (9bv32 == a19 && 0bv32 == a10)) || (9bv32 == a19 && !~bvsle32(~bvadd64(~bvsdiv32(~bvmul32(~bvsdiv32(a1, 5bv32), 5bv32), 5bv32), 505228bv32), 4294967283bv32)) - InvariantResult [Line: 586]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 137.9s, OverallIterations: 12, TraceHistogramMax: 4, AutomataDifference: 121.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1325 SDtfs, 2123 SDslu, 128 SDs, 0 SdLazy, 7235 SolverSat, 1243 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 109.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6935 GetRequests, 6881 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2228occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 1321 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 53 NumberOfFragments, 269 HoareAnnotationTreeSize, 3 FomulaSimplifications, 4426 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1820 FormulaSimplificationTreeSizeReductionInter, 8.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 4331 NumberOfCodeBlocks, 4331 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 6926 ConstructedInterpolants, 0 QuantifiedInterpolants, 11746478 SizeOfPredicates, 37 NumberOfNonLiveVariables, 5269 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 24 InterpolantComputations, 11 PerfectInterpolantSequences, 5249/6970 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 correct! Received shutdown request...