./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label22.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_2f5d759d-a6ff-4c2a-88ea-004615f53a2f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2f5d759d-a6ff-4c2a-88ea-004615f53a2f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2f5d759d-a6ff-4c2a-88ea-004615f53a2f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2f5d759d-a6ff-4c2a-88ea-004615f53a2f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label22.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2f5d759d-a6ff-4c2a-88ea-004615f53a2f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2f5d759d-a6ff-4c2a-88ea-004615f53a2f/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 d643ba28d95f16d18742963f1ebc32166d4daeb8 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 22:02:42,604 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:02:42,606 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:02:42,616 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:02:42,616 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:02:42,617 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:02:42,618 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:02:42,620 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:02:42,622 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:02:42,623 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:02:42,624 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:02:42,625 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:02:42,626 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:02:42,626 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:02:42,627 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:02:42,628 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:02:42,629 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:02:42,630 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:02:42,632 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:02:42,634 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:02:42,635 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:02:42,637 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:02:42,638 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:02:42,638 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:02:42,641 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:02:42,641 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:02:42,641 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:02:42,642 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:02:42,643 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:02:42,644 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:02:42,644 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:02:42,645 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:02:42,645 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:02:42,646 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:02:42,647 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:02:42,647 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:02:42,648 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:02:42,648 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:02:42,648 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:02:42,649 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:02:42,650 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:02:42,650 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2f5d759d-a6ff-4c2a-88ea-004615f53a2f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:02:42,664 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:02:42,664 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:02:42,666 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:02:42,666 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:02:42,666 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:02:42,666 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:02:42,667 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:02:42,667 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:02:42,667 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:02:42,667 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:02:42,667 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:02:42,667 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:02:42,668 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:02:42,668 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:02:42,668 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:02:42,668 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:02:42,668 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:02:42,669 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:02:42,669 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:02:42,669 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:02:42,669 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:02:42,669 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:02:42,670 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:02:42,670 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:02:42,670 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:02:42,670 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:02:42,671 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:02:42,671 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:02:42,671 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_2f5d759d-a6ff-4c2a-88ea-004615f53a2f/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 -> d643ba28d95f16d18742963f1ebc32166d4daeb8 [2019-11-15 22:02:42,701 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:02:42,711 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:02:42,714 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:02:42,715 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:02:42,715 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:02:42,716 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2f5d759d-a6ff-4c2a-88ea-004615f53a2f/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem01_label22.c [2019-11-15 22:02:42,773 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2f5d759d-a6ff-4c2a-88ea-004615f53a2f/bin/uautomizer/data/495acccb8/890b25905e034f0399f8ba235ab3403f/FLAGab5e379d9 [2019-11-15 22:02:43,269 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:02:43,270 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2f5d759d-a6ff-4c2a-88ea-004615f53a2f/sv-benchmarks/c/eca-rers2012/Problem01_label22.c [2019-11-15 22:02:43,289 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2f5d759d-a6ff-4c2a-88ea-004615f53a2f/bin/uautomizer/data/495acccb8/890b25905e034f0399f8ba235ab3403f/FLAGab5e379d9 [2019-11-15 22:02:43,785 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2f5d759d-a6ff-4c2a-88ea-004615f53a2f/bin/uautomizer/data/495acccb8/890b25905e034f0399f8ba235ab3403f [2019-11-15 22:02:43,787 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:02:43,788 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:02:43,789 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:02:43,789 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:02:43,792 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:02:43,793 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:02:43" (1/1) ... [2019-11-15 22:02:43,796 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e2e0d96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:02:43, skipping insertion in model container [2019-11-15 22:02:43,796 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:02:43" (1/1) ... [2019-11-15 22:02:43,803 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:02:43,842 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:02:44,248 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:02:44,253 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:02:44,356 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:02:44,371 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:02:44,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:02:44 WrapperNode [2019-11-15 22:02:44,372 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:02:44,373 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:02:44,373 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:02:44,373 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:02:44,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:02:44" (1/1) ... [2019-11-15 22:02:44,399 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:02:44" (1/1) ... [2019-11-15 22:02:44,450 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:02:44,451 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:02:44,451 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:02:44,451 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:02:44,460 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:02:44" (1/1) ... [2019-11-15 22:02:44,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:02:44" (1/1) ... [2019-11-15 22:02:44,464 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:02:44" (1/1) ... [2019-11-15 22:02:44,465 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:02:44" (1/1) ... [2019-11-15 22:02:44,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:02:44" (1/1) ... [2019-11-15 22:02:44,509 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:02:44" (1/1) ... [2019-11-15 22:02:44,513 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:02:44" (1/1) ... [2019-11-15 22:02:44,533 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:02:44,534 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:02:44,534 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:02:44,534 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:02:44,535 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:02:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f5d759d-a6ff-4c2a-88ea-004615f53a2f/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 22:02:44,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:02:44,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:02:45,769 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:02:45,769 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 22:02:45,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:02:45 BoogieIcfgContainer [2019-11-15 22:02:45,770 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:02:45,771 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:02:45,771 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:02:45,774 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:02:45,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:02:43" (1/3) ... [2019-11-15 22:02:45,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@232c693d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:02:45, skipping insertion in model container [2019-11-15 22:02:45,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:02:44" (2/3) ... [2019-11-15 22:02:45,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@232c693d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:02:45, skipping insertion in model container [2019-11-15 22:02:45,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:02:45" (3/3) ... [2019-11-15 22:02:45,778 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label22.c [2019-11-15 22:02:45,786 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:02:45,793 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:02:45,803 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:02:45,839 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:02:45,839 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:02:45,839 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:02:45,840 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:02:45,840 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:02:45,840 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:02:45,840 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:02:45,840 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:02:45,863 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-15 22:02:45,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-15 22:02:45,880 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:02:45,881 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] [2019-11-15 22:02:45,883 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:02:45,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:02:45,889 INFO L82 PathProgramCache]: Analyzing trace with hash -278590162, now seen corresponding path program 1 times [2019-11-15 22:02:45,896 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:02:45,897 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788242195] [2019-11-15 22:02:45,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:45,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:45,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:02:46,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:46,343 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 22:02:46,344 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788242195] [2019-11-15 22:02:46,344 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:02:46,345 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:02:46,345 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195357470] [2019-11-15 22:02:46,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:02:46,352 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:02:46,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:02:46,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:02:46,367 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-11-15 22:02:47,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:02:47,755 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-11-15 22:02:47,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:02:47,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-11-15 22:02:47,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:02:47,781 INFO L225 Difference]: With dead ends: 662 [2019-11-15 22:02:47,782 INFO L226 Difference]: Without dead ends: 397 [2019-11-15 22:02:47,790 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 22:02:47,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-15 22:02:47,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2019-11-15 22:02:47,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-11-15 22:02:47,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 559 transitions. [2019-11-15 22:02:47,880 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 559 transitions. Word has length 127 [2019-11-15 22:02:47,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:02:47,882 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 559 transitions. [2019-11-15 22:02:47,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:02:47,882 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 559 transitions. [2019-11-15 22:02:47,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-15 22:02:47,893 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:02:47,893 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] [2019-11-15 22:02:47,894 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:02:47,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:02:47,894 INFO L82 PathProgramCache]: Analyzing trace with hash 249291862, now seen corresponding path program 1 times [2019-11-15 22:02:47,895 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:02:47,895 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68692491] [2019-11-15 22:02:47,895 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:47,896 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:47,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:02:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:48,008 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 22:02:48,009 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68692491] [2019-11-15 22:02:48,009 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:02:48,009 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:02:48,010 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138266732] [2019-11-15 22:02:48,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:02:48,012 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:02:48,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:02:48,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:02:48,013 INFO L87 Difference]: Start difference. First operand 397 states and 559 transitions. Second operand 4 states. [2019-11-15 22:02:48,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:02:48,672 INFO L93 Difference]: Finished difference Result 1185 states and 1672 transitions. [2019-11-15 22:02:48,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:02:48,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-11-15 22:02:48,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:02:48,678 INFO L225 Difference]: With dead ends: 1185 [2019-11-15 22:02:48,679 INFO L226 Difference]: Without dead ends: 790 [2019-11-15 22:02:48,684 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 22:02:48,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-15 22:02:48,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-11-15 22:02:48,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-15 22:02:48,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1066 transitions. [2019-11-15 22:02:48,735 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1066 transitions. Word has length 132 [2019-11-15 22:02:48,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:02:48,736 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1066 transitions. [2019-11-15 22:02:48,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:02:48,736 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1066 transitions. [2019-11-15 22:02:48,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-15 22:02:48,739 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:02:48,739 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-11-15 22:02:48,739 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:02:48,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:02:48,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1600100500, now seen corresponding path program 1 times [2019-11-15 22:02:48,740 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:02:48,740 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337473894] [2019-11-15 22:02:48,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:48,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:48,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:02:48,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:48,848 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 22:02:48,849 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337473894] [2019-11-15 22:02:48,850 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:02:48,850 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:02:48,850 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722607368] [2019-11-15 22:02:48,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:02:48,852 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:02:48,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:02:48,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:02:48,856 INFO L87 Difference]: Start difference. First operand 790 states and 1066 transitions. Second operand 3 states. [2019-11-15 22:02:49,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:02:49,353 INFO L93 Difference]: Finished difference Result 1971 states and 2686 transitions. [2019-11-15 22:02:49,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:02:49,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-11-15 22:02:49,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:02:49,360 INFO L225 Difference]: With dead ends: 1971 [2019-11-15 22:02:49,360 INFO L226 Difference]: Without dead ends: 1183 [2019-11-15 22:02:49,362 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 22:02:49,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2019-11-15 22:02:49,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 921. [2019-11-15 22:02:49,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2019-11-15 22:02:49,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1246 transitions. [2019-11-15 22:02:49,390 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1246 transitions. Word has length 153 [2019-11-15 22:02:49,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:02:49,390 INFO L462 AbstractCegarLoop]: Abstraction has 921 states and 1246 transitions. [2019-11-15 22:02:49,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:02:49,391 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1246 transitions. [2019-11-15 22:02:49,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-15 22:02:49,394 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:02:49,394 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 22:02:49,394 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:02:49,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:02:49,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1232280553, now seen corresponding path program 1 times [2019-11-15 22:02:49,395 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:02:49,395 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145015414] [2019-11-15 22:02:49,395 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:49,395 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:49,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:02:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:49,492 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-15 22:02:49,492 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145015414] [2019-11-15 22:02:49,493 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:02:49,493 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:02:49,493 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140034886] [2019-11-15 22:02:49,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:02:49,494 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:02:49,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:02:49,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:02:49,494 INFO L87 Difference]: Start difference. First operand 921 states and 1246 transitions. Second operand 3 states. [2019-11-15 22:02:49,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:02:49,992 INFO L93 Difference]: Finished difference Result 2233 states and 2997 transitions. [2019-11-15 22:02:49,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:02:49,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2019-11-15 22:02:49,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:02:49,999 INFO L225 Difference]: With dead ends: 2233 [2019-11-15 22:02:49,999 INFO L226 Difference]: Without dead ends: 1314 [2019-11-15 22:02:50,001 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 22:02:50,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2019-11-15 22:02:50,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1052. [2019-11-15 22:02:50,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-11-15 22:02:50,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1370 transitions. [2019-11-15 22:02:50,030 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1370 transitions. Word has length 189 [2019-11-15 22:02:50,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:02:50,031 INFO L462 AbstractCegarLoop]: Abstraction has 1052 states and 1370 transitions. [2019-11-15 22:02:50,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:02:50,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1370 transitions. [2019-11-15 22:02:50,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-15 22:02:50,034 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:02:50,035 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-11-15 22:02:50,035 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:02:50,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:02:50,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1116748331, now seen corresponding path program 1 times [2019-11-15 22:02:50,035 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:02:50,036 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502817153] [2019-11-15 22:02:50,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:50,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:50,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:02:50,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:50,214 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-15 22:02:50,216 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502817153] [2019-11-15 22:02:50,216 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:02:50,216 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:02:50,217 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824247209] [2019-11-15 22:02:50,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:02:50,218 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:02:50,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:02:50,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:02:50,220 INFO L87 Difference]: Start difference. First operand 1052 states and 1370 transitions. Second operand 4 states. [2019-11-15 22:02:50,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:02:50,883 INFO L93 Difference]: Finished difference Result 2238 states and 2892 transitions. [2019-11-15 22:02:50,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:02:50,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2019-11-15 22:02:50,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:02:50,890 INFO L225 Difference]: With dead ends: 2238 [2019-11-15 22:02:50,890 INFO L226 Difference]: Without dead ends: 1188 [2019-11-15 22:02:50,892 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:02:50,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2019-11-15 22:02:50,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 1183. [2019-11-15 22:02:50,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-11-15 22:02:50,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1507 transitions. [2019-11-15 22:02:50,917 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1507 transitions. Word has length 197 [2019-11-15 22:02:50,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:02:50,918 INFO L462 AbstractCegarLoop]: Abstraction has 1183 states and 1507 transitions. [2019-11-15 22:02:50,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:02:50,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1507 transitions. [2019-11-15 22:02:50,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-15 22:02:50,922 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:02:50,922 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-11-15 22:02:50,923 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:02:50,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:02:50,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1390292323, now seen corresponding path program 1 times [2019-11-15 22:02:50,923 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:02:50,924 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616734663] [2019-11-15 22:02:50,924 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:50,924 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:50,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:02:50,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:51,018 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-15 22:02:51,018 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616734663] [2019-11-15 22:02:51,018 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:02:51,019 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:02:51,019 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779990271] [2019-11-15 22:02:51,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:02:51,019 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:02:51,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:02:51,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:02:51,020 INFO L87 Difference]: Start difference. First operand 1183 states and 1507 transitions. Second operand 5 states. [2019-11-15 22:02:51,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:02:51,924 INFO L93 Difference]: Finished difference Result 2495 states and 3215 transitions. [2019-11-15 22:02:51,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:02:51,924 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 201 [2019-11-15 22:02:51,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:02:51,931 INFO L225 Difference]: With dead ends: 2495 [2019-11-15 22:02:51,932 INFO L226 Difference]: Without dead ends: 1445 [2019-11-15 22:02:51,933 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 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 22:02:51,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-15 22:02:51,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2019-11-15 22:02:51,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-15 22:02:51,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1799 transitions. [2019-11-15 22:02:51,963 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1799 transitions. Word has length 201 [2019-11-15 22:02:51,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:02:51,963 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1799 transitions. [2019-11-15 22:02:51,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:02:51,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1799 transitions. [2019-11-15 22:02:51,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-15 22:02:51,968 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:02:51,968 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-11-15 22:02:51,968 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:02:51,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:02:51,969 INFO L82 PathProgramCache]: Analyzing trace with hash 651133218, now seen corresponding path program 1 times [2019-11-15 22:02:51,969 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:02:51,969 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66703035] [2019-11-15 22:02:51,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:51,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:51,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:02:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:52,034 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-15 22:02:52,034 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66703035] [2019-11-15 22:02:52,035 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:02:52,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:02:52,035 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952825851] [2019-11-15 22:02:52,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:02:52,036 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:02:52,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:02:52,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:02:52,036 INFO L87 Difference]: Start difference. First operand 1445 states and 1799 transitions. Second operand 3 states. [2019-11-15 22:02:52,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:02:52,570 INFO L93 Difference]: Finished difference Result 3150 states and 3936 transitions. [2019-11-15 22:02:52,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:02:52,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-11-15 22:02:52,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:02:52,578 INFO L225 Difference]: With dead ends: 3150 [2019-11-15 22:02:52,578 INFO L226 Difference]: Without dead ends: 1576 [2019-11-15 22:02:52,580 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 22:02:52,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2019-11-15 22:02:52,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1445. [2019-11-15 22:02:52,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-15 22:02:52,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1592 transitions. [2019-11-15 22:02:52,610 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1592 transitions. Word has length 204 [2019-11-15 22:02:52,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:02:52,610 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1592 transitions. [2019-11-15 22:02:52,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:02:52,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1592 transitions. [2019-11-15 22:02:52,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-11-15 22:02:52,617 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:02:52,617 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:02:52,617 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:02:52,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:02:52,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1390965986, now seen corresponding path program 1 times [2019-11-15 22:02:52,618 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:02:52,618 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721426788] [2019-11-15 22:02:52,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:52,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:52,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:02:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:52,732 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-15 22:02:52,732 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721426788] [2019-11-15 22:02:52,733 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:02:52,733 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:02:52,733 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983473135] [2019-11-15 22:02:52,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:02:52,733 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:02:52,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:02:52,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:02:52,734 INFO L87 Difference]: Start difference. First operand 1445 states and 1592 transitions. Second operand 3 states. [2019-11-15 22:02:53,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:02:53,155 INFO L93 Difference]: Finished difference Result 3412 states and 3789 transitions. [2019-11-15 22:02:53,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:02:53,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2019-11-15 22:02:53,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:02:53,166 INFO L225 Difference]: With dead ends: 3412 [2019-11-15 22:02:53,166 INFO L226 Difference]: Without dead ends: 2100 [2019-11-15 22:02:53,169 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 22:02:53,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-11-15 22:02:53,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1707. [2019-11-15 22:02:53,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-15 22:02:53,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1869 transitions. [2019-11-15 22:02:53,211 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1869 transitions. Word has length 219 [2019-11-15 22:02:53,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:02:53,212 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 1869 transitions. [2019-11-15 22:02:53,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:02:53,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1869 transitions. [2019-11-15 22:02:53,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-11-15 22:02:53,218 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:02:53,219 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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] [2019-11-15 22:02:53,219 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:02:53,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:02:53,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1021467306, now seen corresponding path program 1 times [2019-11-15 22:02:53,220 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:02:53,220 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260646619] [2019-11-15 22:02:53,220 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:53,220 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:53,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:02:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:53,494 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 205 proven. 27 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-15 22:02:53,494 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260646619] [2019-11-15 22:02:53,494 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685085446] [2019-11-15 22:02:53,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f5d759d-a6ff-4c2a-88ea-004615f53a2f/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 22:02:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:53,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:02:53,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:02:53,716 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-15 22:02:53,717 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:02:53,717 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-15 22:02:53,717 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659594979] [2019-11-15 22:02:53,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:02:53,720 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:02:53,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:02:53,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:02:53,720 INFO L87 Difference]: Start difference. First operand 1707 states and 1869 transitions. Second operand 3 states. [2019-11-15 22:02:54,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:02:54,141 INFO L93 Difference]: Finished difference Result 1707 states and 1869 transitions. [2019-11-15 22:02:54,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:02:54,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2019-11-15 22:02:54,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:02:54,142 INFO L225 Difference]: With dead ends: 1707 [2019-11-15 22:02:54,142 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 22:02:54,144 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 248 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:02:54,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 22:02:54,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 22:02:54,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 22:02:54,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 22:02:54,145 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 248 [2019-11-15 22:02:54,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:02:54,145 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:02:54,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:02:54,145 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:02:54,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 22:02:54,349 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:02:54,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 22:02:54,644 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-15 22:02:54,644 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-15 22:02:54,644 INFO L443 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,644 INFO L443 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,644 INFO L443 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,644 INFO L443 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,644 INFO L443 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,644 INFO L443 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,644 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-15 22:02:54,644 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-15 22:02:54,644 INFO L443 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-15 22:02:54,645 INFO L443 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-15 22:02:54,645 INFO L443 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-15 22:02:54,645 INFO L443 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-15 22:02:54,645 INFO L443 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-15 22:02:54,645 INFO L443 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-15 22:02:54,645 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-15 22:02:54,645 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-15 22:02:54,645 INFO L443 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,645 INFO L443 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,645 INFO L443 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,645 INFO L443 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,645 INFO L443 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,645 INFO L443 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,645 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-15 22:02:54,646 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-15 22:02:54,646 INFO L443 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-15 22:02:54,646 INFO L443 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-15 22:02:54,646 INFO L443 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-15 22:02:54,646 INFO L443 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-15 22:02:54,646 INFO L443 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-15 22:02:54,646 INFO L443 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-15 22:02:54,646 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-15 22:02:54,646 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-15 22:02:54,646 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-15 22:02:54,646 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-15 22:02:54,646 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-15 22:02:54,646 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-15 22:02:54,646 INFO L443 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-15 22:02:54,646 INFO L443 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,647 INFO L443 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,647 INFO L443 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,647 INFO L443 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,647 INFO L443 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,647 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-15 22:02:54,647 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-15 22:02:54,647 INFO L443 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-15 22:02:54,647 INFO L443 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-15 22:02:54,647 INFO L443 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-15 22:02:54,647 INFO L443 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-15 22:02:54,647 INFO L443 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-15 22:02:54,647 INFO L443 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-15 22:02:54,647 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-15 22:02:54,651 INFO L439 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= ~a21~0 1))) (or (and (not (= ~a16~0 6)) .cse0) (and .cse0 (= 15 ~a8~0)) (and (= ~a17~0 1) .cse0) (and (= 1 ~a7~0) (<= ~a21~0 0)))) [2019-11-15 22:02:54,651 INFO L443 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,651 INFO L443 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,651 INFO L443 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,651 INFO L443 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,651 INFO L443 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,651 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-15 22:02:54,652 INFO L443 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-15 22:02:54,652 INFO L443 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-15 22:02:54,652 INFO L443 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-15 22:02:54,652 INFO L443 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-15 22:02:54,652 INFO L443 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-15 22:02:54,652 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-15 22:02:54,652 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-15 22:02:54,652 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-15 22:02:54,653 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-15 22:02:54,653 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-15 22:02:54,653 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-15 22:02:54,653 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-15 22:02:54,653 INFO L446 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-15 22:02:54,653 INFO L443 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,653 INFO L443 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,653 INFO L443 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,654 INFO L443 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,654 INFO L443 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,654 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-15 22:02:54,654 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-15 22:02:54,654 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-15 22:02:54,654 INFO L443 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-15 22:02:54,654 INFO L443 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-15 22:02:54,654 INFO L443 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-15 22:02:54,655 INFO L443 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-15 22:02:54,655 INFO L443 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-15 22:02:54,655 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-15 22:02:54,655 INFO L443 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,655 INFO L443 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,655 INFO L443 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,655 INFO L443 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,655 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-15 22:02:54,656 INFO L443 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,656 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-15 22:02:54,656 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-15 22:02:54,656 INFO L443 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-15 22:02:54,656 INFO L443 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-15 22:02:54,656 INFO L443 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-15 22:02:54,656 INFO L443 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-15 22:02:54,656 INFO L443 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-15 22:02:54,657 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 22:02:54,657 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-15 22:02:54,657 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-15 22:02:54,657 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-15 22:02:54,657 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-15 22:02:54,657 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-15 22:02:54,657 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-15 22:02:54,657 INFO L443 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,659 INFO L439 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (= ~a21~0 1))) (or (and (not (= ~a16~0 6)) .cse0) (and .cse0 (= 15 ~a8~0)) (and (= ~a17~0 1) .cse0) (and (= 1 ~a7~0) (<= ~a21~0 0)))) [2019-11-15 22:02:54,659 INFO L443 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,659 INFO L443 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,659 INFO L443 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,659 INFO L443 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,659 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-15 22:02:54,659 INFO L443 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-15 22:02:54,659 INFO L443 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-15 22:02:54,660 INFO L443 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-15 22:02:54,660 INFO L443 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-15 22:02:54,660 INFO L443 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-15 22:02:54,663 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-15 22:02:54,663 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-15 22:02:54,663 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 557) no Hoare annotation was computed. [2019-11-15 22:02:54,664 INFO L443 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,664 INFO L443 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,664 INFO L443 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,664 INFO L443 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,664 INFO L443 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,664 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-15 22:02:54,664 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 22:02:54,665 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-15 22:02:54,665 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-15 22:02:54,665 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-15 22:02:54,665 INFO L443 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-15 22:02:54,665 INFO L443 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-15 22:02:54,665 INFO L443 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-15 22:02:54,667 INFO L443 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-15 22:02:54,667 INFO L443 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-15 22:02:54,667 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-15 22:02:54,667 INFO L443 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-15 22:02:54,667 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-15 22:02:54,667 INFO L443 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,667 INFO L443 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,667 INFO L443 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,668 INFO L443 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,668 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-15 22:02:54,668 INFO L443 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,668 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,668 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-15 22:02:54,668 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-15 22:02:54,668 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 22:02:54,668 INFO L443 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-15 22:02:54,669 INFO L443 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-15 22:02:54,669 INFO L443 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-15 22:02:54,669 INFO L443 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-15 22:02:54,669 INFO L443 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-15 22:02:54,669 INFO L443 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-15 22:02:54,669 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-15 22:02:54,669 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-15 22:02:54,669 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-15 22:02:54,670 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-15 22:02:54,670 INFO L443 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,670 INFO L443 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,670 INFO L443 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,670 INFO L443 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,670 INFO L443 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,670 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-15 22:02:54,670 INFO L443 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,671 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-15 22:02:54,671 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-15 22:02:54,671 INFO L443 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-15 22:02:54,671 INFO L443 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-15 22:02:54,671 INFO L443 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-15 22:02:54,671 INFO L443 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-15 22:02:54,671 INFO L443 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-15 22:02:54,671 INFO L443 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-15 22:02:54,672 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-15 22:02:54,672 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-15 22:02:54,672 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-15 22:02:54,672 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 22:02:54,672 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-15 22:02:54,672 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-15 22:02:54,672 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-15 22:02:54,672 INFO L443 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,672 INFO L443 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,673 INFO L443 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,673 INFO L443 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,673 INFO L443 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,673 INFO L443 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 22:02:54,673 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-15 22:02:54,673 INFO L443 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-15 22:02:54,673 INFO L443 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-15 22:02:54,673 INFO L443 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-15 22:02:54,674 INFO L443 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-15 22:02:54,674 INFO L443 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-15 22:02:54,674 INFO L443 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-15 22:02:54,674 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-15 22:02:54,674 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-15 22:02:54,674 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-15 22:02:54,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:02:54 BoogieIcfgContainer [2019-11-15 22:02:54,691 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:02:54,691 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:02:54,691 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:02:54,692 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:02:54,692 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:02:45" (3/4) ... [2019-11-15 22:02:54,695 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 22:02:54,714 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 22:02:54,715 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 22:02:54,883 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_2f5d759d-a6ff-4c2a-88ea-004615f53a2f/bin/uautomizer/witness.graphml [2019-11-15 22:02:54,883 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:02:54,886 INFO L168 Benchmark]: Toolchain (without parser) took 11096.59 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 279.4 MB). Free memory was 939.4 MB in the beginning and 975.8 MB in the end (delta: -36.4 MB). Peak memory consumption was 243.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:02:54,886 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:02:54,887 INFO L168 Benchmark]: CACSL2BoogieTranslator took 583.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -172.3 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:02:54,888 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.71 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:02:54,888 INFO L168 Benchmark]: Boogie Preprocessor took 82.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:02:54,888 INFO L168 Benchmark]: RCFGBuilder took 1236.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 997.1 MB in the end (delta: 109.3 MB). Peak memory consumption was 109.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:02:54,890 INFO L168 Benchmark]: TraceAbstraction took 8919.83 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 139.5 MB). Free memory was 997.1 MB in the beginning and 995.6 MB in the end (delta: 1.5 MB). Peak memory consumption was 140.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:02:54,890 INFO L168 Benchmark]: Witness Printer took 192.19 ms. Allocated memory is still 1.3 GB. Free memory was 995.6 MB in the beginning and 975.8 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:02:54,893 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 583.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -172.3 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 77.71 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 82.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1236.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 997.1 MB in the end (delta: 109.3 MB). Peak memory consumption was 109.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8919.83 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 139.5 MB). Free memory was 997.1 MB in the beginning and 995.6 MB in the end (delta: 1.5 MB). Peak memory consumption was 140.9 MB. Max. memory is 11.5 GB. * Witness Printer took 192.19 ms. Allocated memory is still 1.3 GB. Free memory was 995.6 MB in the beginning and 975.8 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 557]: 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: 30]: Loop Invariant Derived loop invariant: (((!(a16 == 6) && a21 == 1) || (a21 == 1 && 15 == a8)) || (a17 == 1 && a21 == 1)) || (1 == a7 && a21 <= 0) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((!(a16 == 6) && a21 == 1) || (a21 == 1 && 15 == a8)) || (a17 == 1 && a21 == 1)) || (1 == a7 && a21 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 8.8s, OverallIterations: 9, TraceHistogramMax: 6, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 724 SDtfs, 1739 SDslu, 87 SDs, 0 SdLazy, 4163 SolverSat, 643 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 277 GetRequests, 257 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1707occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 1053 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 36 NumberOfFragments, 61 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1547 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 210 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1918 NumberOfCodeBlocks, 1918 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1908 ConstructedInterpolants, 0 QuantifiedInterpolants, 755365 SizeOfPredicates, 1 NumberOfNonLiveVariables, 447 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 1401/1428 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...