./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem10_label00.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_f951a96e-3a10-490a-bb59-a20253129c8a/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_f951a96e-3a10-490a-bb59-a20253129c8a/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f951a96e-3a10-490a-bb59-a20253129c8a/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f951a96e-3a10-490a-bb59-a20253129c8a/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label00.c -s /tmp/vcloud-vcloud-master/worker/run_dir_f951a96e-3a10-490a-bb59-a20253129c8a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f951a96e-3a10-490a-bb59-a20253129c8a/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 afdfdfa0b714beb09f09171cff02bdf038a0089f ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_f951a96e-3a10-490a-bb59-a20253129c8a/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_f951a96e-3a10-490a-bb59-a20253129c8a/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f951a96e-3a10-490a-bb59-a20253129c8a/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f951a96e-3a10-490a-bb59-a20253129c8a/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label00.c -s /tmp/vcloud-vcloud-master/worker/run_dir_f951a96e-3a10-490a-bb59-a20253129c8a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f951a96e-3a10-490a-bb59-a20253129c8a/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 afdfdfa0b714beb09f09171cff02bdf038a0089f ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 19:42:40,564 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 19:42:40,566 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 19:42:40,603 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 19:42:40,603 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 19:42:40,605 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 19:42:40,606 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 19:42:40,609 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 19:42:40,611 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 19:42:40,612 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 19:42:40,613 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 19:42:40,614 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 19:42:40,614 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 19:42:40,615 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 19:42:40,617 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 19:42:40,618 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 19:42:40,619 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 19:42:40,620 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 19:42:40,621 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 19:42:40,624 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 19:42:40,625 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 19:42:40,627 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 19:42:40,628 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 19:42:40,629 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 19:42:40,632 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 19:42:40,632 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 19:42:40,632 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 19:42:40,633 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 19:42:40,634 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 19:42:40,635 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 19:42:40,635 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 19:42:40,636 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 19:42:40,637 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 19:42:40,638 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 19:42:40,639 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 19:42:40,639 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 19:42:40,640 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 19:42:40,640 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 19:42:40,640 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 19:42:40,641 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 19:42:40,642 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 19:42:40,642 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f951a96e-3a10-490a-bb59-a20253129c8a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 19:42:40,665 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 19:42:40,665 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 19:42:40,666 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 19:42:40,666 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 19:42:40,666 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 19:42:40,666 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 19:42:40,666 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 19:42:40,666 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 19:42:40,667 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 19:42:40,667 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 19:42:40,667 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 19:42:40,667 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 19:42:40,667 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 19:42:40,667 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 19:42:40,668 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 19:42:40,668 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 19:42:40,668 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 19:42:40,669 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 19:42:40,669 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 19:42:40,669 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 19:42:40,669 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 19:42:40,669 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 19:42:40,669 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 19:42:40,670 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 19:42:40,670 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 19:42:40,670 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 19:42:40,670 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 19:42:40,670 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 19:42:40,671 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 19:42:40,671 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 19:42:40,671 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 19:42:40,671 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 19:42:40,671 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 19:42:40,671 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 19:42:40,672 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 19:42:40,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 19:42:40,672 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 19:42:40,672 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 19:42:40,672 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 19:42:40,672 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_f951a96e-3a10-490a-bb59-a20253129c8a/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_f951a96e-3a10-490a-bb59-a20253129c8a/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 -> afdfdfa0b714beb09f09171cff02bdf038a0089f [2020-12-09 19:42:40,854 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 19:42:40,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 19:42:40,872 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 19:42:40,873 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 19:42:40,873 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 19:42:40,874 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f951a96e-3a10-490a-bb59-a20253129c8a/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem10_label00.c [2020-12-09 19:42:40,915 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f951a96e-3a10-490a-bb59-a20253129c8a/bin/utaipan/data/1edb3be1f/77fe96f3cdb948f28278be5bc23732ef/FLAG448247503 [2020-12-09 19:42:41,361 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 19:42:41,362 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f951a96e-3a10-490a-bb59-a20253129c8a/sv-benchmarks/c/eca-rers2012/Problem10_label00.c [2020-12-09 19:42:41,373 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f951a96e-3a10-490a-bb59-a20253129c8a/bin/utaipan/data/1edb3be1f/77fe96f3cdb948f28278be5bc23732ef/FLAG448247503 [2020-12-09 19:42:41,386 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f951a96e-3a10-490a-bb59-a20253129c8a/bin/utaipan/data/1edb3be1f/77fe96f3cdb948f28278be5bc23732ef [2020-12-09 19:42:41,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 19:42:41,390 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 19:42:41,392 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 19:42:41,392 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 19:42:41,395 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 19:42:41,396 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:42:41" (1/1) ... [2020-12-09 19:42:41,398 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7951446a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:42:41, skipping insertion in model container [2020-12-09 19:42:41,398 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:42:41" (1/1) ... [2020-12-09 19:42:41,405 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 19:42:41,448 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 19:42:41,594 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_f951a96e-3a10-490a-bb59-a20253129c8a/sv-benchmarks/c/eca-rers2012/Problem10_label00.c[5445,5458] [2020-12-09 19:42:41,689 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 19:42:41,695 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 19:42:41,715 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_f951a96e-3a10-490a-bb59-a20253129c8a/sv-benchmarks/c/eca-rers2012/Problem10_label00.c[5445,5458] [2020-12-09 19:42:41,758 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 19:42:41,769 INFO L208 MainTranslator]: Completed translation [2020-12-09 19:42:41,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:42:41 WrapperNode [2020-12-09 19:42:41,770 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 19:42:41,770 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 19:42:41,771 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 19:42:41,771 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 19:42:41,776 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:42:41" (1/1) ... [2020-12-09 19:42:41,790 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:42:41" (1/1) ... [2020-12-09 19:42:41,835 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 19:42:41,836 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 19:42:41,836 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 19:42:41,836 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 19:42:41,844 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:42:41" (1/1) ... [2020-12-09 19:42:41,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:42:41" (1/1) ... [2020-12-09 19:42:41,851 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:42:41" (1/1) ... [2020-12-09 19:42:41,852 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:42:41" (1/1) ... [2020-12-09 19:42:41,882 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:42:41" (1/1) ... [2020-12-09 19:42:41,891 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:42:41" (1/1) ... [2020-12-09 19:42:41,901 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:42:41" (1/1) ... [2020-12-09 19:42:41,915 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 19:42:41,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 19:42:41,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 19:42:41,916 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 19:42:41,917 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:42:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f951a96e-3a10-490a-bb59-a20253129c8a/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 19:42:41,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 19:42:41,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 19:42:41,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 19:42:41,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 19:42:47,722 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 19:42:47,723 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-09 19:42:47,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:42:47 BoogieIcfgContainer [2020-12-09 19:42:47,724 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 19:42:47,726 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 19:42:47,726 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 19:42:47,728 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 19:42:47,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:42:41" (1/3) ... [2020-12-09 19:42:47,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ab3d6a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:42:47, skipping insertion in model container [2020-12-09 19:42:47,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:42:41" (2/3) ... [2020-12-09 19:42:47,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ab3d6a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:42:47, skipping insertion in model container [2020-12-09 19:42:47,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:42:47" (3/3) ... [2020-12-09 19:42:47,730 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label00.c [2020-12-09 19:42:47,740 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 19:42:47,743 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 19:42:47,750 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 19:42:47,766 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 19:42:47,766 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 19:42:47,766 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 19:42:47,766 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 19:42:47,766 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 19:42:47,766 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 19:42:47,766 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 19:42:47,767 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 19:42:47,775 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2020-12-09 19:42:47,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-09 19:42:47,778 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:42:47,778 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-09 19:42:47,779 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:42:47,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:42:47,782 INFO L82 PathProgramCache]: Analyzing trace with hash 857615194, now seen corresponding path program 1 times [2020-12-09 19:42:47,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:42:47,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541087349] [2020-12-09 19:42:47,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:42:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:42:47,915 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 19:42:47,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541087349] [2020-12-09 19:42:47,916 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:42:47,916 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 19:42:47,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603450372] [2020-12-09 19:42:47,919 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 19:42:47,919 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:42:47,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 19:42:47,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 19:42:47,930 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2020-12-09 19:42:47,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:42:47,973 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2020-12-09 19:42:47,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 19:42:47,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-12-09 19:42:47,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:42:47,980 INFO L225 Difference]: With dead ends: 23 [2020-12-09 19:42:47,980 INFO L226 Difference]: Without dead ends: 11 [2020-12-09 19:42:47,982 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 19:42:47,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-12-09 19:42:48,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2020-12-09 19:42:48,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-12-09 19:42:48,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2020-12-09 19:42:48,003 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 5 [2020-12-09 19:42:48,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:42:48,003 INFO L481 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2020-12-09 19:42:48,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 19:42:48,003 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2020-12-09 19:42:48,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 19:42:48,003 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:42:48,004 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2020-12-09 19:42:48,004 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 19:42:48,004 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:42:48,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:42:48,004 INFO L82 PathProgramCache]: Analyzing trace with hash 258730516, now seen corresponding path program 1 times [2020-12-09 19:42:48,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:42:48,005 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789112605] [2020-12-09 19:42:48,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:42:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:42:48,210 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 19:42:48,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789112605] [2020-12-09 19:42:48,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811877176] [2020-12-09 19:42:48,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f951a96e-3a10-490a-bb59-a20253129c8a/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 19:42:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:42:48,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 20 conjunts are in the unsatisfiable core [2020-12-09 19:42:48,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:42:48,523 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 1003 DAG size of output: 128 [2020-12-09 19:42:48,570 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 3, 2, 3, 2, 3, 2, 3, 2, 3, 1] term [2020-12-09 19:42:48,571 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 19:42:48,574 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 19:42:48,575 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 19:42:48,712 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 19:42:48,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:42:48,981 WARN L197 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 1666 DAG size of output: 865 [2020-12-09 19:42:49,029 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 9, 7, 7, 5, 8, 6, 8, 6, 8, 6, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 5, 9, 7, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,029 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,035 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 9, 7, 9, 7, 7, 5, 8, 6, 8, 6, 8, 6, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 5, 9, 7, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,035 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,041 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 9, 7, 9, 7, 7, 5, 8, 6, 8, 6, 8, 6, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 5, 9, 7, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,041 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,047 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 9, 7, 9, 7, 7, 5, 8, 6, 8, 6, 8, 6, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 5, 9, 7, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,047 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,052 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 9, 7, 7, 5, 8, 6, 8, 6, 8, 6, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 5, 9, 7, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,052 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,053 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 19:42:49,054 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,055 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 19:42:49,055 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,056 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:42:49,056 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,057 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:42:49,058 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,059 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 19:42:49,059 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,060 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:42:49,060 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,061 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:42:49,061 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,066 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 7, 5, 8, 6, 8, 6, 8, 6, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 5, 9, 7, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,066 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,070 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 5, 8, 6, 8, 6, 8, 6, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 5, 9, 7, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,070 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,071 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:42:49,071 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,077 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 5, 9, 7, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,077 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,081 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 5, 9, 7, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,081 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,085 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 5, 9, 7, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,085 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,089 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 5, 9, 7, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,089 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,090 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:42:49,090 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,094 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 5, 9, 7, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,094 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,098 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 5, 9, 7, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,098 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,099 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 19:42:49,099 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,100 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:42:49,100 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,101 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:42:49,101 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,105 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 5, 9, 7, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,105 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,108 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 5, 9, 7, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,109 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,112 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 5, 9, 7, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,112 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,115 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 7, 5, 9, 7, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,115 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,118 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 7, 5, 9, 7, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,119 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,122 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 7, 5, 9, 7, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,122 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,125 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 7, 5, 9, 7, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,125 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,128 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 5, 9, 7, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,128 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,130 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,131 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,133 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,133 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,136 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,137 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,139 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,140 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,143 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,143 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,144 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 19:42:49,144 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,145 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:42:49,145 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,146 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:42:49,147 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,149 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,150 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,152 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,152 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,153 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:42:49,153 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,155 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,156 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,156 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 19:42:49,157 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,159 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,159 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,161 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,161 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,162 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 19:42:49,162 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,163 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 19:42:49,163 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,164 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:42:49,164 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,165 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 19:42:49,166 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,167 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:42:49,167 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,169 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,169 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,170 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,170 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,171 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,171 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,172 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,172 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,173 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:42:49,173 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,176 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:42:49,176 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,179 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 3, 2, 1] term [2020-12-09 19:42:49,179 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,180 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 2, 1] term [2020-12-09 19:42:49,180 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,180 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:42:49,181 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,182 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:42:49,182 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,183 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 2, 1] term [2020-12-09 19:42:49,183 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,184 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:42:49,184 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,185 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:42:49,185 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,186 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 1] term [2020-12-09 19:42:49,186 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,187 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 19:42:49,187 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,188 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:42:49,188 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,191 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:42:49,191 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,193 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:42:49,193 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,194 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:42:49,195 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,196 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:42:49,196 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,199 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:42:49,199 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,202 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:42:49,202 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,203 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:42:49,204 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,205 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:42:49,205 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,207 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:42:49,207 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,210 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 9, 7, 8, 6, 8, 6, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 10, 6, 8, 6, 9, 7, 9, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,211 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,213 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 9, 7, 9, 7, 8, 6, 8, 6, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 10, 6, 8, 6, 9, 7, 9, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,213 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,216 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 9, 7, 9, 7, 8, 6, 8, 6, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 10, 6, 8, 6, 9, 7, 9, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,216 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,220 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 9, 7, 9, 7, 8, 6, 8, 6, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 10, 6, 8, 6, 9, 7, 9, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,220 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,222 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 9, 7, 8, 6, 8, 6, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 10, 6, 8, 6, 9, 7, 9, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,222 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,225 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 8, 6, 8, 6, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 10, 6, 8, 6, 9, 7, 9, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,225 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,227 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 10, 6, 8, 6, 9, 7, 9, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,227 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,229 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 10, 6, 8, 6, 9, 7, 9, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,229 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,232 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 10, 6, 8, 6, 9, 7, 9, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,232 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,234 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 10, 6, 8, 6, 9, 7, 9, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,234 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,236 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 10, 6, 8, 6, 9, 7, 9, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,236 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,238 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 10, 6, 8, 6, 9, 7, 9, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,238 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,240 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 10, 6, 8, 6, 9, 7, 9, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,240 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,241 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 10, 6, 8, 6, 9, 7, 9, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,241 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,242 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 10, 6, 8, 6, 9, 7, 9, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,243 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,244 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 10, 6, 8, 6, 9, 7, 9, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,244 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,245 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 10, 6, 8, 6, 9, 7, 9, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,245 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,246 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 9, 7, 9, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,246 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,248 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 9, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,248 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,250 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,250 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,251 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,251 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,252 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,252 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,253 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,253 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,254 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,254 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,255 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 8, 6, 8, 6, 8, 6, 7, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,255 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,256 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 7, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,256 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,257 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 7, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,257 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,257 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 7, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,257 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,258 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,258 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:49,258 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 8, 7, 2, 1] term [2020-12-09 19:42:49,259 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:42:50,624 WARN L197 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 392 DAG size of output: 86 [2020-12-09 19:42:50,942 WARN L197 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2020-12-09 19:42:50,948 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 6, 5, 6, 1] term [2020-12-09 19:42:50,948 INFO L639 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-12-09 19:42:51,086 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2020-12-09 19:42:51,088 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 19:42:51,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [860549660] [2020-12-09 19:42:51,104 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2020-12-09 19:42:51,104 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 19:42:51,108 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 19:42:51,111 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 19:42:51,111 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 19:42:51,252 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 42 [2020-12-09 19:42:51,694 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 42 [2020-12-09 19:42:52,391 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 1676 DAG size of output: 1591 [2020-12-09 19:52:47,570 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-12-09 19:52:47,572 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 19:52:47,582 INFO L168 Benchmark]: Toolchain (without parser) took 606189.55 ms. Allocated memory was 98.6 MB in the beginning and 906.0 MB in the end (delta: 807.4 MB). Free memory was 56.3 MB in the beginning and 448.5 MB in the end (delta: -392.3 MB). Peak memory consumption was 587.1 MB. Max. memory is 16.1 GB. [2020-12-09 19:52:47,583 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 98.6 MB. Free memory is still 74.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 19:52:47,585 INFO L168 Benchmark]: CACSL2BoogieTranslator took 378.11 ms. Allocated memory is still 98.6 MB. Free memory was 56.0 MB in the beginning and 55.1 MB in the end (delta: 912.6 kB). Peak memory consumption was 7.5 MB. Max. memory is 16.1 GB. [2020-12-09 19:52:47,587 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.58 ms. Allocated memory is still 98.6 MB. Free memory was 55.1 MB in the beginning and 47.0 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-12-09 19:52:47,588 INFO L168 Benchmark]: Boogie Preprocessor took 79.59 ms. Allocated memory is still 98.6 MB. Free memory was 47.0 MB in the beginning and 69.9 MB in the end (delta: -22.9 MB). Peak memory consumption was 9.8 MB. Max. memory is 16.1 GB. [2020-12-09 19:52:47,590 INFO L168 Benchmark]: RCFGBuilder took 5808.58 ms. Allocated memory was 98.6 MB in the beginning and 239.1 MB in the end (delta: 140.5 MB). Free memory was 69.9 MB in the beginning and 105.8 MB in the end (delta: -35.9 MB). Peak memory consumption was 162.7 MB. Max. memory is 16.1 GB. [2020-12-09 19:52:47,590 INFO L168 Benchmark]: TraceAbstraction took 599853.51 ms. Allocated memory was 239.1 MB in the beginning and 906.0 MB in the end (delta: 666.9 MB). Free memory was 104.8 MB in the beginning and 448.5 MB in the end (delta: -343.7 MB). Peak memory consumption was 493.1 MB. Max. memory is 16.1 GB. [2020-12-09 19:52:47,593 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.17 ms. Allocated memory is still 98.6 MB. Free memory is still 74.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 378.11 ms. Allocated memory is still 98.6 MB. Free memory was 56.0 MB in the beginning and 55.1 MB in the end (delta: 912.6 kB). Peak memory consumption was 7.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 64.58 ms. Allocated memory is still 98.6 MB. Free memory was 55.1 MB in the beginning and 47.0 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 79.59 ms. Allocated memory is still 98.6 MB. Free memory was 47.0 MB in the beginning and 69.9 MB in the end (delta: -22.9 MB). Peak memory consumption was 9.8 MB. Max. memory is 16.1 GB. * RCFGBuilder took 5808.58 ms. Allocated memory was 98.6 MB in the beginning and 239.1 MB in the end (delta: 140.5 MB). Free memory was 69.9 MB in the beginning and 105.8 MB in the end (delta: -35.9 MB). Peak memory consumption was 162.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 599853.51 ms. Allocated memory was 239.1 MB in the beginning and 906.0 MB in the end (delta: 666.9 MB). Free memory was 104.8 MB in the beginning and 448.5 MB in the end (delta: -343.7 MB). Peak memory consumption was 493.1 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 19:52:49,105 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 19:52:49,107 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 19:52:49,140 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 19:52:49,141 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 19:52:49,142 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 19:52:49,144 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 19:52:49,146 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 19:52:49,148 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 19:52:49,150 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 19:52:49,151 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 19:52:49,152 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 19:52:49,152 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 19:52:49,153 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 19:52:49,154 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 19:52:49,155 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 19:52:49,156 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 19:52:49,156 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 19:52:49,158 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 19:52:49,160 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 19:52:49,161 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 19:52:49,162 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 19:52:49,163 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 19:52:49,163 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 19:52:49,166 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 19:52:49,166 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 19:52:49,166 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 19:52:49,167 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 19:52:49,168 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 19:52:49,168 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 19:52:49,169 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 19:52:49,169 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 19:52:49,170 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 19:52:49,170 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 19:52:49,171 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 19:52:49,171 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 19:52:49,172 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 19:52:49,172 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 19:52:49,172 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 19:52:49,173 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 19:52:49,173 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 19:52:49,174 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f951a96e-3a10-490a-bb59-a20253129c8a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2020-12-09 19:52:49,198 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 19:52:49,198 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 19:52:49,199 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 19:52:49,199 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 19:52:49,199 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 19:52:49,200 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 19:52:49,200 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 19:52:49,200 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 19:52:49,200 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 19:52:49,200 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 19:52:49,201 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 19:52:49,201 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 19:52:49,201 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 19:52:49,201 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 19:52:49,201 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 19:52:49,201 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 19:52:49,202 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 19:52:49,202 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-09 19:52:49,202 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-09 19:52:49,202 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 19:52:49,202 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 19:52:49,202 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 19:52:49,202 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 19:52:49,203 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 19:52:49,203 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-09 19:52:49,203 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 19:52:49,203 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 19:52:49,203 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 19:52:49,203 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 19:52:49,203 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 19:52:49,203 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-12-09 19:52:49,204 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2020-12-09 19:52:49,204 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 19:52:49,204 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 19:52:49,204 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 19:52:49,204 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_f951a96e-3a10-490a-bb59-a20253129c8a/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_f951a96e-3a10-490a-bb59-a20253129c8a/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 -> afdfdfa0b714beb09f09171cff02bdf038a0089f [2020-12-09 19:52:49,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 19:52:49,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 19:52:49,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 19:52:49,450 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 19:52:49,450 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 19:52:49,451 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f951a96e-3a10-490a-bb59-a20253129c8a/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem10_label00.c [2020-12-09 19:52:49,494 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f951a96e-3a10-490a-bb59-a20253129c8a/bin/utaipan/data/0ca08e9b7/371665d0fc9f413ea8025cd16c37e8b0/FLAG8aba077b7 [2020-12-09 19:52:49,931 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 19:52:49,932 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f951a96e-3a10-490a-bb59-a20253129c8a/sv-benchmarks/c/eca-rers2012/Problem10_label00.c [2020-12-09 19:52:49,943 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f951a96e-3a10-490a-bb59-a20253129c8a/bin/utaipan/data/0ca08e9b7/371665d0fc9f413ea8025cd16c37e8b0/FLAG8aba077b7 [2020-12-09 19:52:49,953 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f951a96e-3a10-490a-bb59-a20253129c8a/bin/utaipan/data/0ca08e9b7/371665d0fc9f413ea8025cd16c37e8b0 [2020-12-09 19:52:49,955 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 19:52:49,956 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 19:52:49,957 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 19:52:49,957 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 19:52:49,960 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 19:52:49,960 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:52:49" (1/1) ... [2020-12-09 19:52:49,962 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 07:52:49, skipping insertion in model container [2020-12-09 19:52:49,962 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:52:49" (1/1) ... [2020-12-09 19:52:49,967 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 19:52:49,999 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 19:52:50,130 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_f951a96e-3a10-490a-bb59-a20253129c8a/sv-benchmarks/c/eca-rers2012/Problem10_label00.c[5445,5458] [2020-12-09 19:52:50,242 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 19:52:50,254 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 19:52:50,285 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_f951a96e-3a10-490a-bb59-a20253129c8a/sv-benchmarks/c/eca-rers2012/Problem10_label00.c[5445,5458] [2020-12-09 19:52:50,358 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 19:52:50,374 INFO L208 MainTranslator]: Completed translation [2020-12-09 19:52:50,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:52:50 WrapperNode [2020-12-09 19:52:50,374 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 19:52:50,375 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 19:52:50,375 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 19:52:50,376 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 19:52:50,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:52:50" (1/1) ... [2020-12-09 19:52:50,404 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:52:50" (1/1) ... [2020-12-09 19:52:50,448 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 19:52:50,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 19:52:50,449 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 19:52:50,449 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 19:52:50,457 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:52:50" (1/1) ... [2020-12-09 19:52:50,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:52:50" (1/1) ... [2020-12-09 19:52:50,463 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:52:50" (1/1) ... [2020-12-09 19:52:50,464 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:52:50" (1/1) ... [2020-12-09 19:52:50,486 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:52:50" (1/1) ... [2020-12-09 19:52:50,495 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:52:50" (1/1) ... [2020-12-09 19:52:50,502 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:52:50" (1/1) ... [2020-12-09 19:52:50,509 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 19:52:50,510 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 19:52:50,510 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 19:52:50,510 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 19:52:50,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:52:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f951a96e-3a10-490a-bb59-a20253129c8a/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 19:52:50,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-12-09 19:52:50,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 19:52:50,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 19:52:50,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 19:52:52,674 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 19:52:52,674 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-09 19:52:52,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:52:52 BoogieIcfgContainer [2020-12-09 19:52:52,676 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 19:52:52,678 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 19:52:52,678 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 19:52:52,681 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 19:52:52,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:52:49" (1/3) ... [2020-12-09 19:52:52,682 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 07:52:52, skipping insertion in model container [2020-12-09 19:52:52,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:52:50" (2/3) ... [2020-12-09 19:52:52,682 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 07:52:52, skipping insertion in model container [2020-12-09 19:52:52,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:52:52" (3/3) ... [2020-12-09 19:52:52,683 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label00.c [2020-12-09 19:52:52,696 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 19:52:52,699 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 19:52:52,707 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 19:52:52,724 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 19:52:52,724 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 19:52:52,724 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 19:52:52,724 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 19:52:52,724 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 19:52:52,724 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 19:52:52,724 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 19:52:52,724 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 19:52:52,737 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states. [2020-12-09 19:52:52,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-12-09 19:52:52,742 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:52:52,742 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] [2020-12-09 19:52:52,743 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:52:52,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:52:52,746 INFO L82 PathProgramCache]: Analyzing trace with hash 433832817, now seen corresponding path program 1 times [2020-12-09 19:52:52,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:52:52,759 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1051340452] [2020-12-09 19:52:52,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f951a96e-3a10-490a-bb59-a20253129c8a/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 19:52:52,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:52:52,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 19:52:52,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:52:52,913 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 19:52:52,913 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:52:52,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1051340452] [2020-12-09 19:52:52,914 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:52:52,914 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 19:52:52,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267325967] [2020-12-09 19:52:52,917 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 19:52:52,917 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:52:52,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 19:52:52,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 19:52:52,928 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 3 states. [2020-12-09 19:52:55,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:52:55,557 INFO L93 Difference]: Finished difference Result 552 states and 966 transitions. [2020-12-09 19:52:55,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 19:52:55,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-12-09 19:52:55,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:52:55,567 INFO L225 Difference]: With dead ends: 552 [2020-12-09 19:52:55,568 INFO L226 Difference]: Without dead ends: 282 [2020-12-09 19:52:55,570 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 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 19:52:55,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-12-09 19:52:55,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2020-12-09 19:52:55,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-12-09 19:52:55,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 407 transitions. [2020-12-09 19:52:55,607 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 407 transitions. Word has length 47 [2020-12-09 19:52:55,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:52:55,608 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 407 transitions. [2020-12-09 19:52:55,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 19:52:55,608 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 407 transitions. [2020-12-09 19:52:55,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-12-09 19:52:55,611 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:52:55,611 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, 1, 1, 1, 1, 1, 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 19:52:55,812 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-09 19:52:55,813 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:52:55,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:52:55,816 INFO L82 PathProgramCache]: Analyzing trace with hash -313962871, now seen corresponding path program 1 times [2020-12-09 19:52:55,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:52:55,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [577667046] [2020-12-09 19:52:55,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f951a96e-3a10-490a-bb59-a20253129c8a/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 19:52:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:52:55,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 19:52:55,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:52:56,024 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:52:56,025 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:52:56,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [577667046] [2020-12-09 19:52:56,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:52:56,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 19:52:56,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835568105] [2020-12-09 19:52:56,026 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 19:52:56,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:52:56,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 19:52:56,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 19:52:56,027 INFO L87 Difference]: Start difference. First operand 282 states and 407 transitions. Second operand 3 states. [2020-12-09 19:52:58,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:52:58,592 INFO L93 Difference]: Finished difference Result 840 states and 1216 transitions. [2020-12-09 19:52:58,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 19:52:58,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2020-12-09 19:52:58,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:52:58,596 INFO L225 Difference]: With dead ends: 840 [2020-12-09 19:52:58,596 INFO L226 Difference]: Without dead ends: 560 [2020-12-09 19:52:58,598 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 113 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 19:52:58,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-12-09 19:52:58,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2020-12-09 19:52:58,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2020-12-09 19:52:58,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 735 transitions. [2020-12-09 19:52:58,620 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 735 transitions. Word has length 115 [2020-12-09 19:52:58,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:52:58,621 INFO L481 AbstractCegarLoop]: Abstraction has 560 states and 735 transitions. [2020-12-09 19:52:58,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 19:52:58,621 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 735 transitions. [2020-12-09 19:52:58,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-12-09 19:52:58,624 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:52:58,624 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:52:58,825 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-09 19:52:58,826 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:52:58,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:52:58,828 INFO L82 PathProgramCache]: Analyzing trace with hash -645117955, now seen corresponding path program 1 times [2020-12-09 19:52:58,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:52:58,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1262291556] [2020-12-09 19:52:58,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f951a96e-3a10-490a-bb59-a20253129c8a/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 19:52:58,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:52:58,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 19:52:58,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:52:59,019 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:52:59,019 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:52:59,019 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1262291556] [2020-12-09 19:52:59,019 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:52:59,019 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 19:52:59,019 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901431913] [2020-12-09 19:52:59,020 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 19:52:59,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:52:59,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 19:52:59,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 19:52:59,021 INFO L87 Difference]: Start difference. First operand 560 states and 735 transitions. Second operand 3 states. [2020-12-09 19:53:01,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:53:01,462 INFO L93 Difference]: Finished difference Result 1396 states and 1872 transitions. [2020-12-09 19:53:01,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 19:53:01,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2020-12-09 19:53:01,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:53:01,470 INFO L225 Difference]: With dead ends: 1396 [2020-12-09 19:53:01,470 INFO L226 Difference]: Without dead ends: 838 [2020-12-09 19:53:01,471 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 122 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 19:53:01,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2020-12-09 19:53:01,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2020-12-09 19:53:01,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2020-12-09 19:53:01,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1044 transitions. [2020-12-09 19:53:01,488 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1044 transitions. Word has length 124 [2020-12-09 19:53:01,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:53:01,489 INFO L481 AbstractCegarLoop]: Abstraction has 838 states and 1044 transitions. [2020-12-09 19:53:01,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 19:53:01,489 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1044 transitions. [2020-12-09 19:53:01,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2020-12-09 19:53:01,492 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:53:01,492 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:53:01,693 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-09 19:53:01,694 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:53:01,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:53:01,696 INFO L82 PathProgramCache]: Analyzing trace with hash 465685015, now seen corresponding path program 1 times [2020-12-09 19:53:01,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:53:01,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1255187874] [2020-12-09 19:53:01,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f951a96e-3a10-490a-bb59-a20253129c8a/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 19:53:01,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:53:01,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 19:53:01,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:53:02,158 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:53:02,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:53:02,475 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:53:02,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1255187874] [2020-12-09 19:53:02,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1598556825] [2020-12-09 19:53:02,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f951a96e-3a10-490a-bb59-a20253129c8a/bin/utaipan/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt [2020-12-09 19:53:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:53:02,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 19:53:02,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:53:02,681 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:53:02,681 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:53:02,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2020-12-09 19:53:02,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 7 [2020-12-09 19:53:02,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153298171] [2020-12-09 19:53:02,682 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 19:53:02,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:53:02,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 19:53:02,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-09 19:53:02,683 INFO L87 Difference]: Start difference. First operand 838 states and 1044 transitions. Second operand 3 states. [2020-12-09 19:53:05,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:53:05,140 INFO L93 Difference]: Finished difference Result 2091 states and 2635 transitions. [2020-12-09 19:53:05,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 19:53:05,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2020-12-09 19:53:05,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:53:05,144 INFO L225 Difference]: With dead ends: 2091 [2020-12-09 19:53:05,144 INFO L226 Difference]: Without dead ends: 838 [2020-12-09 19:53:05,145 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 472 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-09 19:53:05,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2020-12-09 19:53:05,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2020-12-09 19:53:05,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2020-12-09 19:53:05,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1015 transitions. [2020-12-09 19:53:05,159 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1015 transitions. Word has length 160 [2020-12-09 19:53:05,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:53:05,159 INFO L481 AbstractCegarLoop]: Abstraction has 838 states and 1015 transitions. [2020-12-09 19:53:05,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 19:53:05,159 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1015 transitions. [2020-12-09 19:53:05,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-12-09 19:53:05,161 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:53:05,161 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, 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 19:53:05,562 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3,6 cvc4 --incremental --print-success --lang smt [2020-12-09 19:53:05,564 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:53:05,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:53:05,565 INFO L82 PathProgramCache]: Analyzing trace with hash 737528586, now seen corresponding path program 1 times [2020-12-09 19:53:05,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:53:05,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [841722452] [2020-12-09 19:53:05,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f951a96e-3a10-490a-bb59-a20253129c8a/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 19:53:05,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:53:05,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 19:53:05,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:53:05,865 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:53:05,866 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:53:05,866 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [841722452] [2020-12-09 19:53:05,866 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:53:05,866 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 19:53:05,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21119675] [2020-12-09 19:53:05,867 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 19:53:05,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:53:05,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 19:53:05,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 19:53:05,868 INFO L87 Difference]: Start difference. First operand 838 states and 1015 transitions. Second operand 3 states. [2020-12-09 19:53:08,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:53:08,015 INFO L93 Difference]: Finished difference Result 1952 states and 2416 transitions. [2020-12-09 19:53:08,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 19:53:08,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2020-12-09 19:53:08,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:53:08,020 INFO L225 Difference]: With dead ends: 1952 [2020-12-09 19:53:08,020 INFO L226 Difference]: Without dead ends: 1116 [2020-12-09 19:53:08,021 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 188 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 19:53:08,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2020-12-09 19:53:08,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 977. [2020-12-09 19:53:08,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2020-12-09 19:53:08,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1163 transitions. [2020-12-09 19:53:08,036 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1163 transitions. Word has length 190 [2020-12-09 19:53:08,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:53:08,037 INFO L481 AbstractCegarLoop]: Abstraction has 977 states and 1163 transitions. [2020-12-09 19:53:08,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 19:53:08,037 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1163 transitions. [2020-12-09 19:53:08,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2020-12-09 19:53:08,039 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:53:08,039 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, 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] [2020-12-09 19:53:08,239 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-12-09 19:53:08,240 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:53:08,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:53:08,242 INFO L82 PathProgramCache]: Analyzing trace with hash 686002811, now seen corresponding path program 1 times [2020-12-09 19:53:08,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:53:08,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1315725211] [2020-12-09 19:53:08,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f951a96e-3a10-490a-bb59-a20253129c8a/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 19:53:08,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:53:08,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 19:53:08,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:53:08,595 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2020-12-09 19:53:08,595 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:53:08,595 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1315725211] [2020-12-09 19:53:08,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:53:08,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 19:53:08,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964354344] [2020-12-09 19:53:08,596 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 19:53:08,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:53:08,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 19:53:08,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 19:53:08,597 INFO L87 Difference]: Start difference. First operand 977 states and 1163 transitions. Second operand 3 states. [2020-12-09 19:53:10,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:53:10,287 INFO L93 Difference]: Finished difference Result 2091 states and 2471 transitions. [2020-12-09 19:53:10,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 19:53:10,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2020-12-09 19:53:10,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:53:10,294 INFO L225 Difference]: With dead ends: 2091 [2020-12-09 19:53:10,294 INFO L226 Difference]: Without dead ends: 1116 [2020-12-09 19:53:10,295 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 195 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 19:53:10,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2020-12-09 19:53:10,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1116. [2020-12-09 19:53:10,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1116 states. [2020-12-09 19:53:10,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1306 transitions. [2020-12-09 19:53:10,310 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1306 transitions. Word has length 197 [2020-12-09 19:53:10,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:53:10,311 INFO L481 AbstractCegarLoop]: Abstraction has 1116 states and 1306 transitions. [2020-12-09 19:53:10,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 19:53:10,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1306 transitions. [2020-12-09 19:53:10,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2020-12-09 19:53:10,313 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:53:10,313 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:53:10,513 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-12-09 19:53:10,514 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:53:10,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:53:10,514 INFO L82 PathProgramCache]: Analyzing trace with hash -265661732, now seen corresponding path program 1 times [2020-12-09 19:53:10,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:53:10,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [489307010] [2020-12-09 19:53:10,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f951a96e-3a10-490a-bb59-a20253129c8a/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 19:53:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:53:10,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 19:53:10,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:53:10,810 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 89 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:53:10,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:53:11,424 WARN L197 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2020-12-09 19:53:11,764 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 89 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:53:11,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [489307010] [2020-12-09 19:53:11,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [690800588] [2020-12-09 19:53:11,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f951a96e-3a10-490a-bb59-a20253129c8a/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 19:53:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:53:11,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 19:53:11,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:53:12,097 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2020-12-09 19:53:12,098 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:53:12,098 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2020-12-09 19:53:12,098 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 7 [2020-12-09 19:53:12,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173496201] [2020-12-09 19:53:12,099 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 19:53:12,099 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:53:12,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 19:53:12,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-09 19:53:12,099 INFO L87 Difference]: Start difference. First operand 1116 states and 1306 transitions. Second operand 3 states. [2020-12-09 19:53:14,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:53:14,018 INFO L93 Difference]: Finished difference Result 2369 states and 2793 transitions. [2020-12-09 19:53:14,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 19:53:14,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2020-12-09 19:53:14,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:53:14,027 INFO L225 Difference]: With dead ends: 2369 [2020-12-09 19:53:14,027 INFO L226 Difference]: Without dead ends: 1394 [2020-12-09 19:53:14,028 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 702 GetRequests, 697 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-09 19:53:14,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-12-09 19:53:14,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1394. [2020-12-09 19:53:14,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1394 states. [2020-12-09 19:53:14,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1611 transitions. [2020-12-09 19:53:14,049 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1611 transitions. Word has length 235 [2020-12-09 19:53:14,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:53:14,049 INFO L481 AbstractCegarLoop]: Abstraction has 1394 states and 1611 transitions. [2020-12-09 19:53:14,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 19:53:14,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1611 transitions. [2020-12-09 19:53:14,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2020-12-09 19:53:14,055 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:53:14,055 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:53:14,457 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 19:53:14,458 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:53:14,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:53:14,460 INFO L82 PathProgramCache]: Analyzing trace with hash 535210299, now seen corresponding path program 1 times [2020-12-09 19:53:14,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:53:14,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [314718947] [2020-12-09 19:53:14,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f951a96e-3a10-490a-bb59-a20253129c8a/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 19:53:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:53:14,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 19:53:14,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:53:14,906 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 272 proven. 72 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2020-12-09 19:53:14,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:53:15,768 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 272 proven. 72 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2020-12-09 19:53:15,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [314718947] [2020-12-09 19:53:15,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [660185785] [2020-12-09 19:53:15,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f951a96e-3a10-490a-bb59-a20253129c8a/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 19:53:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:53:15,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 19:53:15,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:53:16,352 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2020-12-09 19:53:16,352 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:53:16,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2020-12-09 19:53:16,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3, 3] total 8 [2020-12-09 19:53:16,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995904247] [2020-12-09 19:53:16,354 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 19:53:16,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:53:16,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 19:53:16,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-12-09 19:53:16,354 INFO L87 Difference]: Start difference. First operand 1394 states and 1611 transitions. Second operand 4 states. [2020-12-09 19:53:18,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:53:18,948 INFO L93 Difference]: Finished difference Result 2935 states and 3475 transitions. [2020-12-09 19:53:18,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 19:53:18,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 346 [2020-12-09 19:53:18,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:53:18,954 INFO L225 Difference]: With dead ends: 2935 [2020-12-09 19:53:18,954 INFO L226 Difference]: Without dead ends: 1682 [2020-12-09 19:53:18,956 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1035 GetRequests, 1029 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-12-09 19:53:18,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2020-12-09 19:53:18,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1533. [2020-12-09 19:53:18,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1533 states. [2020-12-09 19:53:18,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 1765 transitions. [2020-12-09 19:53:18,978 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 1765 transitions. Word has length 346 [2020-12-09 19:53:18,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:53:18,979 INFO L481 AbstractCegarLoop]: Abstraction has 1533 states and 1765 transitions. [2020-12-09 19:53:18,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 19:53:18,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 1765 transitions. [2020-12-09 19:53:18,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2020-12-09 19:53:18,981 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:53:18,982 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:53:19,383 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3,12 cvc4 --incremental --print-success --lang smt [2020-12-09 19:53:19,384 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:53:19,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:53:19,386 INFO L82 PathProgramCache]: Analyzing trace with hash -464676238, now seen corresponding path program 1 times [2020-12-09 19:53:19,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:53:19,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [561778239] [2020-12-09 19:53:19,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f951a96e-3a10-490a-bb59-a20253129c8a/bin/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2020-12-09 19:53:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:53:19,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 19:53:19,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:53:19,812 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 134 proven. 177 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2020-12-09 19:53:19,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:53:20,498 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 311 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2020-12-09 19:53:20,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [561778239] [2020-12-09 19:53:20,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-09 19:53:20,499 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2020-12-09 19:53:20,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886287643] [2020-12-09 19:53:20,499 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 19:53:20,499 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:53:20,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 19:53:20,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-09 19:53:20,500 INFO L87 Difference]: Start difference. First operand 1533 states and 1765 transitions. Second operand 4 states. [2020-12-09 19:54:12,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:54:12,925 INFO L93 Difference]: Finished difference Result 4176 states and 4788 transitions. [2020-12-09 19:54:12,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 19:54:12,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 347 [2020-12-09 19:54:12,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:54:12,943 INFO L225 Difference]: With dead ends: 4176 [2020-12-09 19:54:12,943 INFO L226 Difference]: Without dead ends: 2784 [2020-12-09 19:54:12,944 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 692 GetRequests, 688 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-09 19:54:12,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2020-12-09 19:54:12,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 2506. [2020-12-09 19:54:12,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2506 states. [2020-12-09 19:54:12,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 2811 transitions. [2020-12-09 19:54:12,975 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 2811 transitions. Word has length 347 [2020-12-09 19:54:12,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:54:12,975 INFO L481 AbstractCegarLoop]: Abstraction has 2506 states and 2811 transitions. [2020-12-09 19:54:12,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 19:54:12,975 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 2811 transitions. [2020-12-09 19:54:12,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2020-12-09 19:54:12,979 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:54:12,979 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:54:13,180 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2020-12-09 19:54:13,180 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:54:13,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:54:13,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1075861398, now seen corresponding path program 1 times [2020-12-09 19:54:13,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:54:13,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [942320845] [2020-12-09 19:54:13,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f951a96e-3a10-490a-bb59-a20253129c8a/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 19:54:13,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:54:13,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 19:54:13,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:54:13,804 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 111 proven. 294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:54:13,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:54:14,976 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 317 proven. 8 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2020-12-09 19:54:14,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [942320845] [2020-12-09 19:54:14,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [511557369] [2020-12-09 19:54:14,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f951a96e-3a10-490a-bb59-a20253129c8a/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 19:54:15,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:54:15,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 19:54:15,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:54:15,611 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2020-12-09 19:54:15,611 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:54:15,612 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2020-12-09 19:54:15,612 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 4] total 11 [2020-12-09 19:54:15,612 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737340432] [2020-12-09 19:54:15,612 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 19:54:15,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:54:15,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 19:54:15,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-12-09 19:54:15,613 INFO L87 Difference]: Start difference. First operand 2506 states and 2811 transitions. Second operand 5 states. [2020-12-09 19:54:19,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:54:19,594 INFO L93 Difference]: Finished difference Result 5041 states and 5662 transitions. [2020-12-09 19:54:19,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 19:54:19,595 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 360 [2020-12-09 19:54:19,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:54:19,604 INFO L225 Difference]: With dead ends: 5041 [2020-12-09 19:54:19,604 INFO L226 Difference]: Without dead ends: 2676 [2020-12-09 19:54:19,605 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1079 GetRequests, 1068 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-12-09 19:54:19,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2676 states. [2020-12-09 19:54:19,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2676 to 2367. [2020-12-09 19:54:19,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2367 states. [2020-12-09 19:54:19,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 2367 states and 2562 transitions. [2020-12-09 19:54:19,631 INFO L78 Accepts]: Start accepts. Automaton has 2367 states and 2562 transitions. Word has length 360 [2020-12-09 19:54:19,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:54:19,632 INFO L481 AbstractCegarLoop]: Abstraction has 2367 states and 2562 transitions. [2020-12-09 19:54:19,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 19:54:19,632 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 2562 transitions. [2020-12-09 19:54:19,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2020-12-09 19:54:19,635 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:54:19,635 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:54:20,036 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 19:54:20,037 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:54:20,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:54:20,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1812872635, now seen corresponding path program 1 times [2020-12-09 19:54:20,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:54:20,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1914089597] [2020-12-09 19:54:20,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f951a96e-3a10-490a-bb59-a20253129c8a/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 19:54:20,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:54:20,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 19:54:20,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:54:20,885 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 134 proven. 271 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:54:20,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:54:22,794 WARN L197 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 22 DAG size of output: 8 [2020-12-09 19:54:23,230 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2020-12-09 19:54:23,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1914089597] [2020-12-09 19:54:23,230 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-09 19:54:23,230 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2020-12-09 19:54:23,230 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121893637] [2020-12-09 19:54:23,231 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 19:54:23,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:54:23,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 19:54:23,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-12-09 19:54:23,231 INFO L87 Difference]: Start difference. First operand 2367 states and 2562 transitions. Second operand 5 states. [2020-12-09 19:54:26,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:54:26,140 INFO L93 Difference]: Finished difference Result 4771 states and 5175 transitions. [2020-12-09 19:54:26,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 19:54:26,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 361 [2020-12-09 19:54:26,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:54:26,151 INFO L225 Difference]: With dead ends: 4771 [2020-12-09 19:54:26,151 INFO L226 Difference]: Without dead ends: 2545 [2020-12-09 19:54:26,152 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 722 GetRequests, 714 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-09 19:54:26,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2545 states. [2020-12-09 19:54:26,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2545 to 2506. [2020-12-09 19:54:26,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2506 states. [2020-12-09 19:54:26,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 2706 transitions. [2020-12-09 19:54:26,181 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 2706 transitions. Word has length 361 [2020-12-09 19:54:26,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:54:26,182 INFO L481 AbstractCegarLoop]: Abstraction has 2506 states and 2706 transitions. [2020-12-09 19:54:26,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 19:54:26,182 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 2706 transitions. [2020-12-09 19:54:26,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2020-12-09 19:54:26,186 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:54:26,186 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:54:26,386 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2020-12-09 19:54:26,387 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:54:26,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:54:26,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1254420789, now seen corresponding path program 1 times [2020-12-09 19:54:26,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:54:26,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1746949216] [2020-12-09 19:54:26,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f951a96e-3a10-490a-bb59-a20253129c8a/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 19:54:26,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:54:26,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 19:54:26,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:54:27,111 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 134 proven. 316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:54:27,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:54:28,193 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 352 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:54:28,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1746949216] [2020-12-09 19:54:28,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1993407837] [2020-12-09 19:54:28,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f951a96e-3a10-490a-bb59-a20253129c8a/bin/utaipan/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt [2020-12-09 19:54:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:54:28,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 19:54:28,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:54:29,181 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:54:29,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:54:30,130 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 262 proven. 188 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:54:30,130 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545282771] [2020-12-09 19:54:30,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f951a96e-3a10-490a-bb59-a20253129c8a/bin/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:54:30,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:54:30,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 19:54:30,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:54:30,972 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2020-12-09 19:54:30,972 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:54:30,973 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 4 imperfect interpolant sequences. [2020-12-09 19:54:30,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 5, 6, 6] total 13 [2020-12-09 19:54:30,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292723632] [2020-12-09 19:54:30,974 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 19:54:30,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:54:30,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 19:54:30,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-12-09 19:54:30,974 INFO L87 Difference]: Start difference. First operand 2506 states and 2706 transitions. Second operand 3 states. [2020-12-09 19:54:38,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:54:38,582 INFO L93 Difference]: Finished difference Result 4869 states and 5266 transitions. [2020-12-09 19:54:38,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 19:54:38,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 400 [2020-12-09 19:54:38,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:54:38,587 INFO L225 Difference]: With dead ends: 4869 [2020-12-09 19:54:38,587 INFO L226 Difference]: Without dead ends: 0 [2020-12-09 19:54:38,590 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1995 GetRequests, 1982 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-12-09 19:54:38,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-09 19:54:38,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-09 19:54:38,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-09 19:54:38,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-09 19:54:38,590 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 400 [2020-12-09 19:54:38,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:54:38,591 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-09 19:54:38,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 19:54:38,591 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-09 19:54:38,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-09 19:54:39,192 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3,19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,18 cvc4 --incremental --print-success --lang smt [2020-12-09 19:54:39,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-09 19:54:39,309 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 82 [2020-12-09 19:54:43,018 WARN L197 SmtUtils]: Spent 3.68 s on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2020-12-09 19:54:46,674 WARN L197 SmtUtils]: Spent 3.66 s on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2020-12-09 19:54:46,678 INFO L262 CegarLoopResult]: For program point L597(line 597) no Hoare annotation was computed. [2020-12-09 19:54:46,678 INFO L262 CegarLoopResult]: For program point L564(lines 564 582) no Hoare annotation was computed. [2020-12-09 19:54:46,678 INFO L262 CegarLoopResult]: For program point L333(lines 333 582) no Hoare annotation was computed. [2020-12-09 19:54:46,678 INFO L262 CegarLoopResult]: For program point L367(lines 367 582) no Hoare annotation was computed. [2020-12-09 19:54:46,678 INFO L262 CegarLoopResult]: For program point L301(lines 301 582) no Hoare annotation was computed. [2020-12-09 19:54:46,678 INFO L262 CegarLoopResult]: For program point L235(lines 235 582) no Hoare annotation was computed. [2020-12-09 19:54:46,679 INFO L262 CegarLoopResult]: For program point L202-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,679 INFO L262 CegarLoopResult]: For program point L169-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,679 INFO L262 CegarLoopResult]: For program point L136-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,679 INFO L262 CegarLoopResult]: For program point L103-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,679 INFO L262 CegarLoopResult]: For program point L70-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,679 INFO L262 CegarLoopResult]: For program point L37-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,679 INFO L262 CegarLoopResult]: For program point L533(lines 533 582) no Hoare annotation was computed. [2020-12-09 19:54:46,679 INFO L262 CegarLoopResult]: For program point L203(line 203) no Hoare annotation was computed. [2020-12-09 19:54:46,679 INFO L262 CegarLoopResult]: For program point L170(line 170) no Hoare annotation was computed. [2020-12-09 19:54:46,679 INFO L262 CegarLoopResult]: For program point L137(line 137) no Hoare annotation was computed. [2020-12-09 19:54:46,680 INFO L262 CegarLoopResult]: For program point L104(line 104) no Hoare annotation was computed. [2020-12-09 19:54:46,680 INFO L262 CegarLoopResult]: For program point L71(line 71) no Hoare annotation was computed. [2020-12-09 19:54:46,680 INFO L262 CegarLoopResult]: For program point L38(line 38) no Hoare annotation was computed. [2020-12-09 19:54:46,680 INFO L262 CegarLoopResult]: For program point L567(lines 567 582) no Hoare annotation was computed. [2020-12-09 19:54:46,680 INFO L262 CegarLoopResult]: For program point L435(lines 435 582) no Hoare annotation was computed. [2020-12-09 19:54:46,680 INFO L262 CegarLoopResult]: For program point L336(lines 336 582) no Hoare annotation was computed. [2020-12-09 19:54:46,680 INFO L262 CegarLoopResult]: For program point L270(lines 270 582) no Hoare annotation was computed. [2020-12-09 19:54:46,680 INFO L262 CegarLoopResult]: For program point L403(lines 403 582) no Hoare annotation was computed. [2020-12-09 19:54:46,680 INFO L262 CegarLoopResult]: For program point L370(lines 370 582) no Hoare annotation was computed. [2020-12-09 19:54:46,680 INFO L262 CegarLoopResult]: For program point L205-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,681 INFO L262 CegarLoopResult]: For program point L172-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,681 INFO L262 CegarLoopResult]: For program point L139-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,681 INFO L262 CegarLoopResult]: For program point L106-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,681 INFO L262 CegarLoopResult]: For program point L73-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,681 INFO L262 CegarLoopResult]: For program point L40-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,681 INFO L262 CegarLoopResult]: For program point L536(lines 536 582) no Hoare annotation was computed. [2020-12-09 19:54:46,681 INFO L262 CegarLoopResult]: For program point L503(lines 503 582) no Hoare annotation was computed. [2020-12-09 19:54:46,681 INFO L262 CegarLoopResult]: For program point L470(lines 470 582) no Hoare annotation was computed. [2020-12-09 19:54:46,681 INFO L262 CegarLoopResult]: For program point L206(line 206) no Hoare annotation was computed. [2020-12-09 19:54:46,681 INFO L262 CegarLoopResult]: For program point L173(line 173) no Hoare annotation was computed. [2020-12-09 19:54:46,682 INFO L262 CegarLoopResult]: For program point L140(line 140) no Hoare annotation was computed. [2020-12-09 19:54:46,682 INFO L262 CegarLoopResult]: For program point L107(line 107) no Hoare annotation was computed. [2020-12-09 19:54:46,682 INFO L262 CegarLoopResult]: For program point L74(line 74) no Hoare annotation was computed. [2020-12-09 19:54:46,682 INFO L262 CegarLoopResult]: For program point L41(line 41) no Hoare annotation was computed. [2020-12-09 19:54:46,682 INFO L262 CegarLoopResult]: For program point L339(lines 339 582) no Hoare annotation was computed. [2020-12-09 19:54:46,682 INFO L262 CegarLoopResult]: For program point L306(lines 306 582) no Hoare annotation was computed. [2020-12-09 19:54:46,682 INFO L262 CegarLoopResult]: For program point L241(lines 241 582) no Hoare annotation was computed. [2020-12-09 19:54:46,682 INFO L262 CegarLoopResult]: For program point L208-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,682 INFO L262 CegarLoopResult]: For program point L175-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,682 INFO L262 CegarLoopResult]: For program point L142-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,682 INFO L262 CegarLoopResult]: For program point L109-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,683 INFO L262 CegarLoopResult]: For program point L76-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,683 INFO L262 CegarLoopResult]: For program point L43-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,683 INFO L262 CegarLoopResult]: For program point L539(lines 539 582) no Hoare annotation was computed. [2020-12-09 19:54:46,683 INFO L262 CegarLoopResult]: For program point L440(lines 440 582) no Hoare annotation was computed. [2020-12-09 19:54:46,683 INFO L262 CegarLoopResult]: For program point L275(lines 275 582) no Hoare annotation was computed. [2020-12-09 19:54:46,683 INFO L262 CegarLoopResult]: For program point L209(line 209) no Hoare annotation was computed. [2020-12-09 19:54:46,683 INFO L262 CegarLoopResult]: For program point L176(line 176) no Hoare annotation was computed. [2020-12-09 19:54:46,683 INFO L262 CegarLoopResult]: For program point L143(line 143) no Hoare annotation was computed. [2020-12-09 19:54:46,683 INFO L262 CegarLoopResult]: For program point L110(line 110) no Hoare annotation was computed. [2020-12-09 19:54:46,683 INFO L262 CegarLoopResult]: For program point L77(line 77) no Hoare annotation was computed. [2020-12-09 19:54:46,683 INFO L262 CegarLoopResult]: For program point L44(line 44) no Hoare annotation was computed. [2020-12-09 19:54:46,683 INFO L262 CegarLoopResult]: For program point L573(lines 573 582) no Hoare annotation was computed. [2020-12-09 19:54:46,684 INFO L262 CegarLoopResult]: For program point L408(lines 408 582) no Hoare annotation was computed. [2020-12-09 19:54:46,684 INFO L262 CegarLoopResult]: For program point L375(lines 375 582) no Hoare annotation was computed. [2020-12-09 19:54:46,684 INFO L262 CegarLoopResult]: For program point L475(lines 475 582) no Hoare annotation was computed. [2020-12-09 19:54:46,684 INFO L262 CegarLoopResult]: For program point L211-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,684 INFO L262 CegarLoopResult]: For program point L178-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,684 INFO L262 CegarLoopResult]: For program point L145-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,684 INFO L262 CegarLoopResult]: For program point L112-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,684 INFO L262 CegarLoopResult]: For program point L79-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,684 INFO L262 CegarLoopResult]: For program point L46-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,684 INFO L262 CegarLoopResult]: For program point L509(lines 509 582) no Hoare annotation was computed. [2020-12-09 19:54:46,684 INFO L262 CegarLoopResult]: For program point L311(lines 311 582) no Hoare annotation was computed. [2020-12-09 19:54:46,684 INFO L262 CegarLoopResult]: For program point L212(line 212) no Hoare annotation was computed. [2020-12-09 19:54:46,684 INFO L262 CegarLoopResult]: For program point L179(line 179) no Hoare annotation was computed. [2020-12-09 19:54:46,684 INFO L262 CegarLoopResult]: For program point L146(line 146) no Hoare annotation was computed. [2020-12-09 19:54:46,684 INFO L262 CegarLoopResult]: For program point L113(line 113) no Hoare annotation was computed. [2020-12-09 19:54:46,684 INFO L262 CegarLoopResult]: For program point L80(line 80) no Hoare annotation was computed. [2020-12-09 19:54:46,684 INFO L262 CegarLoopResult]: For program point L47(line 47) no Hoare annotation was computed. [2020-12-09 19:54:46,684 INFO L262 CegarLoopResult]: For program point L345(lines 345 582) no Hoare annotation was computed. [2020-12-09 19:54:46,685 INFO L262 CegarLoopResult]: For program point L246(lines 246 582) no Hoare annotation was computed. [2020-12-09 19:54:46,685 INFO L262 CegarLoopResult]: For program point L544(lines 544 582) no Hoare annotation was computed. [2020-12-09 19:54:46,685 INFO L262 CegarLoopResult]: For program point L181-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,685 INFO L262 CegarLoopResult]: For program point L148-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,685 INFO L262 CegarLoopResult]: For program point L115-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,685 INFO L262 CegarLoopResult]: For program point L82-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,685 INFO L262 CegarLoopResult]: For program point L49-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,685 INFO L262 CegarLoopResult]: For program point L446(lines 446 582) no Hoare annotation was computed. [2020-12-09 19:54:46,685 INFO L262 CegarLoopResult]: For program point L413(lines 413 582) no Hoare annotation was computed. [2020-12-09 19:54:46,685 INFO L262 CegarLoopResult]: For program point L380(lines 380 582) no Hoare annotation was computed. [2020-12-09 19:54:46,685 INFO L262 CegarLoopResult]: For program point L281(lines 281 582) no Hoare annotation was computed. [2020-12-09 19:54:46,685 INFO L262 CegarLoopResult]: For program point L182(line 182) no Hoare annotation was computed. [2020-12-09 19:54:46,685 INFO L262 CegarLoopResult]: For program point L149(line 149) no Hoare annotation was computed. [2020-12-09 19:54:46,685 INFO L262 CegarLoopResult]: For program point L116(line 116) no Hoare annotation was computed. [2020-12-09 19:54:46,685 INFO L262 CegarLoopResult]: For program point L83(line 83) no Hoare annotation was computed. [2020-12-09 19:54:46,685 INFO L262 CegarLoopResult]: For program point L50(line 50) no Hoare annotation was computed. [2020-12-09 19:54:46,685 INFO L262 CegarLoopResult]: For program point L579(lines 579 582) no Hoare annotation was computed. [2020-12-09 19:54:46,685 INFO L262 CegarLoopResult]: For program point L249(lines 249 582) no Hoare annotation was computed. [2020-12-09 19:54:46,686 INFO L262 CegarLoopResult]: For program point L514(lines 514 582) no Hoare annotation was computed. [2020-12-09 19:54:46,686 INFO L262 CegarLoopResult]: For program point L481(lines 481 582) no Hoare annotation was computed. [2020-12-09 19:54:46,686 INFO L262 CegarLoopResult]: For program point L316(lines 316 582) no Hoare annotation was computed. [2020-12-09 19:54:46,686 INFO L262 CegarLoopResult]: For program point L184-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,686 INFO L262 CegarLoopResult]: For program point L151-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,686 INFO L262 CegarLoopResult]: For program point L118-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,686 INFO L262 CegarLoopResult]: For program point L85-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,686 INFO L262 CegarLoopResult]: For program point L52-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,686 INFO L262 CegarLoopResult]: For program point L350(lines 350 582) no Hoare annotation was computed. [2020-12-09 19:54:46,686 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-09 19:54:46,686 INFO L262 CegarLoopResult]: For program point L185(line 185) no Hoare annotation was computed. [2020-12-09 19:54:46,686 INFO L262 CegarLoopResult]: For program point L152(line 152) no Hoare annotation was computed. [2020-12-09 19:54:46,686 INFO L262 CegarLoopResult]: For program point L119(line 119) no Hoare annotation was computed. [2020-12-09 19:54:46,686 INFO L262 CegarLoopResult]: For program point L86(line 86) no Hoare annotation was computed. [2020-12-09 19:54:46,686 INFO L262 CegarLoopResult]: For program point L53(line 53) no Hoare annotation was computed. [2020-12-09 19:54:46,687 INFO L258 CegarLoopResult]: At program point L583(lines 30 584) the Hoare annotation is: (let ((.cse0 (= ~a4~0 (_ bv14 32)))) (let ((.cse1 (= (_ bv0 32) ~a10~0)) (.cse4 (or (not (= (_ bv6 32) ~a19~0)) (not .cse0) (not (bvsge (_ bv38 32) ~a1~0)))) (.cse3 (not (bvsge (_ bv218 32) (bvadd (bvsdiv (bvmul (bvsdiv ~a1~0 (_ bv5 32)) (_ bv5 32)) (_ bv5 32)) (_ bv505228 32))))) (.cse2 (= (_ bv0 32) ~a12~0))) (or (and .cse0 (= (_ bv9 32) ~a19~0) .cse1 .cse2) (and .cse0 (= (_ bv3 32) ~a10~0) .cse3 .cse2) (and (= (_ bv2 32) ~a10~0) .cse0 .cse2 .cse4) (and .cse0 .cse1 (= (_ bv10 32) ~a19~0) .cse3 .cse2) (and .cse0 .cse1 (exists ((v_~a1~0_375 (_ BitVec 32))) (and (bvsge (_ bv38 32) v_~a1~0_375) (= (bvadd ~a1~0 (_ bv495232 32)) (bvsdiv (bvadd v_~a1~0_375 (_ bv4294683943 32)) (_ bv5 32))) (bvslt (_ bv4294967283 32) v_~a1~0_375))) .cse2) (= (_ bv8 32) ~a19~0) (and .cse0 (= (_ bv1 32) ~a10~0) .cse3 .cse2 .cse4) (and .cse0 (= (_ bv4 32) ~a10~0) .cse3 .cse2)))) [2020-12-09 19:54:46,687 INFO L262 CegarLoopResult]: For program point L550(lines 550 582) no Hoare annotation was computed. [2020-12-09 19:54:46,687 INFO L262 CegarLoopResult]: For program point L418(lines 418 582) no Hoare annotation was computed. [2020-12-09 19:54:46,687 INFO L262 CegarLoopResult]: For program point L385(lines 385 582) no Hoare annotation was computed. [2020-12-09 19:54:46,687 INFO L262 CegarLoopResult]: For program point L220(lines 220 582) no Hoare annotation was computed. [2020-12-09 19:54:46,687 INFO L262 CegarLoopResult]: For program point L187-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,687 INFO L262 CegarLoopResult]: For program point L154-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,687 INFO L262 CegarLoopResult]: For program point L121-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,687 INFO L262 CegarLoopResult]: For program point L88-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,687 INFO L262 CegarLoopResult]: For program point L55-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,687 INFO L262 CegarLoopResult]: For program point L452(lines 452 582) no Hoare annotation was computed. [2020-12-09 19:54:46,687 INFO L262 CegarLoopResult]: For program point L287(lines 287 582) no Hoare annotation was computed. [2020-12-09 19:54:46,687 INFO L262 CegarLoopResult]: For program point L254(lines 254 582) no Hoare annotation was computed. [2020-12-09 19:54:46,687 INFO L262 CegarLoopResult]: For program point L188(line 188) no Hoare annotation was computed. [2020-12-09 19:54:46,687 INFO L262 CegarLoopResult]: For program point L155(line 155) no Hoare annotation was computed. [2020-12-09 19:54:46,687 INFO L262 CegarLoopResult]: For program point L122(line 122) no Hoare annotation was computed. [2020-12-09 19:54:46,687 INFO L262 CegarLoopResult]: For program point L89(line 89) no Hoare annotation was computed. [2020-12-09 19:54:46,688 INFO L262 CegarLoopResult]: For program point L56(line 56) no Hoare annotation was computed. [2020-12-09 19:54:46,688 INFO L262 CegarLoopResult]: For program point L519(lines 519 582) no Hoare annotation was computed. [2020-12-09 19:54:46,688 INFO L262 CegarLoopResult]: For program point L486(lines 486 582) no Hoare annotation was computed. [2020-12-09 19:54:46,688 INFO L265 CegarLoopResult]: At program point L586(lines 586 602) the Hoare annotation is: true [2020-12-09 19:54:46,688 INFO L262 CegarLoopResult]: For program point L388(lines 388 582) no Hoare annotation was computed. [2020-12-09 19:54:46,688 INFO L262 CegarLoopResult]: For program point L355(lines 355 582) no Hoare annotation was computed. [2020-12-09 19:54:46,688 INFO L262 CegarLoopResult]: For program point L322(lines 322 582) no Hoare annotation was computed. [2020-12-09 19:54:46,688 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-09 19:54:46,688 INFO L262 CegarLoopResult]: For program point L190-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,688 INFO L262 CegarLoopResult]: For program point L157-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,688 INFO L262 CegarLoopResult]: For program point L124-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,688 INFO L262 CegarLoopResult]: For program point L91-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,688 INFO L262 CegarLoopResult]: For program point L58-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,688 INFO L262 CegarLoopResult]: For program point L191(line 191) no Hoare annotation was computed. [2020-12-09 19:54:46,688 INFO L262 CegarLoopResult]: For program point L158(line 158) no Hoare annotation was computed. [2020-12-09 19:54:46,688 INFO L262 CegarLoopResult]: For program point L125(line 125) no Hoare annotation was computed. [2020-12-09 19:54:46,688 INFO L262 CegarLoopResult]: For program point L92(line 92) no Hoare annotation was computed. [2020-12-09 19:54:46,688 INFO L262 CegarLoopResult]: For program point L59(line 59) no Hoare annotation was computed. [2020-12-09 19:54:46,689 INFO L262 CegarLoopResult]: For program point L555(lines 555 582) no Hoare annotation was computed. [2020-12-09 19:54:46,689 INFO L262 CegarLoopResult]: For program point L225(lines 225 582) no Hoare annotation was computed. [2020-12-09 19:54:46,689 INFO L262 CegarLoopResult]: For program point L424(lines 424 582) no Hoare annotation was computed. [2020-12-09 19:54:46,689 INFO L262 CegarLoopResult]: For program point L259(lines 259 582) no Hoare annotation was computed. [2020-12-09 19:54:46,689 INFO L262 CegarLoopResult]: For program point L193-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,689 INFO L262 CegarLoopResult]: For program point L160-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,689 INFO L262 CegarLoopResult]: For program point L127-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,689 INFO L262 CegarLoopResult]: For program point L94-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,689 INFO L262 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-09 19:54:46,689 INFO L262 CegarLoopResult]: For program point L61-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,689 INFO L262 CegarLoopResult]: For program point L524(lines 524 582) no Hoare annotation was computed. [2020-12-09 19:54:46,689 INFO L262 CegarLoopResult]: For program point L491(lines 491 582) no Hoare annotation was computed. [2020-12-09 19:54:46,689 INFO L262 CegarLoopResult]: For program point L458(lines 458 582) no Hoare annotation was computed. [2020-12-09 19:54:46,689 INFO L262 CegarLoopResult]: For program point L293(lines 293 582) no Hoare annotation was computed. [2020-12-09 19:54:46,689 INFO L262 CegarLoopResult]: For program point L194(line 194) no Hoare annotation was computed. [2020-12-09 19:54:46,689 INFO L262 CegarLoopResult]: For program point L161(line 161) no Hoare annotation was computed. [2020-12-09 19:54:46,689 INFO L262 CegarLoopResult]: For program point L128(line 128) no Hoare annotation was computed. [2020-12-09 19:54:46,689 INFO L262 CegarLoopResult]: For program point L95(line 95) no Hoare annotation was computed. [2020-12-09 19:54:46,690 INFO L262 CegarLoopResult]: For program point L62(line 62) no Hoare annotation was computed. [2020-12-09 19:54:46,690 INFO L262 CegarLoopResult]: For program point L558(lines 558 582) no Hoare annotation was computed. [2020-12-09 19:54:46,690 INFO L262 CegarLoopResult]: For program point L393(lines 393 582) no Hoare annotation was computed. [2020-12-09 19:54:46,690 INFO L262 CegarLoopResult]: For program point L327(lines 327 582) no Hoare annotation was computed. [2020-12-09 19:54:46,690 INFO L258 CegarLoopResult]: At program point L592-2(lines 592 601) the Hoare annotation is: (let ((.cse0 (= ~a4~0 (_ bv14 32)))) (let ((.cse1 (= (_ bv0 32) ~a10~0)) (.cse4 (or (not (= (_ bv6 32) ~a19~0)) (not .cse0) (not (bvsge (_ bv38 32) ~a1~0)))) (.cse3 (not (bvsge (_ bv218 32) (bvadd (bvsdiv (bvmul (bvsdiv ~a1~0 (_ bv5 32)) (_ bv5 32)) (_ bv5 32)) (_ bv505228 32))))) (.cse2 (= (_ bv0 32) ~a12~0))) (or (and .cse0 (= (_ bv9 32) ~a19~0) .cse1 .cse2) (and .cse0 (= (_ bv3 32) ~a10~0) .cse3 .cse2) (and (= (_ bv2 32) ~a10~0) .cse0 .cse2 .cse4) (and .cse0 .cse1 (= (_ bv10 32) ~a19~0) .cse3 .cse2) (and .cse0 .cse1 (exists ((v_~a1~0_375 (_ BitVec 32))) (and (bvsge (_ bv38 32) v_~a1~0_375) (= (bvadd ~a1~0 (_ bv495232 32)) (bvsdiv (bvadd v_~a1~0_375 (_ bv4294683943 32)) (_ bv5 32))) (bvslt (_ bv4294967283 32) v_~a1~0_375))) .cse2) (= (_ bv8 32) ~a19~0) (and .cse0 (= (_ bv1 32) ~a10~0) .cse3 .cse2 .cse4) (and .cse0 (= (_ bv4 32) ~a10~0) .cse3 .cse2)))) [2020-12-09 19:54:46,690 INFO L262 CegarLoopResult]: For program point L361(lines 361 582) no Hoare annotation was computed. [2020-12-09 19:54:46,690 INFO L262 CegarLoopResult]: For program point L196-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,690 INFO L262 CegarLoopResult]: For program point L163-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,690 INFO L262 CegarLoopResult]: For program point L130-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,690 INFO L262 CegarLoopResult]: For program point L97-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,690 INFO L262 CegarLoopResult]: For program point L31(lines 31 33) no Hoare annotation was computed. [2020-12-09 19:54:46,690 INFO L262 CegarLoopResult]: For program point L64-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,690 INFO L262 CegarLoopResult]: For program point L31-2(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,690 INFO L262 CegarLoopResult]: For program point L527(lines 527 582) no Hoare annotation was computed. [2020-12-09 19:54:46,690 INFO L262 CegarLoopResult]: For program point L296(lines 296 582) no Hoare annotation was computed. [2020-12-09 19:54:46,690 INFO L262 CegarLoopResult]: For program point L230(lines 230 582) no Hoare annotation was computed. [2020-12-09 19:54:46,691 INFO L262 CegarLoopResult]: For program point L197(line 197) no Hoare annotation was computed. [2020-12-09 19:54:46,691 INFO L262 CegarLoopResult]: For program point L164(line 164) no Hoare annotation was computed. [2020-12-09 19:54:46,691 INFO L262 CegarLoopResult]: For program point L131(line 131) no Hoare annotation was computed. [2020-12-09 19:54:46,691 INFO L262 CegarLoopResult]: For program point L98(line 98) no Hoare annotation was computed. [2020-12-09 19:54:46,691 INFO L262 CegarLoopResult]: For program point L65(line 65) no Hoare annotation was computed. [2020-12-09 19:54:46,691 INFO L262 CegarLoopResult]: For program point L32(line 32) no Hoare annotation was computed. [2020-12-09 19:54:46,691 INFO L262 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-09 19:54:46,691 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 155) no Hoare annotation was computed. [2020-12-09 19:54:46,691 INFO L262 CegarLoopResult]: For program point L429(lines 429 582) no Hoare annotation was computed. [2020-12-09 19:54:46,691 INFO L262 CegarLoopResult]: For program point L330(lines 330 582) no Hoare annotation was computed. [2020-12-09 19:54:46,691 INFO L262 CegarLoopResult]: For program point L264(lines 264 582) no Hoare annotation was computed. [2020-12-09 19:54:46,691 INFO L262 CegarLoopResult]: For program point L364(lines 364 582) no Hoare annotation was computed. [2020-12-09 19:54:46,691 INFO L262 CegarLoopResult]: For program point L199-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,691 INFO L262 CegarLoopResult]: For program point L166-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,691 INFO L262 CegarLoopResult]: For program point L133-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,691 INFO L262 CegarLoopResult]: For program point L100-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,691 INFO L262 CegarLoopResult]: For program point L67-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,691 INFO L262 CegarLoopResult]: For program point L34-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:54:46,692 INFO L262 CegarLoopResult]: For program point L497(lines 497 582) no Hoare annotation was computed. [2020-12-09 19:54:46,692 INFO L262 CegarLoopResult]: For program point L464(lines 464 582) no Hoare annotation was computed. [2020-12-09 19:54:46,692 INFO L262 CegarLoopResult]: For program point L398(lines 398 582) no Hoare annotation was computed. [2020-12-09 19:54:46,692 INFO L262 CegarLoopResult]: For program point L200(line 200) no Hoare annotation was computed. [2020-12-09 19:54:46,692 INFO L262 CegarLoopResult]: For program point L167(line 167) no Hoare annotation was computed. [2020-12-09 19:54:46,692 INFO L262 CegarLoopResult]: For program point L134(line 134) no Hoare annotation was computed. [2020-12-09 19:54:46,692 INFO L262 CegarLoopResult]: For program point L101(line 101) no Hoare annotation was computed. [2020-12-09 19:54:46,692 INFO L262 CegarLoopResult]: For program point L68(line 68) no Hoare annotation was computed. [2020-12-09 19:54:46,692 INFO L262 CegarLoopResult]: For program point L35(line 35) no Hoare annotation was computed. [2020-12-09 19:54:46,699 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_375,QUANTIFIED] [2020-12-09 19:54:46,699 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_375,QUANTIFIED] [2020-12-09 19:54:46,700 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_375,QUANTIFIED] [2020-12-09 19:54:46,707 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_375,QUANTIFIED] [2020-12-09 19:54:46,707 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_375,QUANTIFIED] [2020-12-09 19:54:46,707 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_375,QUANTIFIED] [2020-12-09 19:54:46,709 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_375,QUANTIFIED] [2020-12-09 19:54:46,709 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_375,QUANTIFIED] [2020-12-09 19:54:46,710 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_375,QUANTIFIED] [2020-12-09 19:54:46,711 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_375,QUANTIFIED] [2020-12-09 19:54:46,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_375,QUANTIFIED] [2020-12-09 19:54:46,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_375,QUANTIFIED] [2020-12-09 19:54:46,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:54:46 BoogieIcfgContainer [2020-12-09 19:54:46,715 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 19:54:46,715 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 19:54:46,715 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 19:54:46,716 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 19:54:46,716 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:52:52" (3/4) ... [2020-12-09 19:54:46,719 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-09 19:54:46,737 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2020-12-09 19:54:46,738 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-12-09 19:54:46,739 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-09 19:54:46,740 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-09 19:54:46,759 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((a4 == 14bv32 && 9bv32 == a19) && 0bv32 == a10) && 0bv32 == a12) || (((a4 == 14bv32 && 3bv32 == a10) && !~bvsge32(218bv32, ~bvadd64(~bvsdiv32(~bvmul32(~bvsdiv32(a1, 5bv32), 5bv32), 5bv32), 505228bv32))) && 0bv32 == a12)) || (((2bv32 == a10 && a4 == 14bv32) && 0bv32 == a12) && ((!(6bv32 == a19) || !(a4 == 14bv32)) || !~bvsge32(38bv32, a1)))) || ((((a4 == 14bv32 && 0bv32 == a10) && 10bv32 == a19) && !~bvsge32(218bv32, ~bvadd64(~bvsdiv32(~bvmul32(~bvsdiv32(a1, 5bv32), 5bv32), 5bv32), 505228bv32))) && 0bv32 == a12)) || (((a4 == 14bv32 && 0bv32 == a10) && (\exists v_~a1~0_375 : bv32 :: (~bvsge32(38bv32, v_~a1~0_375) && ~bvadd64(a1, 495232bv32) == ~bvsdiv32(~bvadd64(v_~a1~0_375, 4294683943bv32), 5bv32)) && ~bvslt32(4294967283bv32, v_~a1~0_375))) && 0bv32 == a12)) || 8bv32 == a19) || ((((a4 == 14bv32 && 1bv32 == a10) && !~bvsge32(218bv32, ~bvadd64(~bvsdiv32(~bvmul32(~bvsdiv32(a1, 5bv32), 5bv32), 5bv32), 505228bv32))) && 0bv32 == a12) && ((!(6bv32 == a19) || !(a4 == 14bv32)) || !~bvsge32(38bv32, a1)))) || (((a4 == 14bv32 && 4bv32 == a10) && !~bvsge32(218bv32, ~bvadd64(~bvsdiv32(~bvmul32(~bvsdiv32(a1, 5bv32), 5bv32), 5bv32), 505228bv32))) && 0bv32 == a12) [2020-12-09 19:54:46,762 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((a4 == 14bv32 && 9bv32 == a19) && 0bv32 == a10) && 0bv32 == a12) || (((a4 == 14bv32 && 3bv32 == a10) && !~bvsge32(218bv32, ~bvadd64(~bvsdiv32(~bvmul32(~bvsdiv32(a1, 5bv32), 5bv32), 5bv32), 505228bv32))) && 0bv32 == a12)) || (((2bv32 == a10 && a4 == 14bv32) && 0bv32 == a12) && ((!(6bv32 == a19) || !(a4 == 14bv32)) || !~bvsge32(38bv32, a1)))) || ((((a4 == 14bv32 && 0bv32 == a10) && 10bv32 == a19) && !~bvsge32(218bv32, ~bvadd64(~bvsdiv32(~bvmul32(~bvsdiv32(a1, 5bv32), 5bv32), 5bv32), 505228bv32))) && 0bv32 == a12)) || (((a4 == 14bv32 && 0bv32 == a10) && (\exists v_~a1~0_375 : bv32 :: (~bvsge32(38bv32, v_~a1~0_375) && ~bvadd64(a1, 495232bv32) == ~bvsdiv32(~bvadd64(v_~a1~0_375, 4294683943bv32), 5bv32)) && ~bvslt32(4294967283bv32, v_~a1~0_375))) && 0bv32 == a12)) || 8bv32 == a19) || ((((a4 == 14bv32 && 1bv32 == a10) && !~bvsge32(218bv32, ~bvadd64(~bvsdiv32(~bvmul32(~bvsdiv32(a1, 5bv32), 5bv32), 5bv32), 505228bv32))) && 0bv32 == a12) && ((!(6bv32 == a19) || !(a4 == 14bv32)) || !~bvsge32(38bv32, a1)))) || (((a4 == 14bv32 && 4bv32 == a10) && !~bvsge32(218bv32, ~bvadd64(~bvsdiv32(~bvmul32(~bvsdiv32(a1, 5bv32), 5bv32), 5bv32), 505228bv32))) && 0bv32 == a12) [2020-12-09 19:54:46,824 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f951a96e-3a10-490a-bb59-a20253129c8a/bin/utaipan/witness.graphml [2020-12-09 19:54:46,824 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 19:54:46,825 INFO L168 Benchmark]: Toolchain (without parser) took 116868.81 ms. Allocated memory was 62.9 MB in the beginning and 251.7 MB in the end (delta: 188.7 MB). Free memory was 42.9 MB in the beginning and 93.9 MB in the end (delta: -51.0 MB). Peak memory consumption was 137.6 MB. Max. memory is 16.1 GB. [2020-12-09 19:54:46,825 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 62.9 MB. Free memory was 46.2 MB in the beginning and 46.1 MB in the end (delta: 84.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 19:54:46,826 INFO L168 Benchmark]: CACSL2BoogieTranslator took 417.76 ms. Allocated memory was 62.9 MB in the beginning and 79.7 MB in the end (delta: 16.8 MB). Free memory was 42.8 MB in the beginning and 50.8 MB in the end (delta: -8.0 MB). Peak memory consumption was 16.4 MB. Max. memory is 16.1 GB. [2020-12-09 19:54:46,826 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.61 ms. Allocated memory is still 79.7 MB. Free memory was 50.8 MB in the beginning and 45.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-09 19:54:46,826 INFO L168 Benchmark]: Boogie Preprocessor took 60.55 ms. Allocated memory is still 79.7 MB. Free memory was 45.4 MB in the beginning and 40.8 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-09 19:54:46,826 INFO L168 Benchmark]: RCFGBuilder took 2166.57 ms. Allocated memory is still 79.7 MB. Free memory was 40.8 MB in the beginning and 36.6 MB in the end (delta: 4.2 MB). Peak memory consumption was 16.0 MB. Max. memory is 16.1 GB. [2020-12-09 19:54:46,827 INFO L168 Benchmark]: TraceAbstraction took 114037.15 ms. Allocated memory was 79.7 MB in the beginning and 251.7 MB in the end (delta: 172.0 MB). Free memory was 36.1 MB in the beginning and 108.6 MB in the end (delta: -72.5 MB). Peak memory consumption was 97.9 MB. Max. memory is 16.1 GB. [2020-12-09 19:54:46,827 INFO L168 Benchmark]: Witness Printer took 108.95 ms. Allocated memory is still 251.7 MB. Free memory was 108.6 MB in the beginning and 93.9 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-12-09 19:54:46,828 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.12 ms. Allocated memory is still 62.9 MB. Free memory was 46.2 MB in the beginning and 46.1 MB in the end (delta: 84.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 417.76 ms. Allocated memory was 62.9 MB in the beginning and 79.7 MB in the end (delta: 16.8 MB). Free memory was 42.8 MB in the beginning and 50.8 MB in the end (delta: -8.0 MB). Peak memory consumption was 16.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 72.61 ms. Allocated memory is still 79.7 MB. Free memory was 50.8 MB in the beginning and 45.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 60.55 ms. Allocated memory is still 79.7 MB. Free memory was 45.4 MB in the beginning and 40.8 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2166.57 ms. Allocated memory is still 79.7 MB. Free memory was 40.8 MB in the beginning and 36.6 MB in the end (delta: 4.2 MB). Peak memory consumption was 16.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 114037.15 ms. Allocated memory was 79.7 MB in the beginning and 251.7 MB in the end (delta: 172.0 MB). Free memory was 36.1 MB in the beginning and 108.6 MB in the end (delta: -72.5 MB). Peak memory consumption was 97.9 MB. Max. memory is 16.1 GB. * Witness Printer took 108.95 ms. Allocated memory is still 251.7 MB. Free memory was 108.6 MB in the beginning and 93.9 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_375,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_375,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_375,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_375,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_375,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_375,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_375,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_375,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_375,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_375,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_375,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_375,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 155]: 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 [2020-12-09 19:54:46,833 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_375,QUANTIFIED] [2020-12-09 19:54:46,833 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_375,QUANTIFIED] [2020-12-09 19:54:46,833 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_375,QUANTIFIED] [2020-12-09 19:54:46,834 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_375,QUANTIFIED] [2020-12-09 19:54:46,835 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_375,QUANTIFIED] [2020-12-09 19:54:46,835 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_375,QUANTIFIED] Derived loop invariant: (((((((((a4 == 14bv32 && 9bv32 == a19) && 0bv32 == a10) && 0bv32 == a12) || (((a4 == 14bv32 && 3bv32 == a10) && !~bvsge32(218bv32, ~bvadd64(~bvsdiv32(~bvmul32(~bvsdiv32(a1, 5bv32), 5bv32), 5bv32), 505228bv32))) && 0bv32 == a12)) || (((2bv32 == a10 && a4 == 14bv32) && 0bv32 == a12) && ((!(6bv32 == a19) || !(a4 == 14bv32)) || !~bvsge32(38bv32, a1)))) || ((((a4 == 14bv32 && 0bv32 == a10) && 10bv32 == a19) && !~bvsge32(218bv32, ~bvadd64(~bvsdiv32(~bvmul32(~bvsdiv32(a1, 5bv32), 5bv32), 5bv32), 505228bv32))) && 0bv32 == a12)) || (((a4 == 14bv32 && 0bv32 == a10) && (\exists v_~a1~0_375 : bv32 :: (~bvsge32(38bv32, v_~a1~0_375) && ~bvadd64(a1, 495232bv32) == ~bvsdiv32(~bvadd64(v_~a1~0_375, 4294683943bv32), 5bv32)) && ~bvslt32(4294967283bv32, v_~a1~0_375))) && 0bv32 == a12)) || 8bv32 == a19) || ((((a4 == 14bv32 && 1bv32 == a10) && !~bvsge32(218bv32, ~bvadd64(~bvsdiv32(~bvmul32(~bvsdiv32(a1, 5bv32), 5bv32), 5bv32), 505228bv32))) && 0bv32 == a12) && ((!(6bv32 == a19) || !(a4 == 14bv32)) || !~bvsge32(38bv32, a1)))) || (((a4 == 14bv32 && 4bv32 == a10) && !~bvsge32(218bv32, ~bvadd64(~bvsdiv32(~bvmul32(~bvsdiv32(a1, 5bv32), 5bv32), 5bv32), 505228bv32))) && 0bv32 == a12) - InvariantResult [Line: 30]: Loop Invariant [2020-12-09 19:54:46,836 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_375,QUANTIFIED] [2020-12-09 19:54:46,836 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_375,QUANTIFIED] [2020-12-09 19:54:46,836 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_375,QUANTIFIED] [2020-12-09 19:54:46,838 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_375,QUANTIFIED] [2020-12-09 19:54:46,838 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_375,QUANTIFIED] [2020-12-09 19:54:46,838 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_375,QUANTIFIED] Derived loop invariant: (((((((((a4 == 14bv32 && 9bv32 == a19) && 0bv32 == a10) && 0bv32 == a12) || (((a4 == 14bv32 && 3bv32 == a10) && !~bvsge32(218bv32, ~bvadd64(~bvsdiv32(~bvmul32(~bvsdiv32(a1, 5bv32), 5bv32), 5bv32), 505228bv32))) && 0bv32 == a12)) || (((2bv32 == a10 && a4 == 14bv32) && 0bv32 == a12) && ((!(6bv32 == a19) || !(a4 == 14bv32)) || !~bvsge32(38bv32, a1)))) || ((((a4 == 14bv32 && 0bv32 == a10) && 10bv32 == a19) && !~bvsge32(218bv32, ~bvadd64(~bvsdiv32(~bvmul32(~bvsdiv32(a1, 5bv32), 5bv32), 5bv32), 505228bv32))) && 0bv32 == a12)) || (((a4 == 14bv32 && 0bv32 == a10) && (\exists v_~a1~0_375 : bv32 :: (~bvsge32(38bv32, v_~a1~0_375) && ~bvadd64(a1, 495232bv32) == ~bvsdiv32(~bvadd64(v_~a1~0_375, 4294683943bv32), 5bv32)) && ~bvslt32(4294967283bv32, v_~a1~0_375))) && 0bv32 == a12)) || 8bv32 == a19) || ((((a4 == 14bv32 && 1bv32 == a10) && !~bvsge32(218bv32, ~bvadd64(~bvsdiv32(~bvmul32(~bvsdiv32(a1, 5bv32), 5bv32), 5bv32), 505228bv32))) && 0bv32 == a12) && ((!(6bv32 == a19) || !(a4 == 14bv32)) || !~bvsge32(38bv32, a1)))) || (((a4 == 14bv32 && 4bv32 == a10) && !~bvsge32(218bv32, ~bvadd64(~bvsdiv32(~bvmul32(~bvsdiv32(a1, 5bv32), 5bv32), 5bv32), 505228bv32))) && 0bv32 == a12) - 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: 106.4s, OverallIterations: 12, TraceHistogramMax: 4, AutomataDifference: 85.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1485 SDtfs, 1374 SDslu, 91 SDs, 0 SdLazy, 5822 SolverSat, 893 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 77.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7370 GetRequests, 7313 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 6.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2506occurred in iteration=9, 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, 914 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 47 NumberOfFragments, 343 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2954 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 408 FormulaSimplificationTreeSizeReductionInter, 7.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 14.0s InterpolantComputationTime, 4783 NumberOfCodeBlocks, 4783 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 7366 ConstructedInterpolants, 45 QuantifiedInterpolants, 16062566 SizeOfPredicates, 40 NumberOfNonLiveVariables, 5853 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 26 InterpolantComputations, 12 PerfectInterpolantSequences, 5044/7230 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...