./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label29.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_2d4491f5-3f36-4b39-b407-ea2f5d34adb9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2d4491f5-3f36-4b39-b407-ea2f5d34adb9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2d4491f5-3f36-4b39-b407-ea2f5d34adb9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2d4491f5-3f36-4b39-b407-ea2f5d34adb9/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label29.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2d4491f5-3f36-4b39-b407-ea2f5d34adb9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2d4491f5-3f36-4b39-b407-ea2f5d34adb9/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 3449156d5b203ef4b6a1a68bea9e5efb1d4b37b1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 05:05:38,671 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 05:05:38,675 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 05:05:38,690 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 05:05:38,691 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 05:05:38,692 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 05:05:38,694 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 05:05:38,696 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 05:05:38,698 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 05:05:38,700 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 05:05:38,701 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 05:05:38,702 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 05:05:38,703 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 05:05:38,704 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 05:05:38,705 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 05:05:38,706 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 05:05:38,707 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 05:05:38,709 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 05:05:38,716 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 05:05:38,719 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 05:05:38,721 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 05:05:38,722 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 05:05:38,723 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 05:05:38,724 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 05:05:38,728 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 05:05:38,728 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 05:05:38,729 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 05:05:38,742 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 05:05:38,743 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 05:05:38,746 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 05:05:38,746 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 05:05:38,747 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 05:05:38,748 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 05:05:38,749 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 05:05:38,753 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 05:05:38,753 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 05:05:38,754 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 05:05:38,754 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 05:05:38,755 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 05:05:38,760 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 05:05:38,762 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 05:05:38,763 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2d4491f5-3f36-4b39-b407-ea2f5d34adb9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 05:05:38,785 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 05:05:38,785 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 05:05:38,786 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 05:05:38,787 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 05:05:38,787 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 05:05:38,787 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 05:05:38,787 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 05:05:38,788 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 05:05:38,788 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 05:05:38,788 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 05:05:38,789 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 05:05:38,790 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 05:05:38,790 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 05:05:38,790 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 05:05:38,790 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 05:05:38,790 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 05:05:38,791 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 05:05:38,791 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 05:05:38,791 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 05:05:38,791 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 05:05:38,792 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 05:05:38,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 05:05:38,792 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 05:05:38,792 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 05:05:38,792 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 05:05:38,793 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 05:05:38,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 05:05:38,793 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 05:05:38,793 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_2d4491f5-3f36-4b39-b407-ea2f5d34adb9/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 -> 3449156d5b203ef4b6a1a68bea9e5efb1d4b37b1 [2019-11-20 05:05:39,020 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 05:05:39,040 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 05:05:39,044 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 05:05:39,048 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 05:05:39,048 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 05:05:39,049 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2d4491f5-3f36-4b39-b407-ea2f5d34adb9/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem01_label29.c [2019-11-20 05:05:39,114 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2d4491f5-3f36-4b39-b407-ea2f5d34adb9/bin/uautomizer/data/ead1a4514/0c9c59ed297d454d84f4db534d4e705e/FLAG7d088c74d [2019-11-20 05:05:39,648 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 05:05:39,649 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2d4491f5-3f36-4b39-b407-ea2f5d34adb9/sv-benchmarks/c/eca-rers2012/Problem01_label29.c [2019-11-20 05:05:39,680 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2d4491f5-3f36-4b39-b407-ea2f5d34adb9/bin/uautomizer/data/ead1a4514/0c9c59ed297d454d84f4db534d4e705e/FLAG7d088c74d [2019-11-20 05:05:39,883 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2d4491f5-3f36-4b39-b407-ea2f5d34adb9/bin/uautomizer/data/ead1a4514/0c9c59ed297d454d84f4db534d4e705e [2019-11-20 05:05:39,886 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 05:05:39,887 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 05:05:39,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 05:05:39,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 05:05:39,892 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 05:05:39,893 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:05:39" (1/1) ... [2019-11-20 05:05:39,896 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5200a7ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:05:39, skipping insertion in model container [2019-11-20 05:05:39,896 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:05:39" (1/1) ... [2019-11-20 05:05:39,903 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 05:05:39,951 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 05:05:40,481 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:05:40,497 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 05:05:40,652 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:05:40,666 INFO L192 MainTranslator]: Completed translation [2019-11-20 05:05:40,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:05:40 WrapperNode [2019-11-20 05:05:40,666 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 05:05:40,667 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 05:05:40,667 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 05:05:40,668 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 05:05:40,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:05:40" (1/1) ... [2019-11-20 05:05:40,699 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:05:40" (1/1) ... [2019-11-20 05:05:40,768 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 05:05:40,769 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 05:05:40,769 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 05:05:40,769 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 05:05:40,779 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:05:40" (1/1) ... [2019-11-20 05:05:40,780 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:05:40" (1/1) ... [2019-11-20 05:05:40,783 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:05:40" (1/1) ... [2019-11-20 05:05:40,783 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:05:40" (1/1) ... [2019-11-20 05:05:40,809 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:05:40" (1/1) ... [2019-11-20 05:05:40,821 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:05:40" (1/1) ... [2019-11-20 05:05:40,829 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:05:40" (1/1) ... [2019-11-20 05:05:40,838 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 05:05:40,838 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 05:05:40,838 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 05:05:40,839 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 05:05:40,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:05:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2d4491f5-3f36-4b39-b407-ea2f5d34adb9/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-20 05:05:40,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 05:05:40,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 05:05:42,112 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 05:05:42,112 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 05:05:42,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:05:42 BoogieIcfgContainer [2019-11-20 05:05:42,113 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 05:05:42,115 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 05:05:42,115 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 05:05:42,118 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 05:05:42,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:05:39" (1/3) ... [2019-11-20 05:05:42,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@285b513b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:05:42, skipping insertion in model container [2019-11-20 05:05:42,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:05:40" (2/3) ... [2019-11-20 05:05:42,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@285b513b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:05:42, skipping insertion in model container [2019-11-20 05:05:42,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:05:42" (3/3) ... [2019-11-20 05:05:42,125 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label29.c [2019-11-20 05:05:42,137 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 05:05:42,145 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 05:05:42,157 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 05:05:42,203 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 05:05:42,203 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 05:05:42,203 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 05:05:42,204 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 05:05:42,204 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 05:05:42,204 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 05:05:42,204 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 05:05:42,204 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 05:05:42,237 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-20 05:05:42,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-20 05:05:42,248 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:05:42,249 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:05:42,250 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:05:42,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:05:42,255 INFO L82 PathProgramCache]: Analyzing trace with hash 620620582, now seen corresponding path program 1 times [2019-11-20 05:05:42,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:05:42,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674597887] [2019-11-20 05:05:42,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:05:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:05:42,759 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-20 05:05:42,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674597887] [2019-11-20 05:05:42,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:05:42,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:05:42,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419916679] [2019-11-20 05:05:42,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:05:42,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:05:42,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:05:42,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:05:42,787 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-11-20 05:05:44,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:05:44,395 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-11-20 05:05:44,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:05:44,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-20 05:05:44,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:05:44,417 INFO L225 Difference]: With dead ends: 662 [2019-11-20 05:05:44,417 INFO L226 Difference]: Without dead ends: 397 [2019-11-20 05:05:44,422 INFO L630 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-20 05:05:44,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-20 05:05:44,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2019-11-20 05:05:44,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-11-20 05:05:44,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 553 transitions. [2019-11-20 05:05:44,489 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 553 transitions. Word has length 101 [2019-11-20 05:05:44,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:05:44,490 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 553 transitions. [2019-11-20 05:05:44,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:05:44,491 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 553 transitions. [2019-11-20 05:05:44,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-20 05:05:44,497 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:05:44,497 INFO L410 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, 1, 1, 1] [2019-11-20 05:05:44,498 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:05:44,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:05:44,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1432944013, now seen corresponding path program 1 times [2019-11-20 05:05:44,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:05:44,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324558202] [2019-11-20 05:05:44,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:05:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:05:44,688 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-20 05:05:44,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324558202] [2019-11-20 05:05:44,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:05:44,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:05:44,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505050790] [2019-11-20 05:05:44,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:05:44,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:05:44,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:05:44,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:05:44,693 INFO L87 Difference]: Start difference. First operand 397 states and 553 transitions. Second operand 4 states. [2019-11-20 05:05:45,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:05:45,685 INFO L93 Difference]: Finished difference Result 1447 states and 2019 transitions. [2019-11-20 05:05:45,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:05:45,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-11-20 05:05:45,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:05:45,695 INFO L225 Difference]: With dead ends: 1447 [2019-11-20 05:05:45,695 INFO L226 Difference]: Without dead ends: 1052 [2019-11-20 05:05:45,703 INFO L630 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-20 05:05:45,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-11-20 05:05:45,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 659. [2019-11-20 05:05:45,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-20 05:05:45,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 851 transitions. [2019-11-20 05:05:45,781 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 851 transitions. Word has length 108 [2019-11-20 05:05:45,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:05:45,784 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 851 transitions. [2019-11-20 05:05:45,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:05:45,785 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 851 transitions. [2019-11-20 05:05:45,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 05:05:45,801 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:05:45,801 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:05:45,802 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:05:45,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:05:45,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1541134986, now seen corresponding path program 1 times [2019-11-20 05:05:45,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:05:45,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962250152] [2019-11-20 05:05:45,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:05:45,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:05:45,947 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:05:45,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962250152] [2019-11-20 05:05:45,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:05:45,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:05:45,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107858376] [2019-11-20 05:05:45,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:05:45,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:05:45,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:05:45,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:05:45,954 INFO L87 Difference]: Start difference. First operand 659 states and 851 transitions. Second operand 4 states. [2019-11-20 05:05:46,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:05:46,841 INFO L93 Difference]: Finished difference Result 1578 states and 1998 transitions. [2019-11-20 05:05:46,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:05:46,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-11-20 05:05:46,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:05:46,851 INFO L225 Difference]: With dead ends: 1578 [2019-11-20 05:05:46,851 INFO L226 Difference]: Without dead ends: 790 [2019-11-20 05:05:46,855 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-20 05:05:46,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-20 05:05:46,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-11-20 05:05:46,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-20 05:05:46,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 930 transitions. [2019-11-20 05:05:46,882 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 930 transitions. Word has length 122 [2019-11-20 05:05:46,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:05:46,883 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 930 transitions. [2019-11-20 05:05:46,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:05:46,883 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 930 transitions. [2019-11-20 05:05:46,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-20 05:05:46,886 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:05:46,886 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:05:46,887 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:05:46,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:05:46,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1660180891, now seen corresponding path program 1 times [2019-11-20 05:05:46,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:05:46,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893533335] [2019-11-20 05:05:46,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:05:46,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:05:46,969 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:05:46,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893533335] [2019-11-20 05:05:46,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:05:46,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:05:46,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168122804] [2019-11-20 05:05:46,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:05:46,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:05:46,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:05:46,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:05:46,972 INFO L87 Difference]: Start difference. First operand 790 states and 930 transitions. Second operand 3 states. [2019-11-20 05:05:47,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:05:47,575 INFO L93 Difference]: Finished difference Result 2233 states and 2643 transitions. [2019-11-20 05:05:47,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:05:47,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-11-20 05:05:47,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:05:47,586 INFO L225 Difference]: With dead ends: 2233 [2019-11-20 05:05:47,586 INFO L226 Difference]: Without dead ends: 1445 [2019-11-20 05:05:47,588 INFO L630 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-20 05:05:47,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-20 05:05:47,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1183. [2019-11-20 05:05:47,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-11-20 05:05:47,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1373 transitions. [2019-11-20 05:05:47,634 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1373 transitions. Word has length 123 [2019-11-20 05:05:47,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:05:47,635 INFO L462 AbstractCegarLoop]: Abstraction has 1183 states and 1373 transitions. [2019-11-20 05:05:47,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:05:47,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1373 transitions. [2019-11-20 05:05:47,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 05:05:47,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:05:47,640 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:05:47,640 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:05:47,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:05:47,640 INFO L82 PathProgramCache]: Analyzing trace with hash -767786909, now seen corresponding path program 1 times [2019-11-20 05:05:47,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:05:47,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330429703] [2019-11-20 05:05:47,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:05:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:05:47,737 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 05:05:47,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330429703] [2019-11-20 05:05:47,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:05:47,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:05:47,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575704219] [2019-11-20 05:05:47,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:05:47,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:05:47,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:05:47,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:05:47,740 INFO L87 Difference]: Start difference. First operand 1183 states and 1373 transitions. Second operand 3 states. [2019-11-20 05:05:48,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:05:48,337 INFO L93 Difference]: Finished difference Result 3150 states and 3672 transitions. [2019-11-20 05:05:48,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:05:48,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-11-20 05:05:48,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:05:48,351 INFO L225 Difference]: With dead ends: 3150 [2019-11-20 05:05:48,352 INFO L226 Difference]: Without dead ends: 1969 [2019-11-20 05:05:48,355 INFO L630 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-20 05:05:48,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-20 05:05:48,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1576. [2019-11-20 05:05:48,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-20 05:05:48,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1841 transitions. [2019-11-20 05:05:48,402 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1841 transitions. Word has length 127 [2019-11-20 05:05:48,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:05:48,404 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 1841 transitions. [2019-11-20 05:05:48,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:05:48,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1841 transitions. [2019-11-20 05:05:48,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-20 05:05:48,408 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:05:48,408 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:05:48,409 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:05:48,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:05:48,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1109954633, now seen corresponding path program 1 times [2019-11-20 05:05:48,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:05:48,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280387322] [2019-11-20 05:05:48,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:05:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:05:48,493 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 05:05:48,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280387322] [2019-11-20 05:05:48,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:05:48,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:05:48,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993694893] [2019-11-20 05:05:48,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:05:48,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:05:48,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:05:48,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:05:48,496 INFO L87 Difference]: Start difference. First operand 1576 states and 1841 transitions. Second operand 3 states. [2019-11-20 05:05:49,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:05:49,006 INFO L93 Difference]: Finished difference Result 3281 states and 3832 transitions. [2019-11-20 05:05:49,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:05:49,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-11-20 05:05:49,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:05:49,018 INFO L225 Difference]: With dead ends: 3281 [2019-11-20 05:05:49,018 INFO L226 Difference]: Without dead ends: 1707 [2019-11-20 05:05:49,021 INFO L630 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-20 05:05:49,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-11-20 05:05:49,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1576. [2019-11-20 05:05:49,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-20 05:05:49,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1841 transitions. [2019-11-20 05:05:49,062 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1841 transitions. Word has length 129 [2019-11-20 05:05:49,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:05:49,063 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 1841 transitions. [2019-11-20 05:05:49,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:05:49,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1841 transitions. [2019-11-20 05:05:49,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-20 05:05:49,067 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:05:49,067 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:05:49,067 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:05:49,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:05:49,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1564517898, now seen corresponding path program 1 times [2019-11-20 05:05:49,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:05:49,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792298764] [2019-11-20 05:05:49,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:05:49,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:05:49,170 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:05:49,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792298764] [2019-11-20 05:05:49,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:05:49,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:05:49,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648014739] [2019-11-20 05:05:49,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:05:49,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:05:49,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:05:49,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:05:49,173 INFO L87 Difference]: Start difference. First operand 1576 states and 1841 transitions. Second operand 3 states. [2019-11-20 05:05:49,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:05:49,768 INFO L93 Difference]: Finished difference Result 3543 states and 4110 transitions. [2019-11-20 05:05:49,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:05:49,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-11-20 05:05:49,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:05:49,781 INFO L225 Difference]: With dead ends: 3543 [2019-11-20 05:05:49,781 INFO L226 Difference]: Without dead ends: 1969 [2019-11-20 05:05:49,784 INFO L630 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-20 05:05:49,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-20 05:05:49,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2019-11-20 05:05:49,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-20 05:05:49,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2124 transitions. [2019-11-20 05:05:49,837 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2124 transitions. Word has length 130 [2019-11-20 05:05:49,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:05:49,838 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2124 transitions. [2019-11-20 05:05:49,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:05:49,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2124 transitions. [2019-11-20 05:05:49,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-20 05:05:49,843 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:05:49,843 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:05:49,844 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:05:49,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:05:49,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1099746882, now seen corresponding path program 1 times [2019-11-20 05:05:49,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:05:49,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847908820] [2019-11-20 05:05:49,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:05:49,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:05:50,103 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:05:50,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847908820] [2019-11-20 05:05:50,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:05:50,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 05:05:50,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728921521] [2019-11-20 05:05:50,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 05:05:50,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:05:50,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 05:05:50,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-20 05:05:50,107 INFO L87 Difference]: Start difference. First operand 1838 states and 2124 transitions. Second operand 8 states. [2019-11-20 05:05:51,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:05:51,388 INFO L93 Difference]: Finished difference Result 3847 states and 4438 transitions. [2019-11-20 05:05:51,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 05:05:51,389 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 134 [2019-11-20 05:05:51,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:05:51,404 INFO L225 Difference]: With dead ends: 3847 [2019-11-20 05:05:51,404 INFO L226 Difference]: Without dead ends: 2142 [2019-11-20 05:05:51,407 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-20 05:05:51,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2142 states. [2019-11-20 05:05:51,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2142 to 1838. [2019-11-20 05:05:51,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-20 05:05:51,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2112 transitions. [2019-11-20 05:05:51,464 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2112 transitions. Word has length 134 [2019-11-20 05:05:51,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:05:51,464 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2112 transitions. [2019-11-20 05:05:51,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 05:05:51,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2112 transitions. [2019-11-20 05:05:51,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-20 05:05:51,472 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:05:51,473 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 1, 1, 1] [2019-11-20 05:05:51,473 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:05:51,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:05:51,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1909853781, now seen corresponding path program 1 times [2019-11-20 05:05:51,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:05:51,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286215922] [2019-11-20 05:05:51,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:05:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:05:51,546 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-20 05:05:51,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286215922] [2019-11-20 05:05:51,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:05:51,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:05:51,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525137977] [2019-11-20 05:05:51,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:05:51,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:05:51,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:05:51,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:05:51,550 INFO L87 Difference]: Start difference. First operand 1838 states and 2112 transitions. Second operand 3 states. [2019-11-20 05:05:51,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:05:51,952 INFO L93 Difference]: Finished difference Result 3674 states and 4220 transitions. [2019-11-20 05:05:51,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:05:51,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-11-20 05:05:51,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:05:51,963 INFO L225 Difference]: With dead ends: 3674 [2019-11-20 05:05:51,963 INFO L226 Difference]: Without dead ends: 1838 [2019-11-20 05:05:51,966 INFO L630 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-20 05:05:51,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-11-20 05:05:52,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2019-11-20 05:05:52,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-20 05:05:52,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 1999 transitions. [2019-11-20 05:05:52,012 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 1999 transitions. Word has length 157 [2019-11-20 05:05:52,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:05:52,012 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 1999 transitions. [2019-11-20 05:05:52,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:05:52,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 1999 transitions. [2019-11-20 05:05:52,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-20 05:05:52,017 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:05:52,018 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 05:05:52,018 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:05:52,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:05:52,019 INFO L82 PathProgramCache]: Analyzing trace with hash -221184622, now seen corresponding path program 1 times [2019-11-20 05:05:52,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:05:52,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477019523] [2019-11-20 05:05:52,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:05:52,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:05:52,341 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2019-11-20 05:05:52,920 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:05:52,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477019523] [2019-11-20 05:05:52,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:05:52,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-20 05:05:52,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355172911] [2019-11-20 05:05:52,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 05:05:52,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:05:52,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 05:05:52,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2019-11-20 05:05:52,922 INFO L87 Difference]: Start difference. First operand 1838 states and 1999 transitions. Second operand 13 states. [2019-11-20 05:05:54,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:05:54,702 INFO L93 Difference]: Finished difference Result 3732 states and 4088 transitions. [2019-11-20 05:05:54,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 05:05:54,704 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 167 [2019-11-20 05:05:54,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:05:54,714 INFO L225 Difference]: With dead ends: 3732 [2019-11-20 05:05:54,715 INFO L226 Difference]: Without dead ends: 2027 [2019-11-20 05:05:54,717 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=132, Invalid=174, Unknown=0, NotChecked=0, Total=306 [2019-11-20 05:05:54,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2019-11-20 05:05:54,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 1765. [2019-11-20 05:05:54,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1765 states. [2019-11-20 05:05:54,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 1916 transitions. [2019-11-20 05:05:54,760 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 1916 transitions. Word has length 167 [2019-11-20 05:05:54,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:05:54,763 INFO L462 AbstractCegarLoop]: Abstraction has 1765 states and 1916 transitions. [2019-11-20 05:05:54,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 05:05:54,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 1916 transitions. [2019-11-20 05:05:54,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-20 05:05:54,769 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:05:54,769 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:05:54,770 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:05:54,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:05:54,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1527065083, now seen corresponding path program 1 times [2019-11-20 05:05:54,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:05:54,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513746446] [2019-11-20 05:05:54,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:05:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:05:54,875 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-20 05:05:54,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513746446] [2019-11-20 05:05:54,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:05:54,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:05:54,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240628723] [2019-11-20 05:05:54,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:05:54,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:05:54,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:05:54,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:05:54,878 INFO L87 Difference]: Start difference. First operand 1765 states and 1916 transitions. Second operand 3 states. [2019-11-20 05:05:55,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:05:55,335 INFO L93 Difference]: Finished difference Result 3528 states and 3830 transitions. [2019-11-20 05:05:55,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:05:55,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-11-20 05:05:55,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:05:55,347 INFO L225 Difference]: With dead ends: 3528 [2019-11-20 05:05:55,347 INFO L226 Difference]: Without dead ends: 1765 [2019-11-20 05:05:55,350 INFO L630 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-20 05:05:55,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2019-11-20 05:05:55,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1634. [2019-11-20 05:05:55,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1634 states. [2019-11-20 05:05:55,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 1762 transitions. [2019-11-20 05:05:55,392 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 1762 transitions. Word has length 195 [2019-11-20 05:05:55,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:05:55,393 INFO L462 AbstractCegarLoop]: Abstraction has 1634 states and 1762 transitions. [2019-11-20 05:05:55,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:05:55,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 1762 transitions. [2019-11-20 05:05:55,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-11-20 05:05:55,399 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:05:55,399 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:05:55,400 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:05:55,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:05:55,400 INFO L82 PathProgramCache]: Analyzing trace with hash 792554223, now seen corresponding path program 1 times [2019-11-20 05:05:55,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:05:55,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290936408] [2019-11-20 05:05:55,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:05:55,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:05:55,627 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-20 05:05:55,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290936408] [2019-11-20 05:05:55,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:05:55,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 05:05:55,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976484784] [2019-11-20 05:05:55,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 05:05:55,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:05:55,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 05:05:55,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 05:05:55,630 INFO L87 Difference]: Start difference. First operand 1634 states and 1762 transitions. Second operand 6 states. [2019-11-20 05:05:56,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:05:56,350 INFO L93 Difference]: Finished difference Result 3423 states and 3704 transitions. [2019-11-20 05:05:56,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 05:05:56,351 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 239 [2019-11-20 05:05:56,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:05:56,362 INFO L225 Difference]: With dead ends: 3423 [2019-11-20 05:05:56,362 INFO L226 Difference]: Without dead ends: 1922 [2019-11-20 05:05:56,364 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 05:05:56,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2019-11-20 05:05:56,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1896. [2019-11-20 05:05:56,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2019-11-20 05:05:56,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2020 transitions. [2019-11-20 05:05:56,406 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2020 transitions. Word has length 239 [2019-11-20 05:05:56,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:05:56,406 INFO L462 AbstractCegarLoop]: Abstraction has 1896 states and 2020 transitions. [2019-11-20 05:05:56,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 05:05:56,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2020 transitions. [2019-11-20 05:05:56,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-11-20 05:05:56,414 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:05:56,414 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:05:56,414 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:05:56,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:05:56,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1426430283, now seen corresponding path program 1 times [2019-11-20 05:05:56,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:05:56,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922259559] [2019-11-20 05:05:56,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:05:56,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:05:56,599 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-11-20 05:05:56,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922259559] [2019-11-20 05:05:56,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:05:56,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:05:56,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036570617] [2019-11-20 05:05:56,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 05:05:56,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:05:56,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 05:05:56,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:05:56,602 INFO L87 Difference]: Start difference. First operand 1896 states and 2020 transitions. Second operand 5 states. [2019-11-20 05:05:57,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:05:57,728 INFO L93 Difference]: Finished difference Result 3790 states and 4036 transitions. [2019-11-20 05:05:57,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 05:05:57,729 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 262 [2019-11-20 05:05:57,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:05:57,738 INFO L225 Difference]: With dead ends: 3790 [2019-11-20 05:05:57,739 INFO L226 Difference]: Without dead ends: 1765 [2019-11-20 05:05:57,742 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:05:57,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2019-11-20 05:05:57,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1765. [2019-11-20 05:05:57,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1765 states. [2019-11-20 05:05:57,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 1882 transitions. [2019-11-20 05:05:57,782 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 1882 transitions. Word has length 262 [2019-11-20 05:05:57,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:05:57,783 INFO L462 AbstractCegarLoop]: Abstraction has 1765 states and 1882 transitions. [2019-11-20 05:05:57,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 05:05:57,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 1882 transitions. [2019-11-20 05:05:57,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-11-20 05:05:57,790 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:05:57,790 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2019-11-20 05:05:57,790 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:05:57,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:05:57,791 INFO L82 PathProgramCache]: Analyzing trace with hash -42906621, now seen corresponding path program 1 times [2019-11-20 05:05:57,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:05:57,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794928677] [2019-11-20 05:05:57,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:05:57,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:05:58,287 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 301 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-11-20 05:05:58,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794928677] [2019-11-20 05:05:58,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:05:58,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 05:05:58,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851474820] [2019-11-20 05:05:58,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 05:05:58,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:05:58,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 05:05:58,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-20 05:05:58,290 INFO L87 Difference]: Start difference. First operand 1765 states and 1882 transitions. Second operand 6 states. [2019-11-20 05:05:59,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:05:59,112 INFO L93 Difference]: Finished difference Result 3467 states and 3713 transitions. [2019-11-20 05:05:59,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 05:05:59,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 273 [2019-11-20 05:05:59,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:05:59,113 INFO L225 Difference]: With dead ends: 3467 [2019-11-20 05:05:59,113 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 05:05:59,118 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-20 05:05:59,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 05:05:59,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 05:05:59,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 05:05:59,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 05:05:59,119 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 273 [2019-11-20 05:05:59,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:05:59,119 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 05:05:59,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 05:05:59,119 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 05:05:59,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 05:05:59,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 05:05:59,241 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 66 [2019-11-20 05:05:59,681 WARN L191 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-11-20 05:05:59,994 WARN L191 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-11-20 05:05:59,996 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-20 05:05:59,997 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-20 05:05:59,997 INFO L444 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:05:59,997 INFO L444 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:05:59,997 INFO L444 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:05:59,997 INFO L444 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:05:59,997 INFO L444 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:05:59,997 INFO L444 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:05:59,997 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-20 05:05:59,997 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-20 05:05:59,997 INFO L444 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-20 05:05:59,998 INFO L444 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-20 05:05:59,998 INFO L444 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-20 05:05:59,998 INFO L444 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-20 05:05:59,998 INFO L444 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-20 05:05:59,998 INFO L444 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-20 05:05:59,998 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-20 05:05:59,998 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-20 05:05:59,998 INFO L444 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:05:59,998 INFO L444 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:05:59,998 INFO L444 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:05:59,998 INFO L444 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:05:59,998 INFO L444 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:05:59,998 INFO L444 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:05:59,999 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-20 05:05:59,999 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-20 05:05:59,999 INFO L444 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-20 05:05:59,999 INFO L444 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-20 05:05:59,999 INFO L444 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-20 05:05:59,999 INFO L444 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-20 05:05:59,999 INFO L444 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-20 05:05:59,999 INFO L444 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-20 05:05:59,999 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-20 05:05:59,999 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-20 05:05:59,999 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-20 05:05:59,999 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-20 05:05:59,999 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-20 05:06:00,000 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-20 05:06:00,000 INFO L444 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-20 05:06:00,000 INFO L444 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,000 INFO L444 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,000 INFO L444 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,000 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,001 INFO L444 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,001 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-20 05:06:00,001 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-20 05:06:00,001 INFO L444 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-20 05:06:00,001 INFO L444 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-20 05:06:00,001 INFO L444 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-20 05:06:00,002 INFO L444 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-20 05:06:00,002 INFO L444 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-20 05:06:00,002 INFO L444 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-20 05:06:00,002 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-20 05:06:00,003 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse5 (= 15 ~a8~0))) (let ((.cse11 (not .cse5)) (.cse4 (= ~a21~0 1))) (let ((.cse0 (= ~a20~0 1)) (.cse2 (not (= ~a7~0 1))) (.cse10 (= 1 ~a7~0)) (.cse3 (= ~a12~0 8)) (.cse8 (<= ~a17~0 0)) (.cse9 (<= ~a20~0 0)) (.cse7 (= ~a17~0 1)) (.cse6 (= 5 ~a16~0)) (.cse12 (= ~a16~0 4)) (.cse1 (and .cse11 .cse4))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse0) (and .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse3 .cse4) (and .cse2 (or (= 2 ULTIMATE.start_calculate_output_~input) (= 4 ULTIMATE.start_calculate_output_~input) (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse3 .cse8 .cse4 .cse5 .cse9) (and .cse10 .cse11 .cse3) (and .cse2 .cse3 .cse4 .cse5 (not .cse12)) (and .cse10 .cse12 .cse3 .cse8 .cse4 .cse9) (and .cse7 .cse1) (and (and .cse11 .cse6) (not (= ~a8~0 13))) (and .cse12 .cse1))))) [2019-11-20 05:06:00,003 INFO L444 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,003 INFO L444 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,003 INFO L444 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,003 INFO L444 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,004 INFO L444 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,004 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-20 05:06:00,004 INFO L444 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-20 05:06:00,004 INFO L444 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-20 05:06:00,004 INFO L444 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-20 05:06:00,004 INFO L444 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-20 05:06:00,005 INFO L444 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-20 05:06:00,005 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-20 05:06:00,005 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-20 05:06:00,005 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-20 05:06:00,005 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-20 05:06:00,005 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-20 05:06:00,006 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-20 05:06:00,006 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-20 05:06:00,006 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-20 05:06:00,006 INFO L444 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,006 INFO L444 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,006 INFO L444 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,007 INFO L444 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,007 INFO L444 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,007 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-20 05:06:00,007 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-20 05:06:00,007 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-20 05:06:00,007 INFO L444 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-20 05:06:00,008 INFO L444 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-20 05:06:00,008 INFO L444 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-20 05:06:00,008 INFO L444 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-20 05:06:00,008 INFO L444 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-20 05:06:00,008 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-20 05:06:00,008 INFO L444 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,009 INFO L444 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,009 INFO L444 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,009 INFO L444 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,009 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-20 05:06:00,009 INFO L444 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,009 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-20 05:06:00,010 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-20 05:06:00,010 INFO L444 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-20 05:06:00,010 INFO L444 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-20 05:06:00,010 INFO L444 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-20 05:06:00,010 INFO L444 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-20 05:06:00,010 INFO L444 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-20 05:06:00,011 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 05:06:00,011 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-20 05:06:00,011 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-20 05:06:00,011 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-20 05:06:00,011 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-20 05:06:00,011 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-20 05:06:00,012 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-20 05:06:00,012 INFO L444 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,012 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse5 (= 15 ~a8~0))) (let ((.cse11 (not .cse5)) (.cse4 (= ~a21~0 1))) (let ((.cse0 (= ~a20~0 1)) (.cse2 (not (= ~a7~0 1))) (.cse10 (= 1 ~a7~0)) (.cse3 (= ~a12~0 8)) (.cse8 (<= ~a17~0 0)) (.cse9 (<= ~a20~0 0)) (.cse7 (= ~a17~0 1)) (.cse6 (= 5 ~a16~0)) (.cse12 (= ~a16~0 4)) (.cse1 (and .cse11 .cse4))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse0) (and .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse3 .cse4) (and .cse2 (or (= 2 ULTIMATE.start_calculate_output_~input) (= 4 ULTIMATE.start_calculate_output_~input) (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse3 .cse8 .cse4 .cse5 .cse9) (and .cse10 .cse11 .cse3) (and .cse2 .cse3 .cse4 .cse5 (not .cse12)) (and .cse10 .cse12 .cse3 .cse8 .cse4 .cse9) (and .cse7 .cse1) (and (and .cse11 .cse6) (not (= ~a8~0 13))) (and .cse12 .cse1))))) [2019-11-20 05:06:00,012 INFO L444 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,013 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,013 INFO L444 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,013 INFO L444 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,013 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-20 05:06:00,013 INFO L444 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-20 05:06:00,014 INFO L444 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-20 05:06:00,014 INFO L444 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-20 05:06:00,014 INFO L444 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-20 05:06:00,014 INFO L444 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-20 05:06:00,014 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-20 05:06:00,014 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-20 05:06:00,015 INFO L444 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,015 INFO L444 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,015 INFO L444 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,015 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,015 INFO L444 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,015 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-20 05:06:00,016 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 05:06:00,016 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-20 05:06:00,016 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-20 05:06:00,016 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-20 05:06:00,016 INFO L444 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-20 05:06:00,016 INFO L444 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-20 05:06:00,017 INFO L444 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-20 05:06:00,017 INFO L444 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-20 05:06:00,017 INFO L444 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-20 05:06:00,017 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-20 05:06:00,017 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-20 05:06:00,017 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-20 05:06:00,018 INFO L444 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,018 INFO L444 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,018 INFO L444 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,018 INFO L444 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,018 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-20 05:06:00,019 INFO L444 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,019 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,019 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-20 05:06:00,019 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-20 05:06:00,019 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 05:06:00,019 INFO L444 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-20 05:06:00,020 INFO L444 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-20 05:06:00,020 INFO L444 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-20 05:06:00,020 INFO L444 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-20 05:06:00,020 INFO L444 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-20 05:06:00,020 INFO L444 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-20 05:06:00,020 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-20 05:06:00,021 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-20 05:06:00,021 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-20 05:06:00,021 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-20 05:06:00,021 INFO L444 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,021 INFO L444 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,021 INFO L444 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,022 INFO L444 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,022 INFO L444 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,022 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-20 05:06:00,022 INFO L444 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,022 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-20 05:06:00,022 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-20 05:06:00,023 INFO L444 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-20 05:06:00,023 INFO L444 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-20 05:06:00,023 INFO L444 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-20 05:06:00,023 INFO L444 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-20 05:06:00,023 INFO L444 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-20 05:06:00,023 INFO L444 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-20 05:06:00,024 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-20 05:06:00,024 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-20 05:06:00,024 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-20 05:06:00,024 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 05:06:00,024 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 479) no Hoare annotation was computed. [2019-11-20 05:06:00,025 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-20 05:06:00,025 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-20 05:06:00,025 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-20 05:06:00,025 INFO L444 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,025 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,025 INFO L444 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,026 INFO L444 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,026 INFO L444 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,026 INFO L444 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:06:00,026 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-20 05:06:00,026 INFO L444 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-20 05:06:00,026 INFO L444 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-20 05:06:00,027 INFO L444 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-20 05:06:00,027 INFO L444 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-20 05:06:00,027 INFO L444 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-20 05:06:00,027 INFO L444 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-20 05:06:00,027 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-20 05:06:00,027 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-20 05:06:00,028 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-20 05:06:00,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:06:00 BoogieIcfgContainer [2019-11-20 05:06:00,057 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 05:06:00,058 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 05:06:00,058 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 05:06:00,058 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 05:06:00,059 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:05:42" (3/4) ... [2019-11-20 05:06:00,062 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 05:06:00,091 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-20 05:06:00,092 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 05:06:00,284 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_2d4491f5-3f36-4b39-b407-ea2f5d34adb9/bin/uautomizer/witness.graphml [2019-11-20 05:06:00,285 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 05:06:00,286 INFO L168 Benchmark]: Toolchain (without parser) took 20399.68 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 544.2 MB). Free memory was 939.3 MB in the beginning and 1.3 GB in the end (delta: -340.0 MB). Peak memory consumption was 204.2 MB. Max. memory is 11.5 GB. [2019-11-20 05:06:00,287 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 05:06:00,287 INFO L168 Benchmark]: CACSL2BoogieTranslator took 778.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -150.6 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-11-20 05:06:00,288 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.06 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-20 05:06:00,288 INFO L168 Benchmark]: Boogie Preprocessor took 69.28 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-20 05:06:00,288 INFO L168 Benchmark]: RCFGBuilder took 1275.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 973.4 MB in the end (delta: 109.8 MB). Peak memory consumption was 109.8 MB. Max. memory is 11.5 GB. [2019-11-20 05:06:00,289 INFO L168 Benchmark]: TraceAbstraction took 17942.68 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 416.3 MB). Free memory was 973.4 MB in the beginning and 1.3 GB in the end (delta: -326.4 MB). Peak memory consumption was 89.9 MB. Max. memory is 11.5 GB. [2019-11-20 05:06:00,289 INFO L168 Benchmark]: Witness Printer took 227.38 ms. Allocated memory is still 1.6 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-20 05:06:00,291 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.48 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 778.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -150.6 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 101.06 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. * Boogie Preprocessor took 69.28 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1275.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 973.4 MB in the end (delta: 109.8 MB). Peak memory consumption was 109.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17942.68 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 416.3 MB). Free memory was 973.4 MB in the beginning and 1.3 GB in the end (delta: -326.4 MB). Peak memory consumption was 89.9 MB. Max. memory is 11.5 GB. * Witness Printer took 227.38 ms. Allocated memory is still 1.6 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 479]: 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: ((((((((((a20 == 1 && !(15 == a8) && a21 == 1) || (((!(a7 == 1) && a12 == 8) && a21 == 1) && a20 == 1)) || (((a12 == 8 && a21 == 1) && 15 == a8) && 5 == a16)) || (((!(a7 == 1) && a17 == 1) && a12 == 8) && a21 == 1)) || ((((((!(a7 == 1) && (((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input)) && a12 == 8) && a17 <= 0) && a21 == 1) && 15 == a8) && a20 <= 0)) || ((1 == a7 && !(15 == a8)) && a12 == 8)) || ((((!(a7 == 1) && a12 == 8) && a21 == 1) && 15 == a8) && !(a16 == 4))) || (((((1 == a7 && a16 == 4) && a12 == 8) && a17 <= 0) && a21 == 1) && a20 <= 0)) || (a17 == 1 && !(15 == a8) && a21 == 1)) || ((!(15 == a8) && 5 == a16) && !(a8 == 13))) || (a16 == 4 && !(15 == a8) && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((a20 == 1 && !(15 == a8) && a21 == 1) || (((!(a7 == 1) && a12 == 8) && a21 == 1) && a20 == 1)) || (((a12 == 8 && a21 == 1) && 15 == a8) && 5 == a16)) || (((!(a7 == 1) && a17 == 1) && a12 == 8) && a21 == 1)) || ((((((!(a7 == 1) && (((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input)) && a12 == 8) && a17 <= 0) && a21 == 1) && 15 == a8) && a20 <= 0)) || ((1 == a7 && !(15 == a8)) && a12 == 8)) || ((((!(a7 == 1) && a12 == 8) && a21 == 1) && 15 == a8) && !(a16 == 4))) || (((((1 == a7 && a16 == 4) && a12 == 8) && a17 <= 0) && a21 == 1) && a20 <= 0)) || (a17 == 1 && !(15 == a8) && a21 == 1)) || ((!(15 == a8) && 5 == a16) && !(a8 == 13))) || (a16 == 4 && !(15 == a8) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 17.8s, OverallIterations: 14, TraceHistogramMax: 8, AutomataDifference: 12.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, HoareTripleCheckerStatistics: 799 SDtfs, 3379 SDslu, 175 SDs, 0 SdLazy, 8117 SolverSat, 1000 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1896occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 14 MinimizatonAttempts, 2033 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 46 NumberOfFragments, 357 HoareAnnotationTreeSize, 3 FomulaSimplifications, 17108 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 308 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 2267 NumberOfCodeBlocks, 2267 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2253 ConstructedInterpolants, 0 QuantifiedInterpolants, 1772182 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 1734/1734 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...