./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem03_label29.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_17ff8eb6-cfb8-48dd-9ac8-97a666b2b582/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_17ff8eb6-cfb8-48dd-9ac8-97a666b2b582/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_17ff8eb6-cfb8-48dd-9ac8-97a666b2b582/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_17ff8eb6-cfb8-48dd-9ac8-97a666b2b582/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem03_label29.c -s /tmp/vcloud-vcloud-master/worker/run_dir_17ff8eb6-cfb8-48dd-9ac8-97a666b2b582/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_17ff8eb6-cfb8-48dd-9ac8-97a666b2b582/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a9547726c128170530daa9b8442c9d71a0bd2015 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 19:53:29,655 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 19:53:29,657 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 19:53:29,670 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 19:53:29,671 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 19:53:29,672 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 19:53:29,673 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 19:53:29,682 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 19:53:29,686 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 19:53:29,690 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 19:53:29,691 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 19:53:29,692 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 19:53:29,692 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 19:53:29,694 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 19:53:29,695 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 19:53:29,696 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 19:53:29,697 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 19:53:29,697 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 19:53:29,700 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 19:53:29,703 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 19:53:29,706 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 19:53:29,707 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 19:53:29,709 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 19:53:29,710 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 19:53:29,713 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 19:53:29,713 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 19:53:29,713 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 19:53:29,714 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 19:53:29,715 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 19:53:29,715 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 19:53:29,716 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 19:53:29,716 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 19:53:29,717 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 19:53:29,717 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 19:53:29,718 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 19:53:29,719 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 19:53:29,719 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 19:53:29,719 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 19:53:29,720 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 19:53:29,720 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 19:53:29,721 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 19:53:29,722 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_17ff8eb6-cfb8-48dd-9ac8-97a666b2b582/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 19:53:29,745 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 19:53:29,745 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 19:53:29,746 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 19:53:29,746 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 19:53:29,747 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 19:53:29,747 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 19:53:29,747 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 19:53:29,747 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 19:53:29,747 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 19:53:29,748 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 19:53:29,748 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 19:53:29,748 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 19:53:29,748 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 19:53:29,748 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 19:53:29,749 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 19:53:29,749 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 19:53:29,749 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 19:53:29,749 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 19:53:29,749 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 19:53:29,750 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 19:53:29,750 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 19:53:29,750 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 19:53:29,750 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 19:53:29,751 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 19:53:29,751 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 19:53:29,751 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 19:53:29,751 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 19:53:29,751 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 19:53:29,752 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_17ff8eb6-cfb8-48dd-9ac8-97a666b2b582/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a9547726c128170530daa9b8442c9d71a0bd2015 [2019-11-15 19:53:29,791 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 19:53:29,803 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 19:53:29,807 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 19:53:29,808 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 19:53:29,808 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 19:53:29,809 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_17ff8eb6-cfb8-48dd-9ac8-97a666b2b582/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem03_label29.c [2019-11-15 19:53:29,863 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_17ff8eb6-cfb8-48dd-9ac8-97a666b2b582/bin/uautomizer/data/6bcaf2702/5630ebd4646f4392a822ea1789cf45a3/FLAGf5d8b0144 [2019-11-15 19:53:30,411 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 19:53:30,412 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_17ff8eb6-cfb8-48dd-9ac8-97a666b2b582/sv-benchmarks/c/eca-rers2012/Problem03_label29.c [2019-11-15 19:53:30,426 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_17ff8eb6-cfb8-48dd-9ac8-97a666b2b582/bin/uautomizer/data/6bcaf2702/5630ebd4646f4392a822ea1789cf45a3/FLAGf5d8b0144 [2019-11-15 19:53:30,638 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_17ff8eb6-cfb8-48dd-9ac8-97a666b2b582/bin/uautomizer/data/6bcaf2702/5630ebd4646f4392a822ea1789cf45a3 [2019-11-15 19:53:30,644 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 19:53:30,647 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 19:53:30,648 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 19:53:30,648 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 19:53:30,654 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 19:53:30,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 07:53:30" (1/1) ... [2019-11-15 19:53:30,658 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@458dbaf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:53:30, skipping insertion in model container [2019-11-15 19:53:30,658 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 07:53:30" (1/1) ... [2019-11-15 19:53:30,665 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 19:53:30,747 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 19:53:31,419 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 19:53:31,424 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 19:53:31,659 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 19:53:31,679 INFO L192 MainTranslator]: Completed translation [2019-11-15 19:53:31,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:53:31 WrapperNode [2019-11-15 19:53:31,680 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 19:53:31,680 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 19:53:31,680 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 19:53:31,681 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 19:53:31,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:53:31" (1/1) ... [2019-11-15 19:53:31,726 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:53:31" (1/1) ... [2019-11-15 19:53:31,811 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 19:53:31,812 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 19:53:31,812 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 19:53:31,813 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 19:53:31,821 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:53:31" (1/1) ... [2019-11-15 19:53:31,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:53:31" (1/1) ... [2019-11-15 19:53:31,836 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:53:31" (1/1) ... [2019-11-15 19:53:31,836 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:53:31" (1/1) ... [2019-11-15 19:53:31,891 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:53:31" (1/1) ... [2019-11-15 19:53:31,914 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:53:31" (1/1) ... [2019-11-15 19:53:31,927 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:53:31" (1/1) ... [2019-11-15 19:53:31,939 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 19:53:31,940 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 19:53:31,940 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 19:53:31,940 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 19:53:31,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:53:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_17ff8eb6-cfb8-48dd-9ac8-97a666b2b582/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 19:53:32,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 19:53:32,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 19:53:33,919 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 19:53:33,919 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 19:53:33,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 07:53:33 BoogieIcfgContainer [2019-11-15 19:53:33,921 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 19:53:33,921 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 19:53:33,921 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 19:53:33,924 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 19:53:33,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 07:53:30" (1/3) ... [2019-11-15 19:53:33,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c88460e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 07:53:33, skipping insertion in model container [2019-11-15 19:53:33,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:53:31" (2/3) ... [2019-11-15 19:53:33,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c88460e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 07:53:33, skipping insertion in model container [2019-11-15 19:53:33,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 07:53:33" (3/3) ... [2019-11-15 19:53:33,930 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label29.c [2019-11-15 19:53:33,938 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 19:53:33,946 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 19:53:33,955 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 19:53:33,988 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 19:53:33,989 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 19:53:33,989 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 19:53:33,989 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 19:53:33,989 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 19:53:33,989 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 19:53:33,990 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 19:53:33,990 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 19:53:34,014 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-11-15 19:53:34,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-15 19:53:34,035 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:53:34,036 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:53:34,038 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:53:34,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:53:34,043 INFO L82 PathProgramCache]: Analyzing trace with hash 800753066, now seen corresponding path program 1 times [2019-11-15 19:53:34,050 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:53:34,050 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802323026] [2019-11-15 19:53:34,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:53:34,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:53:34,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:53:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:53:34,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:53:34,695 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802323026] [2019-11-15 19:53:34,696 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:53:34,696 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 19:53:34,696 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506672889] [2019-11-15 19:53:34,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:53:34,701 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:53:34,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:53:34,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:53:34,715 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 4 states. [2019-11-15 19:53:36,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:53:36,677 INFO L93 Difference]: Finished difference Result 1085 states and 1950 transitions. [2019-11-15 19:53:36,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:53:36,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-11-15 19:53:36,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:53:36,712 INFO L225 Difference]: With dead ends: 1085 [2019-11-15 19:53:36,713 INFO L226 Difference]: Without dead ends: 686 [2019-11-15 19:53:36,723 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:53:36,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2019-11-15 19:53:36,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 453. [2019-11-15 19:53:36,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2019-11-15 19:53:36,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 735 transitions. [2019-11-15 19:53:36,821 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 735 transitions. Word has length 178 [2019-11-15 19:53:36,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:53:36,822 INFO L462 AbstractCegarLoop]: Abstraction has 453 states and 735 transitions. [2019-11-15 19:53:36,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:53:36,822 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 735 transitions. [2019-11-15 19:53:36,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-15 19:53:36,826 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:53:36,827 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:53:36,827 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:53:36,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:53:36,828 INFO L82 PathProgramCache]: Analyzing trace with hash -2040513926, now seen corresponding path program 1 times [2019-11-15 19:53:36,828 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:53:36,828 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156497698] [2019-11-15 19:53:36,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:53:36,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:53:36,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:53:36,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:53:37,027 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:53:37,027 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156497698] [2019-11-15 19:53:37,028 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:53:37,028 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 19:53:37,028 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281400922] [2019-11-15 19:53:37,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:53:37,030 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:53:37,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:53:37,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:53:37,031 INFO L87 Difference]: Start difference. First operand 453 states and 735 transitions. Second operand 4 states. [2019-11-15 19:53:38,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:53:38,477 INFO L93 Difference]: Finished difference Result 1748 states and 2863 transitions. [2019-11-15 19:53:38,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:53:38,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2019-11-15 19:53:38,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:53:38,486 INFO L225 Difference]: With dead ends: 1748 [2019-11-15 19:53:38,487 INFO L226 Difference]: Without dead ends: 1297 [2019-11-15 19:53:38,488 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:53:38,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2019-11-15 19:53:38,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 863. [2019-11-15 19:53:38,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2019-11-15 19:53:38,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1325 transitions. [2019-11-15 19:53:38,535 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1325 transitions. Word has length 183 [2019-11-15 19:53:38,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:53:38,536 INFO L462 AbstractCegarLoop]: Abstraction has 863 states and 1325 transitions. [2019-11-15 19:53:38,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:53:38,536 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1325 transitions. [2019-11-15 19:53:38,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-15 19:53:38,543 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:53:38,543 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:53:38,543 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:53:38,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:53:38,544 INFO L82 PathProgramCache]: Analyzing trace with hash 455255094, now seen corresponding path program 1 times [2019-11-15 19:53:38,544 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:53:38,545 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565230844] [2019-11-15 19:53:38,545 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:53:38,546 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:53:38,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:53:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:53:38,644 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:53:38,645 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565230844] [2019-11-15 19:53:38,646 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:53:38,646 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 19:53:38,646 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052477099] [2019-11-15 19:53:38,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 19:53:38,649 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:53:38,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:53:38,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:53:38,653 INFO L87 Difference]: Start difference. First operand 863 states and 1325 transitions. Second operand 3 states. [2019-11-15 19:53:39,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:53:39,575 INFO L93 Difference]: Finished difference Result 2552 states and 3927 transitions. [2019-11-15 19:53:39,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:53:39,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-11-15 19:53:39,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:53:39,585 INFO L225 Difference]: With dead ends: 2552 [2019-11-15 19:53:39,585 INFO L226 Difference]: Without dead ends: 1691 [2019-11-15 19:53:39,587 INFO L600 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 [2019-11-15 19:53:39,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2019-11-15 19:53:39,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1687. [2019-11-15 19:53:39,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1687 states. [2019-11-15 19:53:39,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1687 states and 2449 transitions. [2019-11-15 19:53:39,691 INFO L78 Accepts]: Start accepts. Automaton has 1687 states and 2449 transitions. Word has length 184 [2019-11-15 19:53:39,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:53:39,692 INFO L462 AbstractCegarLoop]: Abstraction has 1687 states and 2449 transitions. [2019-11-15 19:53:39,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 19:53:39,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 2449 transitions. [2019-11-15 19:53:39,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-15 19:53:39,696 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:53:39,696 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:53:39,696 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:53:39,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:53:39,697 INFO L82 PathProgramCache]: Analyzing trace with hash -726821495, now seen corresponding path program 1 times [2019-11-15 19:53:39,697 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:53:39,697 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891026814] [2019-11-15 19:53:39,697 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:53:39,697 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:53:39,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:53:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:53:39,771 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:53:39,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891026814] [2019-11-15 19:53:39,771 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:53:39,771 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 19:53:39,772 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221702817] [2019-11-15 19:53:39,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 19:53:39,773 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:53:39,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:53:39,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:53:39,774 INFO L87 Difference]: Start difference. First operand 1687 states and 2449 transitions. Second operand 3 states. [2019-11-15 19:53:40,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:53:40,610 INFO L93 Difference]: Finished difference Result 5013 states and 7296 transitions. [2019-11-15 19:53:40,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:53:40,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-11-15 19:53:40,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:53:40,628 INFO L225 Difference]: With dead ends: 5013 [2019-11-15 19:53:40,628 INFO L226 Difference]: Without dead ends: 3328 [2019-11-15 19:53:40,631 INFO L600 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 [2019-11-15 19:53:40,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3328 states. [2019-11-15 19:53:40,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3328 to 3311. [2019-11-15 19:53:40,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3311 states. [2019-11-15 19:53:40,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3311 states to 3311 states and 4735 transitions. [2019-11-15 19:53:40,695 INFO L78 Accepts]: Start accepts. Automaton has 3311 states and 4735 transitions. Word has length 186 [2019-11-15 19:53:40,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:53:40,696 INFO L462 AbstractCegarLoop]: Abstraction has 3311 states and 4735 transitions. [2019-11-15 19:53:40,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 19:53:40,696 INFO L276 IsEmpty]: Start isEmpty. Operand 3311 states and 4735 transitions. [2019-11-15 19:53:40,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-15 19:53:40,703 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:53:40,704 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:53:40,704 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:53:40,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:53:40,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1403214167, now seen corresponding path program 1 times [2019-11-15 19:53:40,704 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:53:40,705 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060212904] [2019-11-15 19:53:40,705 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:53:40,705 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:53:40,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:53:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:53:40,813 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:53:40,813 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060212904] [2019-11-15 19:53:40,813 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:53:40,813 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 19:53:40,813 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53642365] [2019-11-15 19:53:40,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:53:40,815 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:53:40,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:53:40,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:53:40,816 INFO L87 Difference]: Start difference. First operand 3311 states and 4735 transitions. Second operand 4 states. [2019-11-15 19:53:42,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:53:42,015 INFO L93 Difference]: Finished difference Result 12510 states and 17955 transitions. [2019-11-15 19:53:42,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:53:42,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2019-11-15 19:53:42,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:53:42,058 INFO L225 Difference]: With dead ends: 12510 [2019-11-15 19:53:42,058 INFO L226 Difference]: Without dead ends: 9201 [2019-11-15 19:53:42,062 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:53:42,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9201 states. [2019-11-15 19:53:42,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9201 to 9199. [2019-11-15 19:53:42,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9199 states. [2019-11-15 19:53:42,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9199 states to 9199 states and 11486 transitions. [2019-11-15 19:53:42,236 INFO L78 Accepts]: Start accepts. Automaton has 9199 states and 11486 transitions. Word has length 197 [2019-11-15 19:53:42,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:53:42,236 INFO L462 AbstractCegarLoop]: Abstraction has 9199 states and 11486 transitions. [2019-11-15 19:53:42,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:53:42,236 INFO L276 IsEmpty]: Start isEmpty. Operand 9199 states and 11486 transitions. [2019-11-15 19:53:42,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-11-15 19:53:42,252 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:53:42,252 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:53:42,252 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:53:42,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:53:42,253 INFO L82 PathProgramCache]: Analyzing trace with hash -215854226, now seen corresponding path program 1 times [2019-11-15 19:53:42,253 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:53:42,253 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720298778] [2019-11-15 19:53:42,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:53:42,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:53:42,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:53:42,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:53:42,424 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:53:42,425 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720298778] [2019-11-15 19:53:42,425 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:53:42,426 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:53:42,426 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139300191] [2019-11-15 19:53:42,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 19:53:42,426 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:53:42,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 19:53:42,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:53:42,427 INFO L87 Difference]: Start difference. First operand 9199 states and 11486 transitions. Second operand 5 states. [2019-11-15 19:53:43,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:53:43,902 INFO L93 Difference]: Finished difference Result 28424 states and 35683 transitions. [2019-11-15 19:53:43,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 19:53:43,903 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 216 [2019-11-15 19:53:43,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:53:43,964 INFO L225 Difference]: With dead ends: 28424 [2019-11-15 19:53:43,964 INFO L226 Difference]: Without dead ends: 19227 [2019-11-15 19:53:43,976 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:53:43,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19227 states. [2019-11-15 19:53:44,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19227 to 18377. [2019-11-15 19:53:44,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18377 states. [2019-11-15 19:53:44,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18377 states to 18377 states and 22820 transitions. [2019-11-15 19:53:44,467 INFO L78 Accepts]: Start accepts. Automaton has 18377 states and 22820 transitions. Word has length 216 [2019-11-15 19:53:44,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:53:44,467 INFO L462 AbstractCegarLoop]: Abstraction has 18377 states and 22820 transitions. [2019-11-15 19:53:44,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 19:53:44,467 INFO L276 IsEmpty]: Start isEmpty. Operand 18377 states and 22820 transitions. [2019-11-15 19:53:44,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-11-15 19:53:44,497 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:53:44,497 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:53:44,498 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:53:44,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:53:44,498 INFO L82 PathProgramCache]: Analyzing trace with hash -82552671, now seen corresponding path program 1 times [2019-11-15 19:53:44,498 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:53:44,499 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547628807] [2019-11-15 19:53:44,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:53:44,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:53:44,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:53:44,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:53:44,602 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-15 19:53:44,602 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547628807] [2019-11-15 19:53:44,603 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:53:44,603 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 19:53:44,603 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123835178] [2019-11-15 19:53:44,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 19:53:44,604 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:53:44,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:53:44,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:53:44,604 INFO L87 Difference]: Start difference. First operand 18377 states and 22820 transitions. Second operand 3 states. [2019-11-15 19:53:45,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:53:45,138 INFO L93 Difference]: Finished difference Result 34878 states and 43337 transitions. [2019-11-15 19:53:45,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:53:45,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-11-15 19:53:45,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:53:45,164 INFO L225 Difference]: With dead ends: 34878 [2019-11-15 19:53:45,164 INFO L226 Difference]: Without dead ends: 16503 [2019-11-15 19:53:45,181 INFO L600 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 [2019-11-15 19:53:45,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16503 states. [2019-11-15 19:53:45,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16503 to 16503. [2019-11-15 19:53:45,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16503 states. [2019-11-15 19:53:45,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16503 states to 16503 states and 20026 transitions. [2019-11-15 19:53:45,392 INFO L78 Accepts]: Start accepts. Automaton has 16503 states and 20026 transitions. Word has length 239 [2019-11-15 19:53:45,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:53:45,393 INFO L462 AbstractCegarLoop]: Abstraction has 16503 states and 20026 transitions. [2019-11-15 19:53:45,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 19:53:45,393 INFO L276 IsEmpty]: Start isEmpty. Operand 16503 states and 20026 transitions. [2019-11-15 19:53:45,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-11-15 19:53:45,412 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:53:45,412 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:53:45,413 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:53:45,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:53:45,413 INFO L82 PathProgramCache]: Analyzing trace with hash 743628338, now seen corresponding path program 1 times [2019-11-15 19:53:45,413 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:53:45,414 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422493441] [2019-11-15 19:53:45,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:53:45,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:53:45,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:53:45,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:53:45,602 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 19:53:45,602 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422493441] [2019-11-15 19:53:45,603 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:53:45,603 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 19:53:45,603 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709781276] [2019-11-15 19:53:45,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:53:45,604 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:53:45,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:53:45,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:53:45,604 INFO L87 Difference]: Start difference. First operand 16503 states and 20026 transitions. Second operand 4 states. [2019-11-15 19:53:46,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:53:46,667 INFO L93 Difference]: Finished difference Result 32793 states and 39819 transitions. [2019-11-15 19:53:46,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:53:46,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 266 [2019-11-15 19:53:46,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:53:46,689 INFO L225 Difference]: With dead ends: 32793 [2019-11-15 19:53:46,689 INFO L226 Difference]: Without dead ends: 16292 [2019-11-15 19:53:46,704 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:53:46,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16292 states. [2019-11-15 19:53:46,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16292 to 13653. [2019-11-15 19:53:46,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13653 states. [2019-11-15 19:53:46,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13653 states to 13653 states and 15721 transitions. [2019-11-15 19:53:46,896 INFO L78 Accepts]: Start accepts. Automaton has 13653 states and 15721 transitions. Word has length 266 [2019-11-15 19:53:46,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:53:46,897 INFO L462 AbstractCegarLoop]: Abstraction has 13653 states and 15721 transitions. [2019-11-15 19:53:46,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:53:46,897 INFO L276 IsEmpty]: Start isEmpty. Operand 13653 states and 15721 transitions. [2019-11-15 19:53:46,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-11-15 19:53:46,914 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:53:46,915 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:53:46,915 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:53:46,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:53:46,915 INFO L82 PathProgramCache]: Analyzing trace with hash -173098499, now seen corresponding path program 1 times [2019-11-15 19:53:46,915 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:53:46,916 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605503667] [2019-11-15 19:53:46,916 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:53:46,916 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:53:46,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:53:46,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:53:47,066 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-15 19:53:47,066 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605503667] [2019-11-15 19:53:47,067 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:53:47,067 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 19:53:47,067 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864742162] [2019-11-15 19:53:47,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:53:47,068 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:53:47,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:53:47,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:53:47,069 INFO L87 Difference]: Start difference. First operand 13653 states and 15721 transitions. Second operand 4 states. [2019-11-15 19:53:48,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:53:48,515 INFO L93 Difference]: Finished difference Result 51949 states and 59802 transitions. [2019-11-15 19:53:48,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:53:48,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 278 [2019-11-15 19:53:48,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:53:48,567 INFO L225 Difference]: With dead ends: 51949 [2019-11-15 19:53:48,568 INFO L226 Difference]: Without dead ends: 38298 [2019-11-15 19:53:48,582 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:53:48,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38298 states. [2019-11-15 19:53:48,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38298 to 38294. [2019-11-15 19:53:48,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38294 states. [2019-11-15 19:53:49,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38294 states to 38294 states and 43994 transitions. [2019-11-15 19:53:49,050 INFO L78 Accepts]: Start accepts. Automaton has 38294 states and 43994 transitions. Word has length 278 [2019-11-15 19:53:49,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:53:49,051 INFO L462 AbstractCegarLoop]: Abstraction has 38294 states and 43994 transitions. [2019-11-15 19:53:49,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:53:49,051 INFO L276 IsEmpty]: Start isEmpty. Operand 38294 states and 43994 transitions. [2019-11-15 19:53:49,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-11-15 19:53:49,070 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:53:49,070 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:53:49,071 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:53:49,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:53:49,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1953792015, now seen corresponding path program 1 times [2019-11-15 19:53:49,071 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:53:49,073 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144757477] [2019-11-15 19:53:49,073 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:53:49,073 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:53:49,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:53:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:53:49,660 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 109 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 19:53:49,660 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144757477] [2019-11-15 19:53:49,661 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514670304] [2019-11-15 19:53:49,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_17ff8eb6-cfb8-48dd-9ac8-97a666b2b582/bin/uautomizer/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 [2019-11-15 19:53:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:53:49,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 19:53:49,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:53:49,932 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-15 19:53:49,932 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 19:53:49,933 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2019-11-15 19:53:49,933 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512707290] [2019-11-15 19:53:49,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 19:53:49,937 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:53:49,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:53:49,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:53:49,938 INFO L87 Difference]: Start difference. First operand 38294 states and 43994 transitions. Second operand 3 states. [2019-11-15 19:53:50,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:53:50,535 INFO L93 Difference]: Finished difference Result 109525 states and 126031 transitions. [2019-11-15 19:53:50,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:53:50,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 288 [2019-11-15 19:53:50,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:53:50,603 INFO L225 Difference]: With dead ends: 109525 [2019-11-15 19:53:50,603 INFO L226 Difference]: Without dead ends: 71233 [2019-11-15 19:53:50,623 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 287 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:53:50,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71233 states. [2019-11-15 19:53:51,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71233 to 71231. [2019-11-15 19:53:51,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71231 states. [2019-11-15 19:53:51,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71231 states to 71231 states and 82008 transitions. [2019-11-15 19:53:51,727 INFO L78 Accepts]: Start accepts. Automaton has 71231 states and 82008 transitions. Word has length 288 [2019-11-15 19:53:51,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:53:51,728 INFO L462 AbstractCegarLoop]: Abstraction has 71231 states and 82008 transitions. [2019-11-15 19:53:51,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 19:53:51,728 INFO L276 IsEmpty]: Start isEmpty. Operand 71231 states and 82008 transitions. [2019-11-15 19:53:51,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-11-15 19:53:51,745 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:53:51,745 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:53:51,949 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:53:51,950 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:53:51,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:53:51,951 INFO L82 PathProgramCache]: Analyzing trace with hash 844494747, now seen corresponding path program 1 times [2019-11-15 19:53:51,951 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:53:51,952 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441133522] [2019-11-15 19:53:51,952 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:53:51,952 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:53:51,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:53:52,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:53:52,103 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-15 19:53:52,104 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441133522] [2019-11-15 19:53:52,104 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:53:52,104 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 19:53:52,104 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226750569] [2019-11-15 19:53:52,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 19:53:52,105 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:53:52,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:53:52,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:53:52,105 INFO L87 Difference]: Start difference. First operand 71231 states and 82008 transitions. Second operand 3 states. [2019-11-15 19:53:53,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:53:53,013 INFO L93 Difference]: Finished difference Result 142484 states and 164062 transitions. [2019-11-15 19:53:53,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:53:53,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2019-11-15 19:53:53,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:53:53,075 INFO L225 Difference]: With dead ends: 142484 [2019-11-15 19:53:53,075 INFO L226 Difference]: Without dead ends: 71255 [2019-11-15 19:53:53,102 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:53:53,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71255 states. [2019-11-15 19:53:53,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71255 to 70825. [2019-11-15 19:53:53,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70825 states. [2019-11-15 19:53:53,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70825 states to 70825 states and 79737 transitions. [2019-11-15 19:53:53,693 INFO L78 Accepts]: Start accepts. Automaton has 70825 states and 79737 transitions. Word has length 300 [2019-11-15 19:53:53,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:53:53,693 INFO L462 AbstractCegarLoop]: Abstraction has 70825 states and 79737 transitions. [2019-11-15 19:53:53,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 19:53:53,694 INFO L276 IsEmpty]: Start isEmpty. Operand 70825 states and 79737 transitions. [2019-11-15 19:53:53,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-11-15 19:53:53,706 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:53:53,707 INFO L380 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:53:53,707 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:53:53,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:53:53,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1976501505, now seen corresponding path program 1 times [2019-11-15 19:53:53,708 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:53:53,708 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249741024] [2019-11-15 19:53:53,708 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:53:53,708 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:53:53,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:53:53,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:53:53,876 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-11-15 19:53:53,877 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249741024] [2019-11-15 19:53:53,877 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:53:53,877 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 19:53:53,877 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058288686] [2019-11-15 19:53:53,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 19:53:53,878 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:53:53,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:53:53,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:53:53,879 INFO L87 Difference]: Start difference. First operand 70825 states and 79737 transitions. Second operand 3 states. [2019-11-15 19:53:55,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:53:55,393 INFO L93 Difference]: Finished difference Result 175250 states and 197766 transitions. [2019-11-15 19:53:55,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:53:55,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2019-11-15 19:53:55,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:53:55,490 INFO L225 Difference]: With dead ends: 175250 [2019-11-15 19:53:55,491 INFO L226 Difference]: Without dead ends: 104427 [2019-11-15 19:53:55,521 INFO L600 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 [2019-11-15 19:53:55,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104427 states. [2019-11-15 19:53:56,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104427 to 104421. [2019-11-15 19:53:56,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104421 states. [2019-11-15 19:53:56,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104421 states to 104421 states and 117899 transitions. [2019-11-15 19:53:56,417 INFO L78 Accepts]: Start accepts. Automaton has 104421 states and 117899 transitions. Word has length 313 [2019-11-15 19:53:56,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:53:56,418 INFO L462 AbstractCegarLoop]: Abstraction has 104421 states and 117899 transitions. [2019-11-15 19:53:56,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 19:53:56,418 INFO L276 IsEmpty]: Start isEmpty. Operand 104421 states and 117899 transitions. [2019-11-15 19:53:56,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-11-15 19:53:56,431 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:53:56,432 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:53:56,432 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:53:56,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:53:56,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1864009396, now seen corresponding path program 1 times [2019-11-15 19:53:56,433 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:53:56,433 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285873641] [2019-11-15 19:53:56,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:53:56,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:53:56,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:53:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:53:57,173 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 105 proven. 3 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-11-15 19:53:57,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285873641] [2019-11-15 19:53:57,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917538242] [2019-11-15 19:53:57,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_17ff8eb6-cfb8-48dd-9ac8-97a666b2b582/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:53:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:53:57,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 19:53:57,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:53:57,473 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-11-15 19:53:57,473 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 19:53:57,473 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2019-11-15 19:53:57,474 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965626457] [2019-11-15 19:53:57,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 19:53:57,475 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:53:57,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:53:57,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 19:53:57,475 INFO L87 Difference]: Start difference. First operand 104421 states and 117899 transitions. Second operand 3 states. [2019-11-15 19:53:59,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:53:59,340 INFO L93 Difference]: Finished difference Result 266583 states and 300236 transitions. [2019-11-15 19:53:59,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:53:59,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-11-15 19:53:59,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:53:59,611 INFO L225 Difference]: With dead ends: 266583 [2019-11-15 19:53:59,611 INFO L226 Difference]: Without dead ends: 162164 [2019-11-15 19:53:59,668 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 19:53:59,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162164 states. [2019-11-15 19:54:02,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162164 to 160309. [2019-11-15 19:54:02,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160309 states. [2019-11-15 19:54:02,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160309 states to 160309 states and 178700 transitions. [2019-11-15 19:54:02,453 INFO L78 Accepts]: Start accepts. Automaton has 160309 states and 178700 transitions. Word has length 320 [2019-11-15 19:54:02,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:02,453 INFO L462 AbstractCegarLoop]: Abstraction has 160309 states and 178700 transitions. [2019-11-15 19:54:02,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 19:54:02,453 INFO L276 IsEmpty]: Start isEmpty. Operand 160309 states and 178700 transitions. [2019-11-15 19:54:02,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-11-15 19:54:02,514 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:02,514 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:02,719 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:54:02,728 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:54:02,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:02,729 INFO L82 PathProgramCache]: Analyzing trace with hash 594366740, now seen corresponding path program 1 times [2019-11-15 19:54:02,730 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:02,730 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503862070] [2019-11-15 19:54:02,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:02,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:02,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:02,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:03,003 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-15 19:54:03,003 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503862070] [2019-11-15 19:54:03,004 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:03,004 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:54:03,004 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001274922] [2019-11-15 19:54:03,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 19:54:03,006 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:03,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 19:54:03,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:54:03,007 INFO L87 Difference]: Start difference. First operand 160309 states and 178700 transitions. Second operand 5 states. [2019-11-15 19:54:05,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:05,295 INFO L93 Difference]: Finished difference Result 422246 states and 467693 transitions. [2019-11-15 19:54:05,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 19:54:05,295 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 320 [2019-11-15 19:54:05,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:05,613 INFO L225 Difference]: With dead ends: 422246 [2019-11-15 19:54:05,614 INFO L226 Difference]: Without dead ends: 261939 [2019-11-15 19:54:05,688 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:54:05,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261939 states. [2019-11-15 19:54:08,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261939 to 251132. [2019-11-15 19:54:08,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251132 states. [2019-11-15 19:54:09,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251132 states to 251132 states and 276832 transitions. [2019-11-15 19:54:09,031 INFO L78 Accepts]: Start accepts. Automaton has 251132 states and 276832 transitions. Word has length 320 [2019-11-15 19:54:09,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:09,031 INFO L462 AbstractCegarLoop]: Abstraction has 251132 states and 276832 transitions. [2019-11-15 19:54:09,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 19:54:09,031 INFO L276 IsEmpty]: Start isEmpty. Operand 251132 states and 276832 transitions. [2019-11-15 19:54:09,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2019-11-15 19:54:09,070 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:09,071 INFO L380 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:09,071 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:54:09,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:09,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1803227641, now seen corresponding path program 1 times [2019-11-15 19:54:09,072 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:09,072 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298529342] [2019-11-15 19:54:09,072 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:09,072 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:09,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:09,260 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-11-15 19:54:09,261 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298529342] [2019-11-15 19:54:09,261 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:09,261 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 19:54:09,261 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934100275] [2019-11-15 19:54:09,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 19:54:09,262 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:09,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:54:09,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:54:09,263 INFO L87 Difference]: Start difference. First operand 251132 states and 276832 transitions. Second operand 3 states. [2019-11-15 19:54:15,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:15,548 INFO L93 Difference]: Finished difference Result 502253 states and 553653 transitions. [2019-11-15 19:54:15,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:54:15,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 353 [2019-11-15 19:54:15,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:15,827 INFO L225 Difference]: With dead ends: 502253 [2019-11-15 19:54:15,827 INFO L226 Difference]: Without dead ends: 251123 [2019-11-15 19:54:15,909 INFO L600 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 [2019-11-15 19:54:16,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251123 states. [2019-11-15 19:54:18,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251123 to 251123. [2019-11-15 19:54:18,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251123 states. [2019-11-15 19:54:18,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251123 states to 251123 states and 276814 transitions. [2019-11-15 19:54:18,301 INFO L78 Accepts]: Start accepts. Automaton has 251123 states and 276814 transitions. Word has length 353 [2019-11-15 19:54:18,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:18,301 INFO L462 AbstractCegarLoop]: Abstraction has 251123 states and 276814 transitions. [2019-11-15 19:54:18,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 19:54:18,302 INFO L276 IsEmpty]: Start isEmpty. Operand 251123 states and 276814 transitions. [2019-11-15 19:54:18,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2019-11-15 19:54:18,331 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:18,332 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:18,332 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:54:18,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:18,333 INFO L82 PathProgramCache]: Analyzing trace with hash -963524122, now seen corresponding path program 1 times [2019-11-15 19:54:18,333 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:18,333 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540246970] [2019-11-15 19:54:18,333 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:18,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:18,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:19,225 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-15 19:54:19,225 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540246970] [2019-11-15 19:54:19,225 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:19,226 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 19:54:19,226 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798936715] [2019-11-15 19:54:19,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:54:19,228 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:19,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:54:19,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:54:19,228 INFO L87 Difference]: Start difference. First operand 251123 states and 276814 transitions. Second operand 4 states. [2019-11-15 19:54:21,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:21,212 INFO L93 Difference]: Finished difference Result 512307 states and 564690 transitions. [2019-11-15 19:54:21,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:54:21,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 368 [2019-11-15 19:54:21,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:21,491 INFO L225 Difference]: With dead ends: 512307 [2019-11-15 19:54:21,491 INFO L226 Difference]: Without dead ends: 261186 [2019-11-15 19:54:21,587 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:54:21,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261186 states. [2019-11-15 19:54:23,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261186 to 255008. [2019-11-15 19:54:23,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255008 states. [2019-11-15 19:54:25,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255008 states to 255008 states and 280728 transitions. [2019-11-15 19:54:25,745 INFO L78 Accepts]: Start accepts. Automaton has 255008 states and 280728 transitions. Word has length 368 [2019-11-15 19:54:25,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:25,745 INFO L462 AbstractCegarLoop]: Abstraction has 255008 states and 280728 transitions. [2019-11-15 19:54:25,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:54:25,745 INFO L276 IsEmpty]: Start isEmpty. Operand 255008 states and 280728 transitions. [2019-11-15 19:54:25,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-11-15 19:54:25,770 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:25,770 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:25,770 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:54:25,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:25,771 INFO L82 PathProgramCache]: Analyzing trace with hash 956977237, now seen corresponding path program 1 times [2019-11-15 19:54:25,771 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:25,771 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420160476] [2019-11-15 19:54:25,771 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:25,771 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:25,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:25,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:26,023 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:54:26,023 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420160476] [2019-11-15 19:54:26,024 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:26,024 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 19:54:26,024 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138199160] [2019-11-15 19:54:26,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 19:54:26,025 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:26,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:54:26,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:54:26,026 INFO L87 Difference]: Start difference. First operand 255008 states and 280728 transitions. Second operand 3 states. [2019-11-15 19:54:27,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:27,608 INFO L93 Difference]: Finished difference Result 477240 states and 525499 transitions. [2019-11-15 19:54:27,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:54:27,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 371 [2019-11-15 19:54:27,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:27,609 INFO L225 Difference]: With dead ends: 477240 [2019-11-15 19:54:27,609 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 19:54:27,711 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:54:27,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 19:54:27,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 19:54:27,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 19:54:27,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 19:54:27,712 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 371 [2019-11-15 19:54:27,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:27,713 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 19:54:27,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 19:54:27,713 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 19:54:27,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 19:54:27,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 19:54:34,125 WARN L191 SmtUtils]: Spent 6.39 s on a formula simplification. DAG size of input: 1412 DAG size of output: 279 [2019-11-15 19:54:37,047 WARN L191 SmtUtils]: Spent 2.92 s on a formula simplification. DAG size of input: 1412 DAG size of output: 279 [2019-11-15 19:54:40,049 WARN L191 SmtUtils]: Spent 3.00 s on a formula simplification. DAG size of input: 256 DAG size of output: 96 [2019-11-15 19:54:42,882 WARN L191 SmtUtils]: Spent 2.83 s on a formula simplification. DAG size of input: 256 DAG size of output: 96 [2019-11-15 19:54:42,883 INFO L443 ceAbstractionStarter]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-11-15 19:54:42,883 INFO L443 ceAbstractionStarter]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-11-15 19:54:42,884 INFO L443 ceAbstractionStarter]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,884 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,884 INFO L443 ceAbstractionStarter]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,884 INFO L443 ceAbstractionStarter]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,884 INFO L443 ceAbstractionStarter]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,884 INFO L443 ceAbstractionStarter]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,884 INFO L443 ceAbstractionStarter]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,884 INFO L443 ceAbstractionStarter]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-11-15 19:54:42,884 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,884 INFO L443 ceAbstractionStarter]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-11-15 19:54:42,884 INFO L443 ceAbstractionStarter]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-11-15 19:54:42,884 INFO L443 ceAbstractionStarter]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,884 INFO L443 ceAbstractionStarter]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,884 INFO L443 ceAbstractionStarter]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,884 INFO L443 ceAbstractionStarter]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,884 INFO L443 ceAbstractionStarter]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-11-15 19:54:42,884 INFO L443 ceAbstractionStarter]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-11-15 19:54:42,885 INFO L443 ceAbstractionStarter]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,885 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,885 INFO L443 ceAbstractionStarter]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,885 INFO L443 ceAbstractionStarter]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,885 INFO L443 ceAbstractionStarter]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,885 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,885 INFO L443 ceAbstractionStarter]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,885 INFO L443 ceAbstractionStarter]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,885 INFO L443 ceAbstractionStarter]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,885 INFO L443 ceAbstractionStarter]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,885 INFO L443 ceAbstractionStarter]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-11-15 19:54:42,885 INFO L443 ceAbstractionStarter]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-11-15 19:54:42,885 INFO L443 ceAbstractionStarter]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-11-15 19:54:42,885 INFO L443 ceAbstractionStarter]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,885 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,885 INFO L443 ceAbstractionStarter]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,886 INFO L443 ceAbstractionStarter]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,886 INFO L443 ceAbstractionStarter]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,886 INFO L443 ceAbstractionStarter]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,886 INFO L443 ceAbstractionStarter]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-11-15 19:54:42,886 INFO L443 ceAbstractionStarter]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-11-15 19:54:42,886 INFO L443 ceAbstractionStarter]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-11-15 19:54:42,886 INFO L443 ceAbstractionStarter]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,886 INFO L443 ceAbstractionStarter]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,886 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,886 INFO L443 ceAbstractionStarter]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,886 INFO L443 ceAbstractionStarter]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,886 INFO L443 ceAbstractionStarter]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,886 INFO L443 ceAbstractionStarter]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-11-15 19:54:42,886 INFO L443 ceAbstractionStarter]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-11-15 19:54:42,886 INFO L443 ceAbstractionStarter]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-11-15 19:54:42,886 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,886 INFO L443 ceAbstractionStarter]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,887 INFO L443 ceAbstractionStarter]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,887 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-11-15 19:54:42,887 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,887 INFO L443 ceAbstractionStarter]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-11-15 19:54:42,887 INFO L443 ceAbstractionStarter]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,887 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,887 INFO L443 ceAbstractionStarter]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-11-15 19:54:42,887 INFO L443 ceAbstractionStarter]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-11-15 19:54:42,887 INFO L443 ceAbstractionStarter]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,887 INFO L443 ceAbstractionStarter]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,887 INFO L443 ceAbstractionStarter]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,887 INFO L443 ceAbstractionStarter]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,887 INFO L443 ceAbstractionStarter]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,887 INFO L443 ceAbstractionStarter]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,887 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1569) no Hoare annotation was computed. [2019-11-15 19:54:42,888 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,888 INFO L443 ceAbstractionStarter]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-11-15 19:54:42,888 INFO L443 ceAbstractionStarter]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-11-15 19:54:42,888 INFO L443 ceAbstractionStarter]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-11-15 19:54:42,888 INFO L443 ceAbstractionStarter]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-11-15 19:54:42,888 INFO L443 ceAbstractionStarter]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-11-15 19:54:42,888 INFO L443 ceAbstractionStarter]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,888 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,889 INFO L443 ceAbstractionStarter]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,889 INFO L443 ceAbstractionStarter]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,889 INFO L443 ceAbstractionStarter]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,889 INFO L443 ceAbstractionStarter]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,889 INFO L443 ceAbstractionStarter]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,889 INFO L443 ceAbstractionStarter]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,889 INFO L443 ceAbstractionStarter]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,890 INFO L443 ceAbstractionStarter]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,890 INFO L443 ceAbstractionStarter]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-11-15 19:54:42,890 INFO L443 ceAbstractionStarter]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-11-15 19:54:42,890 INFO L443 ceAbstractionStarter]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-11-15 19:54:42,890 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,890 INFO L443 ceAbstractionStarter]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,890 INFO L443 ceAbstractionStarter]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,890 INFO L443 ceAbstractionStarter]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,891 INFO L443 ceAbstractionStarter]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,891 INFO L443 ceAbstractionStarter]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,891 INFO L443 ceAbstractionStarter]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,891 INFO L443 ceAbstractionStarter]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,891 INFO L443 ceAbstractionStarter]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,891 INFO L443 ceAbstractionStarter]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-11-15 19:54:42,891 INFO L443 ceAbstractionStarter]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-11-15 19:54:42,891 INFO L443 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-11-15 19:54:42,892 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-11-15 19:54:42,892 INFO L443 ceAbstractionStarter]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-11-15 19:54:42,892 INFO L443 ceAbstractionStarter]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,892 INFO L443 ceAbstractionStarter]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,892 INFO L443 ceAbstractionStarter]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,892 INFO L443 ceAbstractionStarter]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,892 INFO L443 ceAbstractionStarter]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,893 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 19:54:42,893 INFO L443 ceAbstractionStarter]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,893 INFO L443 ceAbstractionStarter]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,893 INFO L443 ceAbstractionStarter]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,893 INFO L443 ceAbstractionStarter]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-11-15 19:54:42,893 INFO L443 ceAbstractionStarter]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-11-15 19:54:42,893 INFO L443 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-11-15 19:54:42,893 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,894 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,894 INFO L443 ceAbstractionStarter]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,894 INFO L443 ceAbstractionStarter]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-11-15 19:54:42,894 INFO L443 ceAbstractionStarter]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-11-15 19:54:42,894 INFO L443 ceAbstractionStarter]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,894 INFO L443 ceAbstractionStarter]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,894 INFO L443 ceAbstractionStarter]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,895 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-11-15 19:54:42,895 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,895 INFO L443 ceAbstractionStarter]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-11-15 19:54:42,895 INFO L443 ceAbstractionStarter]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,895 INFO L443 ceAbstractionStarter]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-11-15 19:54:42,895 INFO L443 ceAbstractionStarter]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,895 INFO L443 ceAbstractionStarter]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,895 INFO L443 ceAbstractionStarter]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-11-15 19:54:42,895 INFO L443 ceAbstractionStarter]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-11-15 19:54:42,895 INFO L443 ceAbstractionStarter]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-11-15 19:54:42,895 INFO L443 ceAbstractionStarter]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-11-15 19:54:42,896 INFO L443 ceAbstractionStarter]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-11-15 19:54:42,896 INFO L443 ceAbstractionStarter]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-11-15 19:54:42,896 INFO L443 ceAbstractionStarter]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-11-15 19:54:42,896 INFO L443 ceAbstractionStarter]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,896 INFO L443 ceAbstractionStarter]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,896 INFO L443 ceAbstractionStarter]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,897 INFO L439 ceAbstractionStarter]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse16 (= ~a12~0 1))) (let ((.cse0 (not .cse16)) (.cse17 (not (= ~a26~0 1)))) (let ((.cse14 (<= ~a27~0 0)) (.cse18 (= 0 ~a3~0)) (.cse8 (and .cse0 .cse17)) (.cse19 (= 1 ~a0~0)) (.cse7 (= ~a27~0 1)) (.cse20 (= ~a15~0 1)) (.cse3 (= 1 ~a3~0)) (.cse15 (= 1 ~a6~0)) (.cse4 (<= ~a11~0 0)) (.cse6 (= 1 ~a4~0)) (.cse10 (not (= ~a7~0 1))) (.cse1 (<= ~a6~0 0)) (.cse2 (= ~a18~0 1)) (.cse11 (= 1 ~a10~0)) (.cse9 (not (= ~a3~0 2))) (.cse5 (= ~a5~0 1)) (.cse12 (= ~a11~0 1)) (.cse13 (= ~a16~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse7 .cse4 .cse8 .cse9 .cse5 .cse6) (and .cse10 .cse1 .cse2 .cse11 .cse8 .cse5 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse15 .cse16 .cse5 .cse12 .cse13 .cse14 .cse17) (and .cse1 .cse2 .cse18 .cse5 .cse12 .cse19 .cse13 .cse14) (and .cse1 .cse2 .cse8 .cse5 .cse12 .cse19) (and .cse1 .cse2 .cse16 .cse4 .cse9 .cse5 .cse6 .cse17) (and .cse2 .cse7 .cse15 .cse11 .cse4 .cse9 .cse5 .cse13) (and .cse1 .cse2 .cse7 .cse8 .cse9 .cse5 .cse12 .cse6) (and .cse0 .cse1 .cse2 .cse7 .cse11 .cse9 .cse5 .cse12 .cse13) (and .cse1 .cse2 .cse7 .cse4 .cse8 .cse5 .cse19) (and .cse1 .cse2 .cse11 .cse16 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse15 .cse5 .cse12 .cse19) (and .cse10 .cse0 .cse2 .cse15 .cse11 .cse4 .cse5) (and .cse10 .cse1 .cse2 .cse11 .cse16 .cse4 .cse5) (and .cse2 .cse15 .cse11 .cse9 .cse5 .cse12 .cse13 .cse6) (and .cse2 .cse15 .cse18 .cse5 .cse12 .cse19) (and .cse1 .cse2 .cse3 .cse16 .cse5 .cse12 .cse6) (and .cse0 .cse2 .cse15 .cse4 .cse9 .cse5) (and .cse1 .cse2 .cse7 .cse3 .cse5 .cse12 .cse13 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse19) (and .cse1 .cse2 .cse11 .cse16 .cse5 .cse12 .cse6) (and .cse1 .cse2 .cse11 .cse16 .cse4 .cse9 .cse5 .cse17) (and .cse1 .cse2 .cse7 .cse16 .cse4 .cse9 .cse5 .cse6) (and .cse10 .cse2 .cse15 .cse11 .cse4 .cse5 .cse6) (and .cse2 (and .cse1 (not .cse7) .cse9 .cse13) .cse11 .cse16 .cse5 .cse12) (and .cse1 .cse2 .cse3 .cse11 .cse4 .cse8 .cse5) (and .cse1 .cse2 .cse7 .cse16 .cse4 .cse9 .cse5 .cse20) (and .cse1 .cse2 .cse7 .cse3 .cse8 .cse5 .cse12 .cse13) (and .cse1 .cse2 .cse16 .cse5 .cse12 .cse19) (and .cse1 .cse2 .cse7 .cse5 .cse12 .cse19) (and .cse1 .cse2 .cse16 .cse4 .cse5 .cse19) (and .cse2 (and .cse10 .cse7 .cse15 .cse11 .cse4 .cse9 .cse5)) (and .cse1 .cse2 .cse3 .cse16 .cse4 .cse5 .cse17) (and .cse1 .cse2 .cse7 .cse11 .cse16 .cse4 .cse9 .cse5) (and .cse2 .cse15 .cse4 .cse5 .cse19) (and .cse2 .cse7 .cse15 .cse11 .cse12 .cse9 .cse5) (and .cse2 .cse7 .cse15 .cse11 .cse16 .cse4 .cse5 .cse20 .cse6) (and .cse0 .cse2 .cse7 .cse15 .cse9 .cse5 .cse12) (and .cse0 .cse10 .cse1 .cse2 .cse7 .cse11 .cse5 .cse12) (and .cse2 .cse7 .cse15 .cse5 .cse12 .cse13 .cse19) (and .cse10 .cse2 .cse7 .cse15 .cse11 .cse5 .cse12 .cse13 .cse6) (and .cse2 (and .cse7 .cse15 .cse4 .cse9 .cse5 .cse20 .cse6)) (and .cse0 .cse2 .cse15 .cse11 .cse5 .cse12) (and .cse2 .cse7 .cse15 .cse9 .cse5 .cse12 .cse13) (and .cse2 .cse7 .cse15 .cse12 .cse9 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse5 .cse12 .cse19 .cse6) (and .cse0 .cse1 .cse2 .cse7 .cse11 .cse4 .cse5 .cse20) (and .cse2 .cse3 .cse15 .cse4 .cse5 .cse6) (and .cse10 .cse1 .cse2 .cse11 .cse16 .cse9 .cse5 .cse12 .cse13))))) [2019-11-15 19:54:42,897 INFO L443 ceAbstractionStarter]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,897 INFO L443 ceAbstractionStarter]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,897 INFO L443 ceAbstractionStarter]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,898 INFO L443 ceAbstractionStarter]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-11-15 19:54:42,898 INFO L443 ceAbstractionStarter]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-11-15 19:54:42,898 INFO L443 ceAbstractionStarter]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,898 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,898 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 19:54:42,898 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,898 INFO L446 ceAbstractionStarter]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-11-15 19:54:42,899 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,899 INFO L443 ceAbstractionStarter]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,899 INFO L443 ceAbstractionStarter]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,899 INFO L443 ceAbstractionStarter]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,899 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,899 INFO L443 ceAbstractionStarter]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,899 INFO L443 ceAbstractionStarter]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-11-15 19:54:42,899 INFO L443 ceAbstractionStarter]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-11-15 19:54:42,899 INFO L443 ceAbstractionStarter]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,900 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,900 INFO L443 ceAbstractionStarter]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,900 INFO L443 ceAbstractionStarter]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,900 INFO L443 ceAbstractionStarter]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,900 INFO L443 ceAbstractionStarter]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,900 INFO L443 ceAbstractionStarter]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,900 INFO L443 ceAbstractionStarter]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,900 INFO L443 ceAbstractionStarter]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,900 INFO L443 ceAbstractionStarter]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-11-15 19:54:42,900 INFO L443 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-11-15 19:54:42,901 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,901 INFO L443 ceAbstractionStarter]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,901 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-11-15 19:54:42,901 INFO L443 ceAbstractionStarter]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-11-15 19:54:42,901 INFO L443 ceAbstractionStarter]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,902 INFO L439 ceAbstractionStarter]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse16 (= ~a12~0 1))) (let ((.cse0 (not .cse16)) (.cse17 (not (= ~a26~0 1)))) (let ((.cse14 (<= ~a27~0 0)) (.cse18 (= 0 ~a3~0)) (.cse8 (and .cse0 .cse17)) (.cse19 (= 1 ~a0~0)) (.cse7 (= ~a27~0 1)) (.cse20 (= ~a15~0 1)) (.cse3 (= 1 ~a3~0)) (.cse15 (= 1 ~a6~0)) (.cse4 (<= ~a11~0 0)) (.cse6 (= 1 ~a4~0)) (.cse10 (not (= ~a7~0 1))) (.cse1 (<= ~a6~0 0)) (.cse2 (= ~a18~0 1)) (.cse11 (= 1 ~a10~0)) (.cse9 (not (= ~a3~0 2))) (.cse5 (= ~a5~0 1)) (.cse12 (= ~a11~0 1)) (.cse13 (= ~a16~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse7 .cse4 .cse8 .cse9 .cse5 .cse6) (and .cse10 .cse1 .cse2 .cse11 .cse8 .cse5 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse15 .cse16 .cse5 .cse12 .cse13 .cse14 .cse17) (and .cse1 .cse2 .cse18 .cse5 .cse12 .cse19 .cse13 .cse14) (and .cse1 .cse2 .cse8 .cse5 .cse12 .cse19) (and .cse1 .cse2 .cse16 .cse4 .cse9 .cse5 .cse6 .cse17) (and .cse2 .cse7 .cse15 .cse11 .cse4 .cse9 .cse5 .cse13) (and .cse1 .cse2 .cse7 .cse8 .cse9 .cse5 .cse12 .cse6) (and .cse0 .cse1 .cse2 .cse7 .cse11 .cse9 .cse5 .cse12 .cse13) (and .cse1 .cse2 .cse7 .cse4 .cse8 .cse5 .cse19) (and .cse1 .cse2 .cse11 .cse16 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse15 .cse5 .cse12 .cse19) (and .cse10 .cse0 .cse2 .cse15 .cse11 .cse4 .cse5) (and .cse10 .cse1 .cse2 .cse11 .cse16 .cse4 .cse5) (and .cse2 .cse15 .cse11 .cse9 .cse5 .cse12 .cse13 .cse6) (and .cse2 .cse15 .cse18 .cse5 .cse12 .cse19) (and .cse1 .cse2 .cse3 .cse16 .cse5 .cse12 .cse6) (and .cse0 .cse2 .cse15 .cse4 .cse9 .cse5) (and .cse1 .cse2 .cse7 .cse3 .cse5 .cse12 .cse13 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse19) (and .cse1 .cse2 .cse11 .cse16 .cse5 .cse12 .cse6) (and .cse1 .cse2 .cse11 .cse16 .cse4 .cse9 .cse5 .cse17) (and .cse1 .cse2 .cse7 .cse16 .cse4 .cse9 .cse5 .cse6) (and .cse10 .cse2 .cse15 .cse11 .cse4 .cse5 .cse6) (and .cse2 (and .cse1 (not .cse7) .cse9 .cse13) .cse11 .cse16 .cse5 .cse12) (and .cse1 .cse2 .cse3 .cse11 .cse4 .cse8 .cse5) (and .cse1 .cse2 .cse7 .cse16 .cse4 .cse9 .cse5 .cse20) (and .cse1 .cse2 .cse7 .cse3 .cse8 .cse5 .cse12 .cse13) (and .cse1 .cse2 .cse16 .cse5 .cse12 .cse19) (and .cse1 .cse2 .cse7 .cse5 .cse12 .cse19) (and .cse1 .cse2 .cse16 .cse4 .cse5 .cse19) (and .cse2 (and .cse10 .cse7 .cse15 .cse11 .cse4 .cse9 .cse5)) (and .cse1 .cse2 .cse3 .cse16 .cse4 .cse5 .cse17) (and .cse1 .cse2 .cse7 .cse11 .cse16 .cse4 .cse9 .cse5) (and .cse2 .cse15 .cse4 .cse5 .cse19) (and .cse2 .cse7 .cse15 .cse11 .cse12 .cse9 .cse5) (and .cse2 .cse7 .cse15 .cse11 .cse16 .cse4 .cse5 .cse20 .cse6) (and .cse0 .cse2 .cse7 .cse15 .cse9 .cse5 .cse12) (and .cse0 .cse10 .cse1 .cse2 .cse7 .cse11 .cse5 .cse12) (and .cse2 .cse7 .cse15 .cse5 .cse12 .cse13 .cse19) (and .cse10 .cse2 .cse7 .cse15 .cse11 .cse5 .cse12 .cse13 .cse6) (and .cse2 (and .cse7 .cse15 .cse4 .cse9 .cse5 .cse20 .cse6)) (and .cse0 .cse2 .cse15 .cse11 .cse5 .cse12) (and .cse2 .cse7 .cse15 .cse9 .cse5 .cse12 .cse13) (and .cse2 .cse7 .cse15 .cse12 .cse9 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse5 .cse12 .cse19 .cse6) (and .cse0 .cse1 .cse2 .cse7 .cse11 .cse4 .cse5 .cse20) (and .cse2 .cse3 .cse15 .cse4 .cse5 .cse6) (and .cse10 .cse1 .cse2 .cse11 .cse16 .cse9 .cse5 .cse12 .cse13))))) [2019-11-15 19:54:42,902 INFO L443 ceAbstractionStarter]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,902 INFO L443 ceAbstractionStarter]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,902 INFO L443 ceAbstractionStarter]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,902 INFO L443 ceAbstractionStarter]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,902 INFO L443 ceAbstractionStarter]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-11-15 19:54:42,903 INFO L443 ceAbstractionStarter]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-11-15 19:54:42,903 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,903 INFO L443 ceAbstractionStarter]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,903 INFO L443 ceAbstractionStarter]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,903 INFO L443 ceAbstractionStarter]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,903 INFO L443 ceAbstractionStarter]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,903 INFO L443 ceAbstractionStarter]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,904 INFO L443 ceAbstractionStarter]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,904 INFO L443 ceAbstractionStarter]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,904 INFO L443 ceAbstractionStarter]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-11-15 19:54:42,904 INFO L443 ceAbstractionStarter]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-11-15 19:54:42,904 INFO L443 ceAbstractionStarter]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-11-15 19:54:42,904 INFO L443 ceAbstractionStarter]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,904 INFO L443 ceAbstractionStarter]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-11-15 19:54:42,904 INFO L443 ceAbstractionStarter]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,904 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,904 INFO L443 ceAbstractionStarter]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-11-15 19:54:42,904 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,904 INFO L443 ceAbstractionStarter]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,904 INFO L443 ceAbstractionStarter]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,904 INFO L443 ceAbstractionStarter]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,905 INFO L443 ceAbstractionStarter]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,905 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-11-15 19:54:42,905 INFO L443 ceAbstractionStarter]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,905 INFO L443 ceAbstractionStarter]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-11-15 19:54:42,905 INFO L443 ceAbstractionStarter]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-11-15 19:54:42,905 INFO L443 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-11-15 19:54:42,905 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,905 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,905 INFO L443 ceAbstractionStarter]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,905 INFO L443 ceAbstractionStarter]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,905 INFO L443 ceAbstractionStarter]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,906 INFO L443 ceAbstractionStarter]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,906 INFO L443 ceAbstractionStarter]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,906 INFO L443 ceAbstractionStarter]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,906 INFO L443 ceAbstractionStarter]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-11-15 19:54:42,906 INFO L443 ceAbstractionStarter]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-11-15 19:54:42,906 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,906 INFO L443 ceAbstractionStarter]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,906 INFO L443 ceAbstractionStarter]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-11-15 19:54:42,906 INFO L443 ceAbstractionStarter]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-11-15 19:54:42,906 INFO L443 ceAbstractionStarter]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-11-15 19:54:42,906 INFO L443 ceAbstractionStarter]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,906 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,906 INFO L443 ceAbstractionStarter]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,906 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,906 INFO L443 ceAbstractionStarter]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,907 INFO L443 ceAbstractionStarter]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,907 INFO L443 ceAbstractionStarter]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,907 INFO L443 ceAbstractionStarter]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,907 INFO L443 ceAbstractionStarter]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,907 INFO L443 ceAbstractionStarter]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,907 INFO L443 ceAbstractionStarter]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,907 INFO L443 ceAbstractionStarter]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-11-15 19:54:42,907 INFO L443 ceAbstractionStarter]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-11-15 19:54:42,907 INFO L443 ceAbstractionStarter]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-11-15 19:54:42,907 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 19:54:42,907 INFO L443 ceAbstractionStarter]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,907 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,907 INFO L443 ceAbstractionStarter]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,907 INFO L443 ceAbstractionStarter]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,907 INFO L443 ceAbstractionStarter]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,907 INFO L443 ceAbstractionStarter]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,907 INFO L443 ceAbstractionStarter]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,908 INFO L443 ceAbstractionStarter]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-11-15 19:54:42,908 INFO L443 ceAbstractionStarter]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-11-15 19:54:42,908 INFO L443 ceAbstractionStarter]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,908 INFO L443 ceAbstractionStarter]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-11-15 19:54:42,908 INFO L443 ceAbstractionStarter]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-11-15 19:54:42,908 INFO L443 ceAbstractionStarter]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-11-15 19:54:42,908 INFO L443 ceAbstractionStarter]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,908 INFO L443 ceAbstractionStarter]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,908 INFO L443 ceAbstractionStarter]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,909 INFO L443 ceAbstractionStarter]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,909 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,909 INFO L443 ceAbstractionStarter]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-11-15 19:54:42,909 INFO L443 ceAbstractionStarter]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-11-15 19:54:42,909 INFO L443 ceAbstractionStarter]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,909 INFO L443 ceAbstractionStarter]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,909 INFO L443 ceAbstractionStarter]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,909 INFO L443 ceAbstractionStarter]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-11-15 19:54:42,910 INFO L443 ceAbstractionStarter]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-11-15 19:54:42,910 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,910 INFO L443 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-11-15 19:54:42,910 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,910 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,910 INFO L443 ceAbstractionStarter]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,910 INFO L443 ceAbstractionStarter]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,911 INFO L443 ceAbstractionStarter]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,911 INFO L443 ceAbstractionStarter]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,911 INFO L443 ceAbstractionStarter]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,911 INFO L443 ceAbstractionStarter]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,911 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,911 INFO L443 ceAbstractionStarter]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,911 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 19:54:42,911 INFO L443 ceAbstractionStarter]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-11-15 19:54:42,912 INFO L443 ceAbstractionStarter]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-11-15 19:54:42,912 INFO L443 ceAbstractionStarter]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-11-15 19:54:42,912 INFO L443 ceAbstractionStarter]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,912 INFO L443 ceAbstractionStarter]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-11-15 19:54:42,912 INFO L443 ceAbstractionStarter]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-11-15 19:54:42,912 INFO L443 ceAbstractionStarter]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,912 INFO L443 ceAbstractionStarter]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,912 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,913 INFO L443 ceAbstractionStarter]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,913 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,913 INFO L443 ceAbstractionStarter]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,913 INFO L443 ceAbstractionStarter]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,913 INFO L443 ceAbstractionStarter]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,913 INFO L443 ceAbstractionStarter]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,913 INFO L443 ceAbstractionStarter]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-11-15 19:54:42,913 INFO L443 ceAbstractionStarter]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-11-15 19:54:42,913 INFO L443 ceAbstractionStarter]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-11-15 19:54:42,913 INFO L443 ceAbstractionStarter]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,913 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,913 INFO L443 ceAbstractionStarter]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,913 INFO L443 ceAbstractionStarter]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,913 INFO L443 ceAbstractionStarter]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 19:54:42,914 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,914 INFO L443 ceAbstractionStarter]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-11-15 19:54:42,914 INFO L443 ceAbstractionStarter]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-11-15 19:54:42,914 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,914 INFO L443 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-11-15 19:54:42,914 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-11-15 19:54:42,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 07:54:42 BoogieIcfgContainer [2019-11-15 19:54:42,958 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 19:54:42,958 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 19:54:42,958 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 19:54:42,958 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 19:54:42,959 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 07:53:33" (3/4) ... [2019-11-15 19:54:42,962 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 19:54:42,991 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 19:54:42,994 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 19:54:43,216 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_17ff8eb6-cfb8-48dd-9ac8-97a666b2b582/bin/uautomizer/witness.graphml [2019-11-15 19:54:43,216 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 19:54:43,217 INFO L168 Benchmark]: Toolchain (without parser) took 72571.99 ms. Allocated memory was 1.0 GB in the beginning and 5.3 GB in the end (delta: 4.3 GB). Free memory was 944.8 MB in the beginning and 3.1 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-11-15 19:54:43,217 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 19:54:43,218 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1032.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -141.2 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. [2019-11-15 19:54:43,218 INFO L168 Benchmark]: Boogie Procedure Inliner took 131.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2019-11-15 19:54:43,218 INFO L168 Benchmark]: Boogie Preprocessor took 127.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2019-11-15 19:54:43,219 INFO L168 Benchmark]: RCFGBuilder took 1980.97 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 119.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -162.7 MB). Peak memory consumption was 271.9 MB. Max. memory is 11.5 GB. [2019-11-15 19:54:43,219 INFO L168 Benchmark]: TraceAbstraction took 69036.40 ms. Allocated memory was 1.3 GB in the beginning and 5.3 GB in the end (delta: 4.0 GB). Free memory was 1.2 GB in the beginning and 3.2 GB in the end (delta: -2.0 GB). Peak memory consumption was 5.2 GB. Max. memory is 11.5 GB. [2019-11-15 19:54:43,220 INFO L168 Benchmark]: Witness Printer took 258.13 ms. Allocated memory is still 5.3 GB. Free memory was 3.2 GB in the beginning and 3.1 GB in the end (delta: 63.3 MB). Peak memory consumption was 63.3 MB. Max. memory is 11.5 GB. [2019-11-15 19:54:43,221 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.47 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1032.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -141.2 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 131.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 127.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1980.97 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 119.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -162.7 MB). Peak memory consumption was 271.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 69036.40 ms. Allocated memory was 1.3 GB in the beginning and 5.3 GB in the end (delta: 4.0 GB). Free memory was 1.2 GB in the beginning and 3.2 GB in the end (delta: -2.0 GB). Peak memory consumption was 5.2 GB. Max. memory is 11.5 GB. * Witness Printer took 258.13 ms. Allocated memory is still 5.3 GB. Free memory was 3.2 GB in the beginning and 3.1 GB in the end (delta: 63.3 MB). Peak memory consumption was 63.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1569]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1652]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1658]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((!(a12 == 1) && a6 <= 0) && a18 == 1) && 1 == a3) && a11 <= 0) && a5 == 1) && 1 == a4) || (((((((a6 <= 0 && a18 == 1) && a27 == 1) && a11 <= 0) && !(a12 == 1) && !(a26 == 1)) && !(a3 == 2)) && a5 == 1) && 1 == a4)) || ((((((((!(a7 == 1) && a6 <= 0) && a18 == 1) && 1 == a10) && !(a12 == 1) && !(a26 == 1)) && a5 == 1) && a11 == 1) && a16 == 1) && a27 <= 0)) || ((((((((a18 == 1 && 1 == a3) && 1 == a6) && a12 == 1) && a5 == 1) && a11 == 1) && a16 == 1) && a27 <= 0) && !(a26 == 1))) || (((((((a6 <= 0 && a18 == 1) && 0 == a3) && a5 == 1) && a11 == 1) && 1 == a0) && a16 == 1) && a27 <= 0)) || (((((a6 <= 0 && a18 == 1) && !(a12 == 1) && !(a26 == 1)) && a5 == 1) && a11 == 1) && 1 == a0)) || (((((((a6 <= 0 && a18 == 1) && a12 == 1) && a11 <= 0) && !(a3 == 2)) && a5 == 1) && 1 == a4) && !(a26 == 1))) || (((((((a18 == 1 && a27 == 1) && 1 == a6) && 1 == a10) && a11 <= 0) && !(a3 == 2)) && a5 == 1) && a16 == 1)) || (((((((a6 <= 0 && a18 == 1) && a27 == 1) && !(a12 == 1) && !(a26 == 1)) && !(a3 == 2)) && a5 == 1) && a11 == 1) && 1 == a4)) || ((((((((!(a12 == 1) && a6 <= 0) && a18 == 1) && a27 == 1) && 1 == a10) && !(a3 == 2)) && a5 == 1) && a11 == 1) && a16 == 1)) || ((((((a6 <= 0 && a18 == 1) && a27 == 1) && a11 <= 0) && !(a12 == 1) && !(a26 == 1)) && a5 == 1) && 1 == a0)) || ((((((a6 <= 0 && a18 == 1) && 1 == a10) && a12 == 1) && a11 <= 0) && a5 == 1) && 1 == a4)) || (((((!(a12 == 1) && a18 == 1) && 1 == a6) && a5 == 1) && a11 == 1) && 1 == a0)) || ((((((!(a7 == 1) && !(a12 == 1)) && a18 == 1) && 1 == a6) && 1 == a10) && a11 <= 0) && a5 == 1)) || ((((((!(a7 == 1) && a6 <= 0) && a18 == 1) && 1 == a10) && a12 == 1) && a11 <= 0) && a5 == 1)) || (((((((a18 == 1 && 1 == a6) && 1 == a10) && !(a3 == 2)) && a5 == 1) && a11 == 1) && a16 == 1) && 1 == a4)) || (((((a18 == 1 && 1 == a6) && 0 == a3) && a5 == 1) && a11 == 1) && 1 == a0)) || ((((((a6 <= 0 && a18 == 1) && 1 == a3) && a12 == 1) && a5 == 1) && a11 == 1) && 1 == a4)) || (((((!(a12 == 1) && a18 == 1) && 1 == a6) && a11 <= 0) && !(a3 == 2)) && a5 == 1)) || (((((((a6 <= 0 && a18 == 1) && a27 == 1) && 1 == a3) && a5 == 1) && a11 == 1) && a16 == 1) && 1 == a4)) || (((((a6 <= 0 && a18 == 1) && 1 == a3) && a11 <= 0) && a5 == 1) && 1 == a0)) || ((((((a6 <= 0 && a18 == 1) && 1 == a10) && a12 == 1) && a5 == 1) && a11 == 1) && 1 == a4)) || (((((((a6 <= 0 && a18 == 1) && 1 == a10) && a12 == 1) && a11 <= 0) && !(a3 == 2)) && a5 == 1) && !(a26 == 1))) || (((((((a6 <= 0 && a18 == 1) && a27 == 1) && a12 == 1) && a11 <= 0) && !(a3 == 2)) && a5 == 1) && 1 == a4)) || ((((((!(a7 == 1) && a18 == 1) && 1 == a6) && 1 == a10) && a11 <= 0) && a5 == 1) && 1 == a4)) || (((((a18 == 1 && ((a6 <= 0 && !(a27 == 1)) && !(a3 == 2)) && a16 == 1) && 1 == a10) && a12 == 1) && a5 == 1) && a11 == 1)) || ((((((a6 <= 0 && a18 == 1) && 1 == a3) && 1 == a10) && a11 <= 0) && !(a12 == 1) && !(a26 == 1)) && a5 == 1)) || (((((((a6 <= 0 && a18 == 1) && a27 == 1) && a12 == 1) && a11 <= 0) && !(a3 == 2)) && a5 == 1) && a15 == 1)) || (((((((a6 <= 0 && a18 == 1) && a27 == 1) && 1 == a3) && !(a12 == 1) && !(a26 == 1)) && a5 == 1) && a11 == 1) && a16 == 1)) || (((((a6 <= 0 && a18 == 1) && a12 == 1) && a5 == 1) && a11 == 1) && 1 == a0)) || (((((a6 <= 0 && a18 == 1) && a27 == 1) && a5 == 1) && a11 == 1) && 1 == a0)) || (((((a6 <= 0 && a18 == 1) && a12 == 1) && a11 <= 0) && a5 == 1) && 1 == a0)) || (a18 == 1 && (((((!(a7 == 1) && a27 == 1) && 1 == a6) && 1 == a10) && a11 <= 0) && !(a3 == 2)) && a5 == 1)) || ((((((a6 <= 0 && a18 == 1) && 1 == a3) && a12 == 1) && a11 <= 0) && a5 == 1) && !(a26 == 1))) || (((((((a6 <= 0 && a18 == 1) && a27 == 1) && 1 == a10) && a12 == 1) && a11 <= 0) && !(a3 == 2)) && a5 == 1)) || ((((a18 == 1 && 1 == a6) && a11 <= 0) && a5 == 1) && 1 == a0)) || ((((((a18 == 1 && a27 == 1) && 1 == a6) && 1 == a10) && a11 == 1) && !(a3 == 2)) && a5 == 1)) || ((((((((a18 == 1 && a27 == 1) && 1 == a6) && 1 == a10) && a12 == 1) && a11 <= 0) && a5 == 1) && a15 == 1) && 1 == a4)) || ((((((!(a12 == 1) && a18 == 1) && a27 == 1) && 1 == a6) && !(a3 == 2)) && a5 == 1) && a11 == 1)) || (((((((!(a12 == 1) && !(a7 == 1)) && a6 <= 0) && a18 == 1) && a27 == 1) && 1 == a10) && a5 == 1) && a11 == 1)) || ((((((a18 == 1 && a27 == 1) && 1 == a6) && a5 == 1) && a11 == 1) && a16 == 1) && 1 == a0)) || ((((((((!(a7 == 1) && a18 == 1) && a27 == 1) && 1 == a6) && 1 == a10) && a5 == 1) && a11 == 1) && a16 == 1) && 1 == a4)) || (a18 == 1 && (((((a27 == 1 && 1 == a6) && a11 <= 0) && !(a3 == 2)) && a5 == 1) && a15 == 1) && 1 == a4)) || (((((!(a12 == 1) && a18 == 1) && 1 == a6) && 1 == a10) && a5 == 1) && a11 == 1)) || ((((((a18 == 1 && a27 == 1) && 1 == a6) && !(a3 == 2)) && a5 == 1) && a11 == 1) && a16 == 1)) || ((((((a18 == 1 && a27 == 1) && 1 == a6) && a11 == 1) && !(a3 == 2)) && a5 == 1) && 1 == a4)) || ((((((a6 <= 0 && a18 == 1) && 1 == a3) && a5 == 1) && a11 == 1) && 1 == a0) && 1 == a4)) || (((((((!(a12 == 1) && a6 <= 0) && a18 == 1) && a27 == 1) && 1 == a10) && a11 <= 0) && a5 == 1) && a15 == 1)) || (((((a18 == 1 && 1 == a3) && 1 == a6) && a11 <= 0) && a5 == 1) && 1 == a4)) || ((((((((!(a7 == 1) && a6 <= 0) && a18 == 1) && 1 == a10) && a12 == 1) && !(a3 == 2)) && a5 == 1) && a11 == 1) && a16 == 1) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((!(a12 == 1) && a6 <= 0) && a18 == 1) && 1 == a3) && a11 <= 0) && a5 == 1) && 1 == a4) || (((((((a6 <= 0 && a18 == 1) && a27 == 1) && a11 <= 0) && !(a12 == 1) && !(a26 == 1)) && !(a3 == 2)) && a5 == 1) && 1 == a4)) || ((((((((!(a7 == 1) && a6 <= 0) && a18 == 1) && 1 == a10) && !(a12 == 1) && !(a26 == 1)) && a5 == 1) && a11 == 1) && a16 == 1) && a27 <= 0)) || ((((((((a18 == 1 && 1 == a3) && 1 == a6) && a12 == 1) && a5 == 1) && a11 == 1) && a16 == 1) && a27 <= 0) && !(a26 == 1))) || (((((((a6 <= 0 && a18 == 1) && 0 == a3) && a5 == 1) && a11 == 1) && 1 == a0) && a16 == 1) && a27 <= 0)) || (((((a6 <= 0 && a18 == 1) && !(a12 == 1) && !(a26 == 1)) && a5 == 1) && a11 == 1) && 1 == a0)) || (((((((a6 <= 0 && a18 == 1) && a12 == 1) && a11 <= 0) && !(a3 == 2)) && a5 == 1) && 1 == a4) && !(a26 == 1))) || (((((((a18 == 1 && a27 == 1) && 1 == a6) && 1 == a10) && a11 <= 0) && !(a3 == 2)) && a5 == 1) && a16 == 1)) || (((((((a6 <= 0 && a18 == 1) && a27 == 1) && !(a12 == 1) && !(a26 == 1)) && !(a3 == 2)) && a5 == 1) && a11 == 1) && 1 == a4)) || ((((((((!(a12 == 1) && a6 <= 0) && a18 == 1) && a27 == 1) && 1 == a10) && !(a3 == 2)) && a5 == 1) && a11 == 1) && a16 == 1)) || ((((((a6 <= 0 && a18 == 1) && a27 == 1) && a11 <= 0) && !(a12 == 1) && !(a26 == 1)) && a5 == 1) && 1 == a0)) || ((((((a6 <= 0 && a18 == 1) && 1 == a10) && a12 == 1) && a11 <= 0) && a5 == 1) && 1 == a4)) || (((((!(a12 == 1) && a18 == 1) && 1 == a6) && a5 == 1) && a11 == 1) && 1 == a0)) || ((((((!(a7 == 1) && !(a12 == 1)) && a18 == 1) && 1 == a6) && 1 == a10) && a11 <= 0) && a5 == 1)) || ((((((!(a7 == 1) && a6 <= 0) && a18 == 1) && 1 == a10) && a12 == 1) && a11 <= 0) && a5 == 1)) || (((((((a18 == 1 && 1 == a6) && 1 == a10) && !(a3 == 2)) && a5 == 1) && a11 == 1) && a16 == 1) && 1 == a4)) || (((((a18 == 1 && 1 == a6) && 0 == a3) && a5 == 1) && a11 == 1) && 1 == a0)) || ((((((a6 <= 0 && a18 == 1) && 1 == a3) && a12 == 1) && a5 == 1) && a11 == 1) && 1 == a4)) || (((((!(a12 == 1) && a18 == 1) && 1 == a6) && a11 <= 0) && !(a3 == 2)) && a5 == 1)) || (((((((a6 <= 0 && a18 == 1) && a27 == 1) && 1 == a3) && a5 == 1) && a11 == 1) && a16 == 1) && 1 == a4)) || (((((a6 <= 0 && a18 == 1) && 1 == a3) && a11 <= 0) && a5 == 1) && 1 == a0)) || ((((((a6 <= 0 && a18 == 1) && 1 == a10) && a12 == 1) && a5 == 1) && a11 == 1) && 1 == a4)) || (((((((a6 <= 0 && a18 == 1) && 1 == a10) && a12 == 1) && a11 <= 0) && !(a3 == 2)) && a5 == 1) && !(a26 == 1))) || (((((((a6 <= 0 && a18 == 1) && a27 == 1) && a12 == 1) && a11 <= 0) && !(a3 == 2)) && a5 == 1) && 1 == a4)) || ((((((!(a7 == 1) && a18 == 1) && 1 == a6) && 1 == a10) && a11 <= 0) && a5 == 1) && 1 == a4)) || (((((a18 == 1 && ((a6 <= 0 && !(a27 == 1)) && !(a3 == 2)) && a16 == 1) && 1 == a10) && a12 == 1) && a5 == 1) && a11 == 1)) || ((((((a6 <= 0 && a18 == 1) && 1 == a3) && 1 == a10) && a11 <= 0) && !(a12 == 1) && !(a26 == 1)) && a5 == 1)) || (((((((a6 <= 0 && a18 == 1) && a27 == 1) && a12 == 1) && a11 <= 0) && !(a3 == 2)) && a5 == 1) && a15 == 1)) || (((((((a6 <= 0 && a18 == 1) && a27 == 1) && 1 == a3) && !(a12 == 1) && !(a26 == 1)) && a5 == 1) && a11 == 1) && a16 == 1)) || (((((a6 <= 0 && a18 == 1) && a12 == 1) && a5 == 1) && a11 == 1) && 1 == a0)) || (((((a6 <= 0 && a18 == 1) && a27 == 1) && a5 == 1) && a11 == 1) && 1 == a0)) || (((((a6 <= 0 && a18 == 1) && a12 == 1) && a11 <= 0) && a5 == 1) && 1 == a0)) || (a18 == 1 && (((((!(a7 == 1) && a27 == 1) && 1 == a6) && 1 == a10) && a11 <= 0) && !(a3 == 2)) && a5 == 1)) || ((((((a6 <= 0 && a18 == 1) && 1 == a3) && a12 == 1) && a11 <= 0) && a5 == 1) && !(a26 == 1))) || (((((((a6 <= 0 && a18 == 1) && a27 == 1) && 1 == a10) && a12 == 1) && a11 <= 0) && !(a3 == 2)) && a5 == 1)) || ((((a18 == 1 && 1 == a6) && a11 <= 0) && a5 == 1) && 1 == a0)) || ((((((a18 == 1 && a27 == 1) && 1 == a6) && 1 == a10) && a11 == 1) && !(a3 == 2)) && a5 == 1)) || ((((((((a18 == 1 && a27 == 1) && 1 == a6) && 1 == a10) && a12 == 1) && a11 <= 0) && a5 == 1) && a15 == 1) && 1 == a4)) || ((((((!(a12 == 1) && a18 == 1) && a27 == 1) && 1 == a6) && !(a3 == 2)) && a5 == 1) && a11 == 1)) || (((((((!(a12 == 1) && !(a7 == 1)) && a6 <= 0) && a18 == 1) && a27 == 1) && 1 == a10) && a5 == 1) && a11 == 1)) || ((((((a18 == 1 && a27 == 1) && 1 == a6) && a5 == 1) && a11 == 1) && a16 == 1) && 1 == a0)) || ((((((((!(a7 == 1) && a18 == 1) && a27 == 1) && 1 == a6) && 1 == a10) && a5 == 1) && a11 == 1) && a16 == 1) && 1 == a4)) || (a18 == 1 && (((((a27 == 1 && 1 == a6) && a11 <= 0) && !(a3 == 2)) && a5 == 1) && a15 == 1) && 1 == a4)) || (((((!(a12 == 1) && a18 == 1) && 1 == a6) && 1 == a10) && a5 == 1) && a11 == 1)) || ((((((a18 == 1 && a27 == 1) && 1 == a6) && !(a3 == 2)) && a5 == 1) && a11 == 1) && a16 == 1)) || ((((((a18 == 1 && a27 == 1) && 1 == a6) && a11 == 1) && !(a3 == 2)) && a5 == 1) && 1 == a4)) || ((((((a6 <= 0 && a18 == 1) && 1 == a3) && a5 == 1) && a11 == 1) && 1 == a0) && 1 == a4)) || (((((((!(a12 == 1) && a6 <= 0) && a18 == 1) && a27 == 1) && 1 == a10) && a11 <= 0) && a5 == 1) && a15 == 1)) || (((((a18 == 1 && 1 == a3) && 1 == a6) && a11 <= 0) && a5 == 1) && 1 == a4)) || ((((((((!(a7 == 1) && a6 <= 0) && a18 == 1) && 1 == a10) && a12 == 1) && !(a3 == 2)) && a5 == 1) && a11 == 1) && a16 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. Result: SAFE, OverallTime: 68.9s, OverallIterations: 17, TraceHistogramMax: 5, AutomataDifference: 30.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 15.1s, HoareTripleCheckerStatistics: 2220 SDtfs, 6865 SDslu, 1160 SDs, 0 SdLazy, 12724 SolverSat, 2323 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 658 GetRequests, 623 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=255008occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 17.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 23461 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 2160 NumberOfFragments, 2483 HoareAnnotationTreeSize, 3 FomulaSimplifications, 123212 FormulaSimplificationTreeSizeReduction, 9.3s HoareSimplificationTime, 3 FomulaSimplificationsInter, 10546 FormulaSimplificationTreeSizeReductionInter, 5.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 5168 NumberOfCodeBlocks, 5168 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 5149 ConstructedInterpolants, 0 QuantifiedInterpolants, 2574062 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1057 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 19 InterpolantComputations, 17 PerfectInterpolantSequences, 2627/2634 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...