./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label24.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_ad35e77d-8f13-4348-aca9-82a86c5f0b3e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ad35e77d-8f13-4348-aca9-82a86c5f0b3e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ad35e77d-8f13-4348-aca9-82a86c5f0b3e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ad35e77d-8f13-4348-aca9-82a86c5f0b3e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label24.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ad35e77d-8f13-4348-aca9-82a86c5f0b3e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ad35e77d-8f13-4348-aca9-82a86c5f0b3e/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 c5fe2c6077c684b4b50af2f6570d6f5c736d513e ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 21:19:21,751 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:19:21,753 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:19:21,767 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:19:21,767 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:19:21,768 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:19:21,770 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:19:21,779 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:19:21,781 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:19:21,782 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:19:21,783 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:19:21,783 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:19:21,784 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:19:21,784 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:19:21,785 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:19:21,786 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:19:21,787 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:19:21,787 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:19:21,789 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:19:21,790 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:19:21,792 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:19:21,792 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:19:21,793 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:19:21,794 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:19:21,796 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:19:21,796 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:19:21,796 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:19:21,797 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:19:21,797 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:19:21,798 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:19:21,798 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:19:21,799 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:19:21,800 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:19:21,800 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:19:21,801 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:19:21,801 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:19:21,802 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:19:21,802 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:19:21,802 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:19:21,803 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:19:21,803 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:19:21,804 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ad35e77d-8f13-4348-aca9-82a86c5f0b3e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 21:19:21,816 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:19:21,817 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:19:21,818 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:19:21,818 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:19:21,818 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:19:21,818 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:19:21,818 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:19:21,819 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:19:21,819 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:19:21,819 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:19:21,819 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:19:21,820 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:19:21,820 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:19:21,820 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:19:21,820 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:19:21,820 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:19:21,821 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:19:21,821 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:19:21,821 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:19:21,821 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:19:21,821 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:19:21,822 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:19:21,822 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:19:21,822 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:19:21,822 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:19:21,822 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:19:21,823 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:19:21,823 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:19:21,823 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_ad35e77d-8f13-4348-aca9-82a86c5f0b3e/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 -> c5fe2c6077c684b4b50af2f6570d6f5c736d513e [2019-11-15 21:19:21,848 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:19:21,858 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:19:21,861 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:19:21,862 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:19:21,863 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:19:21,863 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ad35e77d-8f13-4348-aca9-82a86c5f0b3e/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem01_label24.c [2019-11-15 21:19:21,916 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ad35e77d-8f13-4348-aca9-82a86c5f0b3e/bin/uautomizer/data/3793d8dfc/6a95dcba94f9404a80c0e5313836ffbd/FLAGd990f55f8 [2019-11-15 21:19:22,405 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:19:22,407 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ad35e77d-8f13-4348-aca9-82a86c5f0b3e/sv-benchmarks/c/eca-rers2012/Problem01_label24.c [2019-11-15 21:19:22,424 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ad35e77d-8f13-4348-aca9-82a86c5f0b3e/bin/uautomizer/data/3793d8dfc/6a95dcba94f9404a80c0e5313836ffbd/FLAGd990f55f8 [2019-11-15 21:19:22,693 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ad35e77d-8f13-4348-aca9-82a86c5f0b3e/bin/uautomizer/data/3793d8dfc/6a95dcba94f9404a80c0e5313836ffbd [2019-11-15 21:19:22,695 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:19:22,696 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:19:22,697 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:19:22,698 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:19:22,701 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:19:22,702 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:19:22" (1/1) ... [2019-11-15 21:19:22,705 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f6fec81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:19:22, skipping insertion in model container [2019-11-15 21:19:22,705 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:19:22" (1/1) ... [2019-11-15 21:19:22,712 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:19:22,771 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:19:23,213 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:19:23,225 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:19:23,325 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:19:23,339 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:19:23,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:19:23 WrapperNode [2019-11-15 21:19:23,340 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:19:23,341 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:19:23,341 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:19:23,341 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:19:23,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:19:23" (1/1) ... [2019-11-15 21:19:23,373 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:19:23" (1/1) ... [2019-11-15 21:19:23,429 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:19:23,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:19:23,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:19:23,429 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:19:23,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:19:23" (1/1) ... [2019-11-15 21:19:23,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:19:23" (1/1) ... [2019-11-15 21:19:23,442 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:19:23" (1/1) ... [2019-11-15 21:19:23,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:19:23" (1/1) ... [2019-11-15 21:19:23,459 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:19:23" (1/1) ... [2019-11-15 21:19:23,468 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:19:23" (1/1) ... [2019-11-15 21:19:23,472 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:19:23" (1/1) ... [2019-11-15 21:19:23,478 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:19:23,478 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:19:23,478 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:19:23,478 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:19:23,479 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:19:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad35e77d-8f13-4348-aca9-82a86c5f0b3e/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 21:19:23,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:19:23,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:19:24,636 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:19:24,636 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 21:19:24,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:19:24 BoogieIcfgContainer [2019-11-15 21:19:24,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:19:24,638 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:19:24,638 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:19:24,640 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:19:24,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:19:22" (1/3) ... [2019-11-15 21:19:24,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6260580b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:19:24, skipping insertion in model container [2019-11-15 21:19:24,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:19:23" (2/3) ... [2019-11-15 21:19:24,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6260580b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:19:24, skipping insertion in model container [2019-11-15 21:19:24,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:19:24" (3/3) ... [2019-11-15 21:19:24,646 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label24.c [2019-11-15 21:19:24,656 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:19:24,664 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 21:19:24,674 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 21:19:24,711 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:19:24,711 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:19:24,711 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:19:24,711 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:19:24,711 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:19:24,712 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:19:24,712 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:19:24,712 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:19:24,735 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-15 21:19:24,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 21:19:24,747 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:24,748 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] [2019-11-15 21:19:24,750 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:24,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:24,755 INFO L82 PathProgramCache]: Analyzing trace with hash -342959657, now seen corresponding path program 1 times [2019-11-15 21:19:24,763 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:24,763 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748251291] [2019-11-15 21:19:24,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:24,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:24,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:25,199 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 21:19:25,200 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748251291] [2019-11-15 21:19:25,201 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:25,201 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:19:25,201 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953848980] [2019-11-15 21:19:25,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:25,206 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:25,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:25,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:25,221 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-11-15 21:19:26,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:26,635 INFO L93 Difference]: Finished difference Result 687 states and 1203 transitions. [2019-11-15 21:19:26,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:26,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-15 21:19:26,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:26,654 INFO L225 Difference]: With dead ends: 687 [2019-11-15 21:19:26,654 INFO L226 Difference]: Without dead ends: 397 [2019-11-15 21:19:26,658 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 21:19:26,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-15 21:19:26,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 266. [2019-11-15 21:19:26,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-15 21:19:26,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2019-11-15 21:19:26,742 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 98 [2019-11-15 21:19:26,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:26,743 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2019-11-15 21:19:26,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:26,743 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2019-11-15 21:19:26,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-15 21:19:26,753 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:26,754 INFO L380 BasicCegarLoop]: trace histogram [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 21:19:26,754 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:26,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:26,755 INFO L82 PathProgramCache]: Analyzing trace with hash 687887018, now seen corresponding path program 1 times [2019-11-15 21:19:26,755 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:26,755 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159495263] [2019-11-15 21:19:26,756 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:26,756 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:26,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:26,849 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:19:26,849 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159495263] [2019-11-15 21:19:26,850 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:26,850 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:19:26,851 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745743157] [2019-11-15 21:19:26,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:26,852 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:26,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:26,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:26,854 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2019-11-15 21:19:27,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:27,655 INFO L93 Difference]: Finished difference Result 1054 states and 1512 transitions. [2019-11-15 21:19:27,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:27,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-11-15 21:19:27,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:27,665 INFO L225 Difference]: With dead ends: 1054 [2019-11-15 21:19:27,665 INFO L226 Difference]: Without dead ends: 790 [2019-11-15 21:19:27,667 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 21:19:27,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-15 21:19:27,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-11-15 21:19:27,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-15 21:19:27,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1068 transitions. [2019-11-15 21:19:27,756 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1068 transitions. Word has length 104 [2019-11-15 21:19:27,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:27,757 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1068 transitions. [2019-11-15 21:19:27,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:27,757 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1068 transitions. [2019-11-15 21:19:27,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-15 21:19:27,760 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:27,760 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 21:19:27,761 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:27,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:27,761 INFO L82 PathProgramCache]: Analyzing trace with hash 61656490, now seen corresponding path program 1 times [2019-11-15 21:19:27,761 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:27,762 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203347746] [2019-11-15 21:19:27,762 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:27,764 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:27,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:27,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:27,929 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:19:27,930 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203347746] [2019-11-15 21:19:27,930 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:27,931 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:27,931 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332618614] [2019-11-15 21:19:27,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:27,933 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:27,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:27,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:27,937 INFO L87 Difference]: Start difference. First operand 790 states and 1068 transitions. Second operand 4 states. [2019-11-15 21:19:28,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:28,750 INFO L93 Difference]: Finished difference Result 2626 states and 3534 transitions. [2019-11-15 21:19:28,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:28,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-11-15 21:19:28,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:28,762 INFO L225 Difference]: With dead ends: 2626 [2019-11-15 21:19:28,762 INFO L226 Difference]: Without dead ends: 1707 [2019-11-15 21:19:28,767 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 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 21:19:28,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-11-15 21:19:28,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1052. [2019-11-15 21:19:28,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-11-15 21:19:28,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1301 transitions. [2019-11-15 21:19:28,803 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1301 transitions. Word has length 105 [2019-11-15 21:19:28,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:28,804 INFO L462 AbstractCegarLoop]: Abstraction has 1052 states and 1301 transitions. [2019-11-15 21:19:28,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:28,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1301 transitions. [2019-11-15 21:19:28,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-15 21:19:28,807 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:28,807 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:19:28,808 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:28,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:28,808 INFO L82 PathProgramCache]: Analyzing trace with hash -320878716, now seen corresponding path program 1 times [2019-11-15 21:19:28,808 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:28,809 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564024870] [2019-11-15 21:19:28,809 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:28,809 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:28,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:28,859 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 21:19:28,859 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564024870] [2019-11-15 21:19:28,860 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:28,860 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:19:28,860 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515761299] [2019-11-15 21:19:28,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:19:28,861 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:28,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:19:28,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:19:28,862 INFO L87 Difference]: Start difference. First operand 1052 states and 1301 transitions. Second operand 3 states. [2019-11-15 21:19:29,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:29,287 INFO L93 Difference]: Finished difference Result 2364 states and 2896 transitions. [2019-11-15 21:19:29,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:19:29,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-15 21:19:29,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:29,294 INFO L225 Difference]: With dead ends: 2364 [2019-11-15 21:19:29,294 INFO L226 Difference]: Without dead ends: 1183 [2019-11-15 21:19:29,296 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 21:19:29,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2019-11-15 21:19:29,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1052. [2019-11-15 21:19:29,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-11-15 21:19:29,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1263 transitions. [2019-11-15 21:19:29,324 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1263 transitions. Word has length 121 [2019-11-15 21:19:29,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:29,325 INFO L462 AbstractCegarLoop]: Abstraction has 1052 states and 1263 transitions. [2019-11-15 21:19:29,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:19:29,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1263 transitions. [2019-11-15 21:19:29,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-15 21:19:29,328 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:29,329 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-11-15 21:19:29,329 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:29,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:29,329 INFO L82 PathProgramCache]: Analyzing trace with hash 2118438855, now seen corresponding path program 1 times [2019-11-15 21:19:29,330 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:29,330 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962416869] [2019-11-15 21:19:29,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:29,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:29,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:29,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:29,401 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-15 21:19:29,402 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962416869] [2019-11-15 21:19:29,402 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:29,402 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:19:29,402 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622523241] [2019-11-15 21:19:29,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:19:29,403 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:29,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:19:29,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:19:29,404 INFO L87 Difference]: Start difference. First operand 1052 states and 1263 transitions. Second operand 3 states. [2019-11-15 21:19:29,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:29,819 INFO L93 Difference]: Finished difference Result 2626 states and 3162 transitions. [2019-11-15 21:19:29,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:19:29,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-11-15 21:19:29,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:29,826 INFO L225 Difference]: With dead ends: 2626 [2019-11-15 21:19:29,826 INFO L226 Difference]: Without dead ends: 1445 [2019-11-15 21:19:29,829 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 21:19:29,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-15 21:19:29,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1314. [2019-11-15 21:19:29,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2019-11-15 21:19:29,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1455 transitions. [2019-11-15 21:19:29,858 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1455 transitions. Word has length 132 [2019-11-15 21:19:29,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:29,859 INFO L462 AbstractCegarLoop]: Abstraction has 1314 states and 1455 transitions. [2019-11-15 21:19:29,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:19:29,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1455 transitions. [2019-11-15 21:19:29,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-15 21:19:29,863 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:29,863 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-15 21:19:29,863 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:29,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:29,864 INFO L82 PathProgramCache]: Analyzing trace with hash -909410889, now seen corresponding path program 1 times [2019-11-15 21:19:29,864 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:29,864 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76574558] [2019-11-15 21:19:29,864 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:29,864 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:29,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:29,950 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-15 21:19:29,951 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76574558] [2019-11-15 21:19:29,952 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:29,952 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:19:29,952 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208260050] [2019-11-15 21:19:29,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:19:29,953 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:29,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:19:29,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:19:29,953 INFO L87 Difference]: Start difference. First operand 1314 states and 1455 transitions. Second operand 3 states. [2019-11-15 21:19:30,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:30,373 INFO L93 Difference]: Finished difference Result 3281 states and 3647 transitions. [2019-11-15 21:19:30,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:19:30,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-11-15 21:19:30,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:30,383 INFO L225 Difference]: With dead ends: 3281 [2019-11-15 21:19:30,383 INFO L226 Difference]: Without dead ends: 1969 [2019-11-15 21:19:30,385 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 21:19:30,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-15 21:19:30,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1707. [2019-11-15 21:19:30,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-15 21:19:30,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1884 transitions. [2019-11-15 21:19:30,431 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1884 transitions. Word has length 151 [2019-11-15 21:19:30,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:30,431 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 1884 transitions. [2019-11-15 21:19:30,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:19:30,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1884 transitions. [2019-11-15 21:19:30,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-15 21:19:30,435 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:30,436 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:19:30,436 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:30,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:30,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1082991010, now seen corresponding path program 1 times [2019-11-15 21:19:30,436 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:30,437 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368846543] [2019-11-15 21:19:30,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:30,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:30,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:30,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:30,528 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-15 21:19:30,528 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368846543] [2019-11-15 21:19:30,529 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:30,529 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:19:30,529 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498387257] [2019-11-15 21:19:30,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:19:30,530 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:30,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:19:30,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:19:30,530 INFO L87 Difference]: Start difference. First operand 1707 states and 1884 transitions. Second operand 3 states. [2019-11-15 21:19:30,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:30,930 INFO L93 Difference]: Finished difference Result 3674 states and 4051 transitions. [2019-11-15 21:19:30,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:19:30,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-11-15 21:19:30,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:30,939 INFO L225 Difference]: With dead ends: 3674 [2019-11-15 21:19:30,939 INFO L226 Difference]: Without dead ends: 1969 [2019-11-15 21:19:30,941 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 21:19:30,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-15 21:19:31,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1969. [2019-11-15 21:19:31,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-15 21:19:31,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2159 transitions. [2019-11-15 21:19:31,008 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2159 transitions. Word has length 154 [2019-11-15 21:19:31,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:31,008 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2159 transitions. [2019-11-15 21:19:31,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:19:31,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2159 transitions. [2019-11-15 21:19:31,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-15 21:19:31,013 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:31,013 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-15 21:19:31,013 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:31,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:31,014 INFO L82 PathProgramCache]: Analyzing trace with hash -162013546, now seen corresponding path program 1 times [2019-11-15 21:19:31,014 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:31,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14063999] [2019-11-15 21:19:31,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:31,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:31,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:31,160 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-15 21:19:31,161 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14063999] [2019-11-15 21:19:31,161 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:31,161 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:19:31,161 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846435259] [2019-11-15 21:19:31,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:19:31,162 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:31,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:19:31,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:19:31,163 INFO L87 Difference]: Start difference. First operand 1969 states and 2159 transitions. Second operand 6 states. [2019-11-15 21:19:32,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:32,236 INFO L93 Difference]: Finished difference Result 3939 states and 4332 transitions. [2019-11-15 21:19:32,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:19:32,237 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 158 [2019-11-15 21:19:32,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:32,246 INFO L225 Difference]: With dead ends: 3939 [2019-11-15 21:19:32,246 INFO L226 Difference]: Without dead ends: 2103 [2019-11-15 21:19:32,248 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:19:32,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2103 states. [2019-11-15 21:19:32,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2103 to 1969. [2019-11-15 21:19:32,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-15 21:19:32,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2145 transitions. [2019-11-15 21:19:32,284 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2145 transitions. Word has length 158 [2019-11-15 21:19:32,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:32,284 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2145 transitions. [2019-11-15 21:19:32,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:19:32,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2145 transitions. [2019-11-15 21:19:32,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-15 21:19:32,289 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:32,289 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:19:32,290 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:32,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:32,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1222057446, now seen corresponding path program 1 times [2019-11-15 21:19:32,290 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:32,290 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380570252] [2019-11-15 21:19:32,291 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:32,291 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:32,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:32,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:32,407 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-15 21:19:32,407 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380570252] [2019-11-15 21:19:32,408 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:32,408 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:32,408 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498613726] [2019-11-15 21:19:32,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:32,409 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:32,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:32,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:32,410 INFO L87 Difference]: Start difference. First operand 1969 states and 2145 transitions. Second operand 4 states. [2019-11-15 21:19:33,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:33,028 INFO L93 Difference]: Finished difference Result 4198 states and 4572 transitions. [2019-11-15 21:19:33,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:33,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2019-11-15 21:19:33,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:33,035 INFO L225 Difference]: With dead ends: 4198 [2019-11-15 21:19:33,035 INFO L226 Difference]: Without dead ends: 2100 [2019-11-15 21:19:33,037 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 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 21:19:33,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-11-15 21:19:33,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1969. [2019-11-15 21:19:33,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-15 21:19:33,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2103 transitions. [2019-11-15 21:19:33,069 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2103 transitions. Word has length 191 [2019-11-15 21:19:33,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:33,070 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2103 transitions. [2019-11-15 21:19:33,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:33,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2103 transitions. [2019-11-15 21:19:33,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-15 21:19:33,075 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:33,075 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:19:33,075 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:33,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:33,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1413978792, now seen corresponding path program 1 times [2019-11-15 21:19:33,076 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:33,076 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411723500] [2019-11-15 21:19:33,076 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:33,076 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:33,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:33,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:33,178 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-15 21:19:33,178 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411723500] [2019-11-15 21:19:33,178 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:33,179 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:33,179 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664853202] [2019-11-15 21:19:33,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:33,179 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:33,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:33,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:33,180 INFO L87 Difference]: Start difference. First operand 1969 states and 2103 transitions. Second operand 4 states. [2019-11-15 21:19:33,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:33,619 INFO L93 Difference]: Finished difference Result 3936 states and 4206 transitions. [2019-11-15 21:19:33,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:33,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2019-11-15 21:19:33,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:33,626 INFO L225 Difference]: With dead ends: 3936 [2019-11-15 21:19:33,626 INFO L226 Difference]: Without dead ends: 2100 [2019-11-15 21:19:33,628 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 21:19:33,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-11-15 21:19:33,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1969. [2019-11-15 21:19:33,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-15 21:19:33,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2102 transitions. [2019-11-15 21:19:33,661 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2102 transitions. Word has length 197 [2019-11-15 21:19:33,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:33,662 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2102 transitions. [2019-11-15 21:19:33,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:33,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2102 transitions. [2019-11-15 21:19:33,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-11-15 21:19:33,667 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:33,667 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:19:33,668 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:33,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:33,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1798112851, now seen corresponding path program 1 times [2019-11-15 21:19:33,668 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:33,668 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878918396] [2019-11-15 21:19:33,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:33,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:33,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:33,841 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-15 21:19:33,841 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878918396] [2019-11-15 21:19:33,841 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:33,841 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:19:33,842 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132347323] [2019-11-15 21:19:33,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:19:33,842 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:33,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:19:33,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:19:33,844 INFO L87 Difference]: Start difference. First operand 1969 states and 2102 transitions. Second operand 6 states. [2019-11-15 21:19:34,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:34,552 INFO L93 Difference]: Finished difference Result 3971 states and 4248 transitions. [2019-11-15 21:19:34,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:19:34,553 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 218 [2019-11-15 21:19:34,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:34,561 INFO L225 Difference]: With dead ends: 3971 [2019-11-15 21:19:34,562 INFO L226 Difference]: Without dead ends: 2135 [2019-11-15 21:19:34,563 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:19:34,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2135 states. [2019-11-15 21:19:34,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2135 to 1969. [2019-11-15 21:19:34,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-15 21:19:34,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2088 transitions. [2019-11-15 21:19:34,595 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2088 transitions. Word has length 218 [2019-11-15 21:19:34,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:34,595 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2088 transitions. [2019-11-15 21:19:34,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:19:34,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2088 transitions. [2019-11-15 21:19:34,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-11-15 21:19:34,601 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:34,601 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:19:34,601 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:34,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:34,602 INFO L82 PathProgramCache]: Analyzing trace with hash -392691734, now seen corresponding path program 1 times [2019-11-15 21:19:34,602 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:34,602 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509846423] [2019-11-15 21:19:34,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:34,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:34,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:34,800 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-11-15 21:19:34,800 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509846423] [2019-11-15 21:19:34,800 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:34,801 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:34,801 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820866063] [2019-11-15 21:19:34,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:34,801 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:34,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:34,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:34,802 INFO L87 Difference]: Start difference. First operand 1969 states and 2088 transitions. Second operand 4 states. [2019-11-15 21:19:35,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:35,277 INFO L93 Difference]: Finished difference Result 3803 states and 4039 transitions. [2019-11-15 21:19:35,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:19:35,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-11-15 21:19:35,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:35,278 INFO L225 Difference]: With dead ends: 3803 [2019-11-15 21:19:35,278 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 21:19:35,281 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 21:19:35,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 21:19:35,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 21:19:35,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 21:19:35,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 21:19:35,285 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 240 [2019-11-15 21:19:35,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:35,285 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:19:35,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:35,285 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:19:35,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 21:19:35,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 21:19:35,773 WARN L191 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-11-15 21:19:36,089 WARN L191 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-11-15 21:19:36,091 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-15 21:19:36,091 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-15 21:19:36,091 INFO L443 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,091 INFO L443 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,091 INFO L443 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,091 INFO L443 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,091 INFO L443 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,092 INFO L443 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,092 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-15 21:19:36,092 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-15 21:19:36,092 INFO L443 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-15 21:19:36,092 INFO L443 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-15 21:19:36,092 INFO L443 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-15 21:19:36,092 INFO L443 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-15 21:19:36,092 INFO L443 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-15 21:19:36,092 INFO L443 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-15 21:19:36,092 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-15 21:19:36,093 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-15 21:19:36,093 INFO L443 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,093 INFO L443 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,093 INFO L443 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,093 INFO L443 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,093 INFO L443 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,094 INFO L443 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,094 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-15 21:19:36,094 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-15 21:19:36,094 INFO L443 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-15 21:19:36,094 INFO L443 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-15 21:19:36,094 INFO L443 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-15 21:19:36,094 INFO L443 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-15 21:19:36,094 INFO L443 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-15 21:19:36,094 INFO L443 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-15 21:19:36,095 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-15 21:19:36,095 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-15 21:19:36,095 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-15 21:19:36,095 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-15 21:19:36,095 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-15 21:19:36,095 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-15 21:19:36,095 INFO L443 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-15 21:19:36,095 INFO L443 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,095 INFO L443 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,095 INFO L443 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,095 INFO L443 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,096 INFO L443 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,096 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-15 21:19:36,096 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-15 21:19:36,096 INFO L443 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-15 21:19:36,096 INFO L443 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-15 21:19:36,096 INFO L443 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-15 21:19:36,096 INFO L443 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-15 21:19:36,096 INFO L443 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-15 21:19:36,096 INFO L443 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-15 21:19:36,096 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-15 21:19:36,097 INFO L439 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse11 (= ~a16~0 6)) (.cse10 (not (= 15 ~a8~0)))) (let ((.cse4 (<= ~a20~0 0)) (.cse1 (= ~a17~0 1)) (.cse2 (= ~a12~0 8)) (.cse0 (not (= ~a7~0 1))) (.cse6 (= ~a20~0 1)) (.cse8 (= ~a16~0 4)) (.cse9 (<= ~a17~0 0)) (.cse5 (or (and (not .cse11) .cse10) (= ~a8~0 13))) (.cse7 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse3 .cse6) (and .cse3 .cse7 .cse4) (and .cse0 .cse8 .cse9 .cse3 .cse6) (and .cse5 .cse4) (and .cse8 .cse9 .cse3 .cse4) (and .cse0 .cse10 .cse7) (and .cse0 .cse3 .cse11 .cse4) (and .cse0 .cse3 .cse6 .cse11) (and .cse11 .cse5) (and .cse5 .cse8 .cse3 (not .cse1)) (and .cse5 .cse1 .cse2 .cse6) (and .cse0 .cse3 .cse6 .cse7) (and .cse8 .cse9 .cse5) (and (and .cse10 .cse7) .cse3)))) [2019-11-15 21:19:36,097 INFO L443 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,097 INFO L443 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,098 INFO L443 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,098 INFO L443 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,098 INFO L443 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,098 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-15 21:19:36,098 INFO L443 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-15 21:19:36,098 INFO L443 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-15 21:19:36,098 INFO L443 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-15 21:19:36,098 INFO L443 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-15 21:19:36,098 INFO L443 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-15 21:19:36,098 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-15 21:19:36,098 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-15 21:19:36,099 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-15 21:19:36,099 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-15 21:19:36,099 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-15 21:19:36,099 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-15 21:19:36,099 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-15 21:19:36,099 INFO L446 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-15 21:19:36,099 INFO L443 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,099 INFO L443 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,099 INFO L443 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,099 INFO L443 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,100 INFO L443 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,100 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-15 21:19:36,100 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-15 21:19:36,100 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-15 21:19:36,100 INFO L443 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-15 21:19:36,100 INFO L443 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-15 21:19:36,100 INFO L443 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-15 21:19:36,100 INFO L443 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-15 21:19:36,100 INFO L443 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-15 21:19:36,100 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-15 21:19:36,100 INFO L443 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,101 INFO L443 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,101 INFO L443 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,101 INFO L443 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,101 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-15 21:19:36,101 INFO L443 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,101 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-15 21:19:36,101 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-15 21:19:36,101 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 470) no Hoare annotation was computed. [2019-11-15 21:19:36,101 INFO L443 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-15 21:19:36,101 INFO L443 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-15 21:19:36,102 INFO L443 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-15 21:19:36,102 INFO L443 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-15 21:19:36,102 INFO L443 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-15 21:19:36,102 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 21:19:36,102 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-15 21:19:36,102 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-15 21:19:36,102 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-15 21:19:36,102 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-15 21:19:36,102 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-15 21:19:36,102 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-15 21:19:36,103 INFO L443 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,103 INFO L439 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse11 (= ~a16~0 6)) (.cse10 (not (= 15 ~a8~0)))) (let ((.cse4 (<= ~a20~0 0)) (.cse1 (= ~a17~0 1)) (.cse2 (= ~a12~0 8)) (.cse0 (not (= ~a7~0 1))) (.cse6 (= ~a20~0 1)) (.cse8 (= ~a16~0 4)) (.cse9 (<= ~a17~0 0)) (.cse5 (or (and (not .cse11) .cse10) (= ~a8~0 13))) (.cse7 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse3 .cse6) (and .cse3 .cse7 .cse4) (and .cse0 .cse8 .cse9 .cse3 .cse6) (and .cse5 .cse4) (and .cse8 .cse9 .cse3 .cse4) (and .cse0 .cse10 .cse7) (and .cse0 .cse3 .cse11 .cse4) (and .cse0 .cse3 .cse6 .cse11) (and .cse11 .cse5) (and .cse5 .cse8 .cse3 (not .cse1)) (and .cse5 .cse1 .cse2 .cse6) (and .cse0 .cse3 .cse6 .cse7) (and .cse8 .cse9 .cse5) (and (and .cse10 .cse7) .cse3)))) [2019-11-15 21:19:36,103 INFO L443 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,103 INFO L443 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,103 INFO L443 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,103 INFO L443 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,103 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-15 21:19:36,103 INFO L443 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-15 21:19:36,104 INFO L443 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-15 21:19:36,104 INFO L443 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-15 21:19:36,104 INFO L443 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-15 21:19:36,104 INFO L443 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-15 21:19:36,104 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-15 21:19:36,104 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-15 21:19:36,104 INFO L443 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,105 INFO L443 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,105 INFO L443 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,105 INFO L443 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,105 INFO L443 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,105 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-15 21:19:36,105 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 21:19:36,105 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-15 21:19:36,106 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-15 21:19:36,106 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-15 21:19:36,106 INFO L443 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-15 21:19:36,106 INFO L443 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-15 21:19:36,106 INFO L443 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-15 21:19:36,106 INFO L443 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-15 21:19:36,106 INFO L443 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-15 21:19:36,106 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-15 21:19:36,107 INFO L443 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-15 21:19:36,107 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-15 21:19:36,107 INFO L443 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,107 INFO L443 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,107 INFO L443 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,107 INFO L443 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,107 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-15 21:19:36,107 INFO L443 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,108 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,108 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-15 21:19:36,108 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-15 21:19:36,108 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 21:19:36,108 INFO L443 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-15 21:19:36,108 INFO L443 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-15 21:19:36,108 INFO L443 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-15 21:19:36,109 INFO L443 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-15 21:19:36,109 INFO L443 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-15 21:19:36,109 INFO L443 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-15 21:19:36,109 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-15 21:19:36,109 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-15 21:19:36,109 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-15 21:19:36,109 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-15 21:19:36,109 INFO L443 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,110 INFO L443 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,110 INFO L443 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,110 INFO L443 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,110 INFO L443 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,110 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-15 21:19:36,110 INFO L443 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,110 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-15 21:19:36,110 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-15 21:19:36,111 INFO L443 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-15 21:19:36,111 INFO L443 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-15 21:19:36,111 INFO L443 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-15 21:19:36,111 INFO L443 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-15 21:19:36,111 INFO L443 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-15 21:19:36,111 INFO L443 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-15 21:19:36,111 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-15 21:19:36,111 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-15 21:19:36,112 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-15 21:19:36,112 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 21:19:36,112 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-15 21:19:36,112 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-15 21:19:36,112 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-15 21:19:36,112 INFO L443 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,112 INFO L443 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,113 INFO L443 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,113 INFO L443 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,113 INFO L443 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,113 INFO L443 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 21:19:36,113 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-15 21:19:36,113 INFO L443 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-15 21:19:36,113 INFO L443 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-15 21:19:36,113 INFO L443 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-15 21:19:36,114 INFO L443 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-15 21:19:36,114 INFO L443 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-15 21:19:36,114 INFO L443 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-15 21:19:36,114 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-15 21:19:36,114 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-15 21:19:36,114 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-15 21:19:36,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 09:19:36 BoogieIcfgContainer [2019-11-15 21:19:36,149 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 21:19:36,149 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:19:36,149 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:19:36,149 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:19:36,150 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:19:24" (3/4) ... [2019-11-15 21:19:36,153 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 21:19:36,173 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 21:19:36,178 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 21:19:36,302 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ad35e77d-8f13-4348-aca9-82a86c5f0b3e/bin/uautomizer/witness.graphml [2019-11-15 21:19:36,302 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:19:36,303 INFO L168 Benchmark]: Toolchain (without parser) took 13607.28 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 383.3 MB). Free memory was 939.4 MB in the beginning and 960.8 MB in the end (delta: -21.3 MB). Peak memory consumption was 361.9 MB. Max. memory is 11.5 GB. [2019-11-15 21:19:36,304 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:19:36,304 INFO L168 Benchmark]: CACSL2BoogieTranslator took 643.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -174.5 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:19:36,304 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.38 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:19:36,305 INFO L168 Benchmark]: Boogie Preprocessor took 48.81 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 21:19:36,305 INFO L168 Benchmark]: RCFGBuilder took 1159.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 993.9 MB in the end (delta: 109.2 MB). Peak memory consumption was 109.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:19:36,305 INFO L168 Benchmark]: TraceAbstraction took 11510.87 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 239.6 MB). Free memory was 993.9 MB in the beginning and 985.2 MB in the end (delta: 8.7 MB). Peak memory consumption was 248.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:19:36,306 INFO L168 Benchmark]: Witness Printer took 153.08 ms. Allocated memory is still 1.4 GB. Free memory was 985.2 MB in the beginning and 960.8 MB in the end (delta: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:19:36,308 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 643.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -174.5 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 88.38 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.81 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 1159.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 993.9 MB in the end (delta: 109.2 MB). Peak memory consumption was 109.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11510.87 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 239.6 MB). Free memory was 993.9 MB in the beginning and 985.2 MB in the end (delta: 8.7 MB). Peak memory consumption was 248.3 MB. Max. memory is 11.5 GB. * Witness Printer took 153.08 ms. Allocated memory is still 1.4 GB. Free memory was 985.2 MB in the beginning and 960.8 MB in the end (delta: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 470]: 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: (((((((((((((((((!(a7 == 1) && a17 == 1) && a12 == 8) && a21 == 1) && a20 <= 0) || ((((!(a16 == 6) && !(15 == a8)) || a8 == 13) && a21 == 1) && a20 == 1)) || ((a21 == 1 && 5 == a16) && a20 <= 0)) || ((((!(a7 == 1) && a16 == 4) && a17 <= 0) && a21 == 1) && a20 == 1)) || (((!(a16 == 6) && !(15 == a8)) || a8 == 13) && a20 <= 0)) || (((a16 == 4 && a17 <= 0) && a21 == 1) && a20 <= 0)) || ((!(a7 == 1) && !(15 == a8)) && 5 == a16)) || (((!(a7 == 1) && a21 == 1) && a16 == 6) && a20 <= 0)) || (((!(a7 == 1) && a21 == 1) && a20 == 1) && a16 == 6)) || (a16 == 6 && ((!(a16 == 6) && !(15 == a8)) || a8 == 13))) || (((((!(a16 == 6) && !(15 == a8)) || a8 == 13) && a16 == 4) && a21 == 1) && !(a17 == 1))) || (((((!(a16 == 6) && !(15 == a8)) || a8 == 13) && a17 == 1) && a12 == 8) && a20 == 1)) || (((!(a7 == 1) && a21 == 1) && a20 == 1) && 5 == a16)) || ((a16 == 4 && a17 <= 0) && ((!(a16 == 6) && !(15 == a8)) || a8 == 13))) || ((!(15 == a8) && 5 == a16) && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((((((((((!(a7 == 1) && a17 == 1) && a12 == 8) && a21 == 1) && a20 <= 0) || ((((!(a16 == 6) && !(15 == a8)) || a8 == 13) && a21 == 1) && a20 == 1)) || ((a21 == 1 && 5 == a16) && a20 <= 0)) || ((((!(a7 == 1) && a16 == 4) && a17 <= 0) && a21 == 1) && a20 == 1)) || (((!(a16 == 6) && !(15 == a8)) || a8 == 13) && a20 <= 0)) || (((a16 == 4 && a17 <= 0) && a21 == 1) && a20 <= 0)) || ((!(a7 == 1) && !(15 == a8)) && 5 == a16)) || (((!(a7 == 1) && a21 == 1) && a16 == 6) && a20 <= 0)) || (((!(a7 == 1) && a21 == 1) && a20 == 1) && a16 == 6)) || (a16 == 6 && ((!(a16 == 6) && !(15 == a8)) || a8 == 13))) || (((((!(a16 == 6) && !(15 == a8)) || a8 == 13) && a16 == 4) && a21 == 1) && !(a17 == 1))) || (((((!(a16 == 6) && !(15 == a8)) || a8 == 13) && a17 == 1) && a12 == 8) && a20 == 1)) || (((!(a7 == 1) && a21 == 1) && a20 == 1) && 5 == a16)) || ((a16 == 4 && a17 <= 0) && ((!(a16 == 6) && !(15 == a8)) || a8 == 13))) || ((!(15 == a8) && 5 == a16) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 11.4s, OverallIterations: 12, TraceHistogramMax: 6, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, HoareTripleCheckerStatistics: 945 SDtfs, 2556 SDslu, 142 SDs, 0 SdLazy, 6367 SolverSat, 803 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 18 SyntacticMatches, 10 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1969occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 1872 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 46 NumberOfFragments, 491 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2565 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 324 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1869 NumberOfCodeBlocks, 1869 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1857 ConstructedInterpolants, 0 QuantifiedInterpolants, 671925 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 1309/1309 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...