./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem16_label45.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_54a8d788-0ad5-4196-99b8-3d84514e908d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_54a8d788-0ad5-4196-99b8-3d84514e908d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_54a8d788-0ad5-4196-99b8-3d84514e908d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_54a8d788-0ad5-4196-99b8-3d84514e908d/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem16_label45.c -s /tmp/vcloud-vcloud-master/worker/run_dir_54a8d788-0ad5-4196-99b8-3d84514e908d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_54a8d788-0ad5-4196-99b8-3d84514e908d/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 b47e6efaac96dd68fdf2e956514ab24129d0709d ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:46:08,722 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:46:08,724 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:46:08,741 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:46:08,741 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:46:08,743 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:46:08,745 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:46:08,755 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:46:08,759 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:46:08,764 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:46:08,766 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:46:08,768 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:46:08,769 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:46:08,771 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:46:08,772 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:46:08,773 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:46:08,774 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:46:08,775 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:46:08,778 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:46:08,783 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:46:08,787 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:46:08,789 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:46:08,792 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:46:08,793 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:46:08,798 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:46:08,798 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:46:08,798 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:46:08,800 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:46:08,801 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:46:08,802 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:46:08,802 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:46:08,803 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:46:08,804 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:46:08,804 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:46:08,807 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:46:08,807 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:46:08,808 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:46:08,808 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:46:08,808 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:46:08,809 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:46:08,810 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:46:08,811 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_54a8d788-0ad5-4196-99b8-3d84514e908d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:46:08,841 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:46:08,844 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:46:08,856 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:46:08,856 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:46:08,857 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:46:08,857 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:46:08,857 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:46:08,858 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:46:08,858 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:46:08,858 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:46:08,858 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:46:08,859 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:46:08,859 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:46:08,859 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:46:08,860 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:46:08,860 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:46:08,860 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:46:08,861 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:46:08,861 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:46:08,861 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:46:08,862 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:46:08,862 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:46:08,862 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:46:08,863 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:46:08,863 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:46:08,863 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:46:08,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:46:08,864 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:46:08,865 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_54a8d788-0ad5-4196-99b8-3d84514e908d/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 -> b47e6efaac96dd68fdf2e956514ab24129d0709d [2019-11-15 23:46:08,906 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:46:08,924 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:46:08,928 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:46:08,930 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:46:08,930 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:46:08,931 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_54a8d788-0ad5-4196-99b8-3d84514e908d/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem16_label45.c [2019-11-15 23:46:08,994 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_54a8d788-0ad5-4196-99b8-3d84514e908d/bin/uautomizer/data/841f9dd73/0d13e098fef0481b835ececc2022e297/FLAGe8aa2c1e8 [2019-11-15 23:46:09,660 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:46:09,661 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_54a8d788-0ad5-4196-99b8-3d84514e908d/sv-benchmarks/c/eca-rers2012/Problem16_label45.c [2019-11-15 23:46:09,686 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_54a8d788-0ad5-4196-99b8-3d84514e908d/bin/uautomizer/data/841f9dd73/0d13e098fef0481b835ececc2022e297/FLAGe8aa2c1e8 [2019-11-15 23:46:09,851 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_54a8d788-0ad5-4196-99b8-3d84514e908d/bin/uautomizer/data/841f9dd73/0d13e098fef0481b835ececc2022e297 [2019-11-15 23:46:09,853 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:46:09,854 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:46:09,855 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:46:09,855 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:46:09,862 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:46:09,863 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:46:09" (1/1) ... [2019-11-15 23:46:09,866 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53e0d3f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:09, skipping insertion in model container [2019-11-15 23:46:09,867 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:46:09" (1/1) ... [2019-11-15 23:46:09,874 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:46:09,958 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:46:10,683 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:46:10,693 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:46:10,925 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:46:10,944 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:46:10,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:10 WrapperNode [2019-11-15 23:46:10,945 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:46:10,945 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:46:10,946 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:46:10,946 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:46:10,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:10" (1/1) ... [2019-11-15 23:46:10,993 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:10" (1/1) ... [2019-11-15 23:46:11,132 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:46:11,135 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:46:11,135 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:46:11,136 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:46:11,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:10" (1/1) ... [2019-11-15 23:46:11,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:10" (1/1) ... [2019-11-15 23:46:11,158 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:10" (1/1) ... [2019-11-15 23:46:11,158 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:10" (1/1) ... [2019-11-15 23:46:11,225 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:10" (1/1) ... [2019-11-15 23:46:11,254 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:10" (1/1) ... [2019-11-15 23:46:11,293 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:10" (1/1) ... [2019-11-15 23:46:11,309 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:46:11,310 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:46:11,310 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:46:11,310 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:46:11,311 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_54a8d788-0ad5-4196-99b8-3d84514e908d/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:46:11,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:46:11,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:46:13,831 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:46:13,831 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-15 23:46:13,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:46:13 BoogieIcfgContainer [2019-11-15 23:46:13,833 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:46:13,834 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:46:13,834 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:46:13,837 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:46:13,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:46:09" (1/3) ... [2019-11-15 23:46:13,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e8ba126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:46:13, skipping insertion in model container [2019-11-15 23:46:13,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:10" (2/3) ... [2019-11-15 23:46:13,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e8ba126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:46:13, skipping insertion in model container [2019-11-15 23:46:13,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:46:13" (3/3) ... [2019-11-15 23:46:13,842 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem16_label45.c [2019-11-15 23:46:13,851 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:46:13,862 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:46:13,872 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:46:13,901 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:46:13,901 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:46:13,901 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:46:13,901 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:46:13,902 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:46:13,902 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:46:13,902 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:46:13,903 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:46:13,935 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states. [2019-11-15 23:46:13,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 23:46:13,945 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:13,946 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:13,948 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:46:13,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:13,953 INFO L82 PathProgramCache]: Analyzing trace with hash -92557335, now seen corresponding path program 1 times [2019-11-15 23:46:13,961 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:13,961 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705331572] [2019-11-15 23:46:13,962 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:13,962 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:13,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:14,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:46:14,306 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705331572] [2019-11-15 23:46:14,307 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:14,307 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:46:14,308 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172898823] [2019-11-15 23:46:14,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:46:14,313 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:14,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:46:14,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:46:14,328 INFO L87 Difference]: Start difference. First operand 396 states. Second operand 4 states. [2019-11-15 23:46:17,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:17,695 INFO L93 Difference]: Finished difference Result 1454 states and 2762 transitions. [2019-11-15 23:46:17,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:46:17,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-11-15 23:46:17,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:17,734 INFO L225 Difference]: With dead ends: 1454 [2019-11-15 23:46:17,735 INFO L226 Difference]: Without dead ends: 991 [2019-11-15 23:46:17,745 INFO L600 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-15 23:46:17,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2019-11-15 23:46:17,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 991. [2019-11-15 23:46:17,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2019-11-15 23:46:17,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1555 transitions. [2019-11-15 23:46:17,897 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1555 transitions. Word has length 53 [2019-11-15 23:46:17,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:17,898 INFO L462 AbstractCegarLoop]: Abstraction has 991 states and 1555 transitions. [2019-11-15 23:46:17,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:46:17,898 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1555 transitions. [2019-11-15 23:46:17,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-15 23:46:17,904 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:17,904 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 23:46:17,905 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:46:17,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:17,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1686833650, now seen corresponding path program 1 times [2019-11-15 23:46:17,905 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:17,906 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425568592] [2019-11-15 23:46:17,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:17,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:17,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:18,150 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:46:18,151 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425568592] [2019-11-15 23:46:18,151 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:18,151 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:46:18,151 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588381367] [2019-11-15 23:46:18,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:46:18,153 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:18,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:46:18,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:46:18,154 INFO L87 Difference]: Start difference. First operand 991 states and 1555 transitions. Second operand 5 states. [2019-11-15 23:46:20,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:20,220 INFO L93 Difference]: Finished difference Result 2967 states and 4660 transitions. [2019-11-15 23:46:20,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:46:20,221 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-11-15 23:46:20,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:20,236 INFO L225 Difference]: With dead ends: 2967 [2019-11-15 23:46:20,236 INFO L226 Difference]: Without dead ends: 1978 [2019-11-15 23:46:20,240 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:46:20,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2019-11-15 23:46:20,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1978. [2019-11-15 23:46:20,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1978 states. [2019-11-15 23:46:20,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1978 states and 2801 transitions. [2019-11-15 23:46:20,295 INFO L78 Accepts]: Start accepts. Automaton has 1978 states and 2801 transitions. Word has length 121 [2019-11-15 23:46:20,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:20,297 INFO L462 AbstractCegarLoop]: Abstraction has 1978 states and 2801 transitions. [2019-11-15 23:46:20,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:46:20,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1978 states and 2801 transitions. [2019-11-15 23:46:20,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-11-15 23:46:20,310 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:20,310 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:20,311 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:46:20,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:20,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1689727149, now seen corresponding path program 1 times [2019-11-15 23:46:20,312 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:20,313 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091854485] [2019-11-15 23:46:20,313 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:20,314 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:20,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:20,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:20,861 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-15 23:46:20,861 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091854485] [2019-11-15 23:46:20,861 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136460879] [2019-11-15 23:46:20,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_54a8d788-0ad5-4196-99b8-3d84514e908d/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:46:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:20,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:46:20,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:46:21,077 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:46:21,077 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:46:21,078 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-11-15 23:46:21,078 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215301493] [2019-11-15 23:46:21,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:46:21,079 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:21,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:46:21,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:46:21,080 INFO L87 Difference]: Start difference. First operand 1978 states and 2801 transitions. Second operand 3 states. [2019-11-15 23:46:23,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:23,180 INFO L93 Difference]: Finished difference Result 5928 states and 8398 transitions. [2019-11-15 23:46:23,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:46:23,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 288 [2019-11-15 23:46:23,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:23,209 INFO L225 Difference]: With dead ends: 5928 [2019-11-15 23:46:23,210 INFO L226 Difference]: Without dead ends: 3952 [2019-11-15 23:46:23,213 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:46:23,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3952 states. [2019-11-15 23:46:23,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 3952. [2019-11-15 23:46:23,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3952 states. [2019-11-15 23:46:23,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 5369 transitions. [2019-11-15 23:46:23,302 INFO L78 Accepts]: Start accepts. Automaton has 3952 states and 5369 transitions. Word has length 288 [2019-11-15 23:46:23,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:23,306 INFO L462 AbstractCegarLoop]: Abstraction has 3952 states and 5369 transitions. [2019-11-15 23:46:23,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:46:23,307 INFO L276 IsEmpty]: Start isEmpty. Operand 3952 states and 5369 transitions. [2019-11-15 23:46:23,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-11-15 23:46:23,313 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:23,313 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 23:46:23,518 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:46:23,518 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:46:23,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:23,519 INFO L82 PathProgramCache]: Analyzing trace with hash 139861487, now seen corresponding path program 1 times [2019-11-15 23:46:23,519 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:23,519 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617859982] [2019-11-15 23:46:23,519 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:23,520 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:23,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:24,238 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-15 23:46:24,239 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617859982] [2019-11-15 23:46:24,239 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:24,239 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:46:24,240 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63392688] [2019-11-15 23:46:24,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:46:24,241 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:24,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:46:24,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:46:24,241 INFO L87 Difference]: Start difference. First operand 3952 states and 5369 transitions. Second operand 7 states. [2019-11-15 23:46:26,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:26,987 INFO L93 Difference]: Finished difference Result 8269 states and 11121 transitions. [2019-11-15 23:46:26,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:46:26,988 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 343 [2019-11-15 23:46:26,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:27,014 INFO L225 Difference]: With dead ends: 8269 [2019-11-15 23:46:27,014 INFO L226 Difference]: Without dead ends: 4319 [2019-11-15 23:46:27,020 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:46:27,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4319 states. [2019-11-15 23:46:27,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4319 to 4281. [2019-11-15 23:46:27,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4281 states. [2019-11-15 23:46:27,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4281 states to 4281 states and 5704 transitions. [2019-11-15 23:46:27,109 INFO L78 Accepts]: Start accepts. Automaton has 4281 states and 5704 transitions. Word has length 343 [2019-11-15 23:46:27,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:27,110 INFO L462 AbstractCegarLoop]: Abstraction has 4281 states and 5704 transitions. [2019-11-15 23:46:27,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:46:27,110 INFO L276 IsEmpty]: Start isEmpty. Operand 4281 states and 5704 transitions. [2019-11-15 23:46:27,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2019-11-15 23:46:27,118 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:27,119 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 23:46:27,119 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:46:27,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:27,119 INFO L82 PathProgramCache]: Analyzing trace with hash -492956799, now seen corresponding path program 1 times [2019-11-15 23:46:27,120 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:27,120 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999553344] [2019-11-15 23:46:27,120 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:27,120 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:27,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:27,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:27,554 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-15 23:46:27,556 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999553344] [2019-11-15 23:46:27,556 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:27,559 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:46:27,559 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471291572] [2019-11-15 23:46:27,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:46:27,561 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:27,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:46:27,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:27,562 INFO L87 Difference]: Start difference. First operand 4281 states and 5704 transitions. Second operand 3 states. [2019-11-15 23:46:29,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:29,372 INFO L93 Difference]: Finished difference Result 12179 states and 16437 transitions. [2019-11-15 23:46:29,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:46:29,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 430 [2019-11-15 23:46:29,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:29,404 INFO L225 Difference]: With dead ends: 12179 [2019-11-15 23:46:29,404 INFO L226 Difference]: Without dead ends: 6255 [2019-11-15 23:46:29,413 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:29,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6255 states. [2019-11-15 23:46:29,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6255 to 5926. [2019-11-15 23:46:29,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5926 states. [2019-11-15 23:46:29,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5926 states to 5926 states and 6485 transitions. [2019-11-15 23:46:29,553 INFO L78 Accepts]: Start accepts. Automaton has 5926 states and 6485 transitions. Word has length 430 [2019-11-15 23:46:29,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:29,553 INFO L462 AbstractCegarLoop]: Abstraction has 5926 states and 6485 transitions. [2019-11-15 23:46:29,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:46:29,554 INFO L276 IsEmpty]: Start isEmpty. Operand 5926 states and 6485 transitions. [2019-11-15 23:46:29,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2019-11-15 23:46:29,563 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:29,563 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:29,564 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:46:29,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:29,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1084367381, now seen corresponding path program 1 times [2019-11-15 23:46:29,565 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:29,565 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089133591] [2019-11-15 23:46:29,565 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:29,565 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:29,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:29,903 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:46:29,904 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089133591] [2019-11-15 23:46:29,904 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:29,904 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:46:29,904 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191564658] [2019-11-15 23:46:29,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:46:29,905 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:29,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:46:29,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:46:29,906 INFO L87 Difference]: Start difference. First operand 5926 states and 6485 transitions. Second operand 4 states. [2019-11-15 23:46:31,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:31,630 INFO L93 Difference]: Finished difference Result 13495 states and 14822 transitions. [2019-11-15 23:46:31,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:46:31,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 447 [2019-11-15 23:46:31,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:31,664 INFO L225 Difference]: With dead ends: 13495 [2019-11-15 23:46:31,664 INFO L226 Difference]: Without dead ends: 7900 [2019-11-15 23:46:31,671 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:46:31,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7900 states. [2019-11-15 23:46:31,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7900 to 7242. [2019-11-15 23:46:31,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7242 states. [2019-11-15 23:46:31,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7242 states to 7242 states and 7787 transitions. [2019-11-15 23:46:31,803 INFO L78 Accepts]: Start accepts. Automaton has 7242 states and 7787 transitions. Word has length 447 [2019-11-15 23:46:31,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:31,804 INFO L462 AbstractCegarLoop]: Abstraction has 7242 states and 7787 transitions. [2019-11-15 23:46:31,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:46:31,812 INFO L276 IsEmpty]: Start isEmpty. Operand 7242 states and 7787 transitions. [2019-11-15 23:46:31,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2019-11-15 23:46:31,826 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:31,827 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:31,827 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:46:31,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:31,828 INFO L82 PathProgramCache]: Analyzing trace with hash -947048121, now seen corresponding path program 1 times [2019-11-15 23:46:31,828 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:31,828 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969434577] [2019-11-15 23:46:31,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:31,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:31,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:33,395 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 456 proven. 64 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-15 23:46:33,396 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969434577] [2019-11-15 23:46:33,396 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240209326] [2019-11-15 23:46:33,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_54a8d788-0ad5-4196-99b8-3d84514e908d/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:46:33,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:33,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:46:33,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:46:33,895 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-11-15 23:46:33,895 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:46:33,895 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2019-11-15 23:46:33,896 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699566003] [2019-11-15 23:46:33,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:46:33,896 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:33,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:46:33,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:46:33,897 INFO L87 Difference]: Start difference. First operand 7242 states and 7787 transitions. Second operand 3 states. [2019-11-15 23:46:34,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:34,782 INFO L93 Difference]: Finished difference Result 16456 states and 17670 transitions. [2019-11-15 23:46:34,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:46:34,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 586 [2019-11-15 23:46:34,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:34,812 INFO L225 Difference]: With dead ends: 16456 [2019-11-15 23:46:34,812 INFO L226 Difference]: Without dead ends: 9545 [2019-11-15 23:46:34,820 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 593 GetRequests, 585 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:46:34,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9545 states. [2019-11-15 23:46:34,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9545 to 9545. [2019-11-15 23:46:34,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9545 states. [2019-11-15 23:46:34,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9545 states to 9545 states and 10064 transitions. [2019-11-15 23:46:34,953 INFO L78 Accepts]: Start accepts. Automaton has 9545 states and 10064 transitions. Word has length 586 [2019-11-15 23:46:34,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:34,954 INFO L462 AbstractCegarLoop]: Abstraction has 9545 states and 10064 transitions. [2019-11-15 23:46:34,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:46:34,955 INFO L276 IsEmpty]: Start isEmpty. Operand 9545 states and 10064 transitions. [2019-11-15 23:46:34,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 667 [2019-11-15 23:46:34,977 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:34,977 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 23:46:35,180 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:46:35,188 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:46:35,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:35,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1463765033, now seen corresponding path program 1 times [2019-11-15 23:46:35,189 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:35,189 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142864398] [2019-11-15 23:46:35,189 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:35,189 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:35,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:35,702 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2019-11-15 23:46:35,703 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142864398] [2019-11-15 23:46:35,703 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:35,704 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:46:35,704 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138744521] [2019-11-15 23:46:35,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:46:35,705 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:35,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:46:35,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:46:35,706 INFO L87 Difference]: Start difference. First operand 9545 states and 10064 transitions. Second operand 4 states. [2019-11-15 23:46:37,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:37,948 INFO L93 Difference]: Finished difference Result 21062 states and 22196 transitions. [2019-11-15 23:46:37,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:46:37,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 666 [2019-11-15 23:46:37,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:37,967 INFO L225 Difference]: With dead ends: 21062 [2019-11-15 23:46:37,967 INFO L226 Difference]: Without dead ends: 11848 [2019-11-15 23:46:37,976 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:46:37,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11848 states. [2019-11-15 23:46:38,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11848 to 9874. [2019-11-15 23:46:38,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9874 states. [2019-11-15 23:46:38,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9874 states to 9874 states and 10340 transitions. [2019-11-15 23:46:38,109 INFO L78 Accepts]: Start accepts. Automaton has 9874 states and 10340 transitions. Word has length 666 [2019-11-15 23:46:38,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:38,110 INFO L462 AbstractCegarLoop]: Abstraction has 9874 states and 10340 transitions. [2019-11-15 23:46:38,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:46:38,110 INFO L276 IsEmpty]: Start isEmpty. Operand 9874 states and 10340 transitions. [2019-11-15 23:46:38,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 946 [2019-11-15 23:46:38,126 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:38,128 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 23:46:38,128 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:46:38,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:38,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1348188237, now seen corresponding path program 1 times [2019-11-15 23:46:38,129 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:38,129 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90510766] [2019-11-15 23:46:38,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:38,130 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:38,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:38,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:38,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 1427 proven. 0 refuted. 0 times theorem prover too weak. 571 trivial. 0 not checked. [2019-11-15 23:46:38,981 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90510766] [2019-11-15 23:46:38,982 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:38,982 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:46:38,982 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102832868] [2019-11-15 23:46:38,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:46:38,984 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:38,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:46:38,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:46:38,985 INFO L87 Difference]: Start difference. First operand 9874 states and 10340 transitions. Second operand 4 states. [2019-11-15 23:46:40,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:40,702 INFO L93 Difference]: Finished difference Result 21720 states and 22758 transitions. [2019-11-15 23:46:40,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:46:40,703 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 945 [2019-11-15 23:46:40,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:40,723 INFO L225 Difference]: With dead ends: 21720 [2019-11-15 23:46:40,723 INFO L226 Difference]: Without dead ends: 12177 [2019-11-15 23:46:40,732 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:46:40,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12177 states. [2019-11-15 23:46:40,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12177 to 12177. [2019-11-15 23:46:40,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12177 states. [2019-11-15 23:46:40,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12177 states to 12177 states and 12645 transitions. [2019-11-15 23:46:40,895 INFO L78 Accepts]: Start accepts. Automaton has 12177 states and 12645 transitions. Word has length 945 [2019-11-15 23:46:40,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:40,897 INFO L462 AbstractCegarLoop]: Abstraction has 12177 states and 12645 transitions. [2019-11-15 23:46:40,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:46:40,897 INFO L276 IsEmpty]: Start isEmpty. Operand 12177 states and 12645 transitions. [2019-11-15 23:46:40,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1281 [2019-11-15 23:46:40,926 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:40,927 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:40,928 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:46:40,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:40,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1437504205, now seen corresponding path program 1 times [2019-11-15 23:46:40,929 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:40,930 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078210041] [2019-11-15 23:46:40,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:40,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:40,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:42,225 INFO L134 CoverageAnalysis]: Checked inductivity of 3078 backedges. 2131 proven. 0 refuted. 0 times theorem prover too weak. 947 trivial. 0 not checked. [2019-11-15 23:46:42,226 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078210041] [2019-11-15 23:46:42,226 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:42,226 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:46:42,227 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283236535] [2019-11-15 23:46:42,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:46:42,228 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:42,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:46:42,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:46:42,229 INFO L87 Difference]: Start difference. First operand 12177 states and 12645 transitions. Second operand 4 states. [2019-11-15 23:46:43,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:43,675 INFO L93 Difference]: Finished difference Result 24681 states and 25639 transitions. [2019-11-15 23:46:43,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:46:43,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1280 [2019-11-15 23:46:43,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:43,692 INFO L225 Difference]: With dead ends: 24681 [2019-11-15 23:46:43,693 INFO L226 Difference]: Without dead ends: 12835 [2019-11-15 23:46:43,702 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:46:43,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12835 states. [2019-11-15 23:46:43,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12835 to 12506. [2019-11-15 23:46:43,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12506 states. [2019-11-15 23:46:43,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12506 states to 12506 states and 12870 transitions. [2019-11-15 23:46:43,842 INFO L78 Accepts]: Start accepts. Automaton has 12506 states and 12870 transitions. Word has length 1280 [2019-11-15 23:46:43,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:43,843 INFO L462 AbstractCegarLoop]: Abstraction has 12506 states and 12870 transitions. [2019-11-15 23:46:43,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:46:43,844 INFO L276 IsEmpty]: Start isEmpty. Operand 12506 states and 12870 transitions. [2019-11-15 23:46:43,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1282 [2019-11-15 23:46:43,875 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:43,877 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:43,877 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:46:43,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:43,878 INFO L82 PathProgramCache]: Analyzing trace with hash 553184258, now seen corresponding path program 1 times [2019-11-15 23:46:43,878 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:43,878 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984074824] [2019-11-15 23:46:43,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:43,879 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:43,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:44,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:46,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3084 backedges. 1594 proven. 467 refuted. 0 times theorem prover too weak. 1023 trivial. 0 not checked. [2019-11-15 23:46:46,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984074824] [2019-11-15 23:46:46,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685014510] [2019-11-15 23:46:46,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_54a8d788-0ad5-4196-99b8-3d84514e908d/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:46:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:46,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 1483 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:46:46,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:46:47,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3084 backedges. 1848 proven. 0 refuted. 0 times theorem prover too weak. 1236 trivial. 0 not checked. [2019-11-15 23:46:47,759 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:46:47,760 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-11-15 23:46:47,760 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912029367] [2019-11-15 23:46:47,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:46:47,761 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:47,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:46:47,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:46:47,761 INFO L87 Difference]: Start difference. First operand 12506 states and 12870 transitions. Second operand 3 states. [2019-11-15 23:46:48,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:48,759 INFO L93 Difference]: Finished difference Result 24681 states and 25407 transitions. [2019-11-15 23:46:48,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:46:48,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1281 [2019-11-15 23:46:48,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:48,784 INFO L225 Difference]: With dead ends: 24681 [2019-11-15 23:46:48,784 INFO L226 Difference]: Without dead ends: 12506 [2019-11-15 23:46:48,795 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1290 GetRequests, 1281 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:46:48,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12506 states. [2019-11-15 23:46:48,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12506 to 12506. [2019-11-15 23:46:48,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12506 states. [2019-11-15 23:46:48,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12506 states to 12506 states and 12823 transitions. [2019-11-15 23:46:48,944 INFO L78 Accepts]: Start accepts. Automaton has 12506 states and 12823 transitions. Word has length 1281 [2019-11-15 23:46:48,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:48,946 INFO L462 AbstractCegarLoop]: Abstraction has 12506 states and 12823 transitions. [2019-11-15 23:46:48,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:46:48,946 INFO L276 IsEmpty]: Start isEmpty. Operand 12506 states and 12823 transitions. [2019-11-15 23:46:48,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1448 [2019-11-15 23:46:48,988 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:48,989 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:49,192 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:46:49,193 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:46:49,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:49,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1726997540, now seen corresponding path program 1 times [2019-11-15 23:46:49,193 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:49,193 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994419119] [2019-11-15 23:46:49,194 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:49,194 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:49,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:51,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4081 backedges. 3177 proven. 0 refuted. 0 times theorem prover too weak. 904 trivial. 0 not checked. [2019-11-15 23:46:51,428 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994419119] [2019-11-15 23:46:51,429 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:51,429 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:46:51,429 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396410837] [2019-11-15 23:46:51,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:46:51,433 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:51,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:46:51,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:46:51,433 INFO L87 Difference]: Start difference. First operand 12506 states and 12823 transitions. Second operand 6 states. [2019-11-15 23:46:53,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:53,967 INFO L93 Difference]: Finished difference Result 29616 states and 30356 transitions. [2019-11-15 23:46:53,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:46:53,980 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1447 [2019-11-15 23:46:53,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:53,999 INFO L225 Difference]: With dead ends: 29616 [2019-11-15 23:46:53,999 INFO L226 Difference]: Without dead ends: 17441 [2019-11-15 23:46:54,008 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:46:54,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17441 states. [2019-11-15 23:46:54,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17441 to 13822. [2019-11-15 23:46:54,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13822 states. [2019-11-15 23:46:54,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13822 states to 13822 states and 14150 transitions. [2019-11-15 23:46:54,186 INFO L78 Accepts]: Start accepts. Automaton has 13822 states and 14150 transitions. Word has length 1447 [2019-11-15 23:46:54,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:54,187 INFO L462 AbstractCegarLoop]: Abstraction has 13822 states and 14150 transitions. [2019-11-15 23:46:54,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:46:54,187 INFO L276 IsEmpty]: Start isEmpty. Operand 13822 states and 14150 transitions. [2019-11-15 23:46:54,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1479 [2019-11-15 23:46:54,216 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:54,217 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 23:46:54,217 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:46:54,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:54,218 INFO L82 PathProgramCache]: Analyzing trace with hash 739806131, now seen corresponding path program 1 times [2019-11-15 23:46:54,218 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:54,218 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291357050] [2019-11-15 23:46:54,218 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:54,218 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:54,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:56,772 INFO L134 CoverageAnalysis]: Checked inductivity of 4393 backedges. 2797 proven. 191 refuted. 0 times theorem prover too weak. 1405 trivial. 0 not checked. [2019-11-15 23:46:56,772 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291357050] [2019-11-15 23:46:56,772 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438091069] [2019-11-15 23:46:56,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_54a8d788-0ad5-4196-99b8-3d84514e908d/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:46:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:57,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 1707 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:46:57,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:46:58,776 INFO L134 CoverageAnalysis]: Checked inductivity of 4393 backedges. 1969 proven. 0 refuted. 0 times theorem prover too weak. 2424 trivial. 0 not checked. [2019-11-15 23:46:58,776 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:46:58,777 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2019-11-15 23:46:58,777 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784374252] [2019-11-15 23:46:58,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:46:58,778 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:58,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:46:58,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:46:58,779 INFO L87 Difference]: Start difference. First operand 13822 states and 14150 transitions. Second operand 3 states. [2019-11-15 23:46:59,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:59,729 INFO L93 Difference]: Finished difference Result 27313 states and 27967 transitions. [2019-11-15 23:46:59,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:46:59,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1478 [2019-11-15 23:46:59,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:59,742 INFO L225 Difference]: With dead ends: 27313 [2019-11-15 23:46:59,743 INFO L226 Difference]: Without dead ends: 13822 [2019-11-15 23:46:59,749 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1482 GetRequests, 1477 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:46:59,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13822 states. [2019-11-15 23:46:59,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13822 to 13493. [2019-11-15 23:46:59,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13493 states. [2019-11-15 23:46:59,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13493 states to 13493 states and 13817 transitions. [2019-11-15 23:46:59,893 INFO L78 Accepts]: Start accepts. Automaton has 13493 states and 13817 transitions. Word has length 1478 [2019-11-15 23:46:59,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:59,894 INFO L462 AbstractCegarLoop]: Abstraction has 13493 states and 13817 transitions. [2019-11-15 23:46:59,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:46:59,895 INFO L276 IsEmpty]: Start isEmpty. Operand 13493 states and 13817 transitions. [2019-11-15 23:46:59,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1509 [2019-11-15 23:46:59,922 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:59,923 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:47:00,127 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:47:00,127 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:47:00,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:00,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1962984879, now seen corresponding path program 1 times [2019-11-15 23:47:00,128 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:00,128 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933364893] [2019-11-15 23:47:00,128 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:00,128 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:00,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:00,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:03,026 INFO L134 CoverageAnalysis]: Checked inductivity of 5173 backedges. 2098 proven. 157 refuted. 0 times theorem prover too weak. 2918 trivial. 0 not checked. [2019-11-15 23:47:03,026 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933364893] [2019-11-15 23:47:03,026 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509637798] [2019-11-15 23:47:03,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_54a8d788-0ad5-4196-99b8-3d84514e908d/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:47:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:03,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 1761 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:47:03,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:47:04,813 INFO L134 CoverageAnalysis]: Checked inductivity of 5173 backedges. 2255 proven. 0 refuted. 0 times theorem prover too weak. 2918 trivial. 0 not checked. [2019-11-15 23:47:04,813 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:47:04,814 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2019-11-15 23:47:04,814 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779528998] [2019-11-15 23:47:04,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:47:04,816 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:47:04,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:47:04,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:47:04,816 INFO L87 Difference]: Start difference. First operand 13493 states and 13817 transitions. Second operand 3 states. [2019-11-15 23:47:05,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:47:05,723 INFO L93 Difference]: Finished difference Result 28300 states and 28997 transitions. [2019-11-15 23:47:05,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:47:05,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1508 [2019-11-15 23:47:05,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:47:05,736 INFO L225 Difference]: With dead ends: 28300 [2019-11-15 23:47:05,737 INFO L226 Difference]: Without dead ends: 14809 [2019-11-15 23:47:05,745 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1516 GetRequests, 1507 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:47:05,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14809 states. [2019-11-15 23:47:05,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14809 to 14809. [2019-11-15 23:47:05,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14809 states. [2019-11-15 23:47:05,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14809 states to 14809 states and 15149 transitions. [2019-11-15 23:47:05,898 INFO L78 Accepts]: Start accepts. Automaton has 14809 states and 15149 transitions. Word has length 1508 [2019-11-15 23:47:05,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:47:05,899 INFO L462 AbstractCegarLoop]: Abstraction has 14809 states and 15149 transitions. [2019-11-15 23:47:05,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:47:05,899 INFO L276 IsEmpty]: Start isEmpty. Operand 14809 states and 15149 transitions. [2019-11-15 23:47:05,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1731 [2019-11-15 23:47:05,925 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:47:05,926 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:47:06,138 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:47:06,139 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:47:06,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:06,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1358453474, now seen corresponding path program 1 times [2019-11-15 23:47:06,140 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:06,140 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34975563] [2019-11-15 23:47:06,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:06,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:06,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:09,854 INFO L134 CoverageAnalysis]: Checked inductivity of 5458 backedges. 3789 proven. 0 refuted. 0 times theorem prover too weak. 1669 trivial. 0 not checked. [2019-11-15 23:47:09,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34975563] [2019-11-15 23:47:09,854 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:47:09,855 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:47:09,855 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009827377] [2019-11-15 23:47:09,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:47:09,856 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:47:09,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:47:09,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:47:09,857 INFO L87 Difference]: Start difference. First operand 14809 states and 15149 transitions. Second operand 5 states. [2019-11-15 23:47:11,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:47:11,586 INFO L93 Difference]: Finished difference Result 29948 states and 30632 transitions. [2019-11-15 23:47:11,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:47:11,586 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1730 [2019-11-15 23:47:11,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:47:11,596 INFO L225 Difference]: With dead ends: 29948 [2019-11-15 23:47:11,596 INFO L226 Difference]: Without dead ends: 15141 [2019-11-15 23:47:11,604 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:47:11,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15141 states. [2019-11-15 23:47:11,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15141 to 14809. [2019-11-15 23:47:11,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14809 states. [2019-11-15 23:47:11,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14809 states to 14809 states and 15143 transitions. [2019-11-15 23:47:11,747 INFO L78 Accepts]: Start accepts. Automaton has 14809 states and 15143 transitions. Word has length 1730 [2019-11-15 23:47:11,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:47:11,748 INFO L462 AbstractCegarLoop]: Abstraction has 14809 states and 15143 transitions. [2019-11-15 23:47:11,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:47:11,748 INFO L276 IsEmpty]: Start isEmpty. Operand 14809 states and 15143 transitions. [2019-11-15 23:47:11,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2106 [2019-11-15 23:47:11,772 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:47:11,774 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 23:47:11,774 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:47:11,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:11,775 INFO L82 PathProgramCache]: Analyzing trace with hash 608744129, now seen corresponding path program 1 times [2019-11-15 23:47:11,775 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:11,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114511571] [2019-11-15 23:47:11,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:11,776 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:11,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:11,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:19,370 INFO L134 CoverageAnalysis]: Checked inductivity of 8026 backedges. 5345 proven. 1498 refuted. 0 times theorem prover too weak. 1183 trivial. 0 not checked. [2019-11-15 23:47:19,370 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114511571] [2019-11-15 23:47:19,371 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001194033] [2019-11-15 23:47:19,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_54a8d788-0ad5-4196-99b8-3d84514e908d/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:47:19,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:19,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 2413 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:47:19,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:47:22,336 INFO L134 CoverageAnalysis]: Checked inductivity of 8026 backedges. 4649 proven. 0 refuted. 0 times theorem prover too weak. 3377 trivial. 0 not checked. [2019-11-15 23:47:22,336 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:47:22,337 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2019-11-15 23:47:22,337 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523493626] [2019-11-15 23:47:22,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:47:22,338 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:47:22,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:47:22,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:47:22,338 INFO L87 Difference]: Start difference. First operand 14809 states and 15143 transitions. Second operand 4 states. [2019-11-15 23:47:23,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:47:23,632 INFO L93 Difference]: Finished difference Result 31590 states and 32284 transitions. [2019-11-15 23:47:23,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:47:23,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 2105 [2019-11-15 23:47:23,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:47:23,643 INFO L225 Difference]: With dead ends: 31590 [2019-11-15 23:47:23,643 INFO L226 Difference]: Without dead ends: 14809 [2019-11-15 23:47:23,649 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2117 GetRequests, 2104 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:47:23,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14809 states. [2019-11-15 23:47:23,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14809 to 14809. [2019-11-15 23:47:23,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14809 states. [2019-11-15 23:47:23,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14809 states to 14809 states and 15125 transitions. [2019-11-15 23:47:23,771 INFO L78 Accepts]: Start accepts. Automaton has 14809 states and 15125 transitions. Word has length 2105 [2019-11-15 23:47:23,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:47:23,773 INFO L462 AbstractCegarLoop]: Abstraction has 14809 states and 15125 transitions. [2019-11-15 23:47:23,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:47:23,773 INFO L276 IsEmpty]: Start isEmpty. Operand 14809 states and 15125 transitions. [2019-11-15 23:47:23,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2347 [2019-11-15 23:47:23,812 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:47:23,813 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 23:47:24,014 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:47:24,014 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:47:24,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:24,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1532383712, now seen corresponding path program 1 times [2019-11-15 23:47:24,015 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:24,015 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204904986] [2019-11-15 23:47:24,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:24,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:24,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:24,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:27,629 INFO L134 CoverageAnalysis]: Checked inductivity of 10430 backedges. 6649 proven. 0 refuted. 0 times theorem prover too weak. 3781 trivial. 0 not checked. [2019-11-15 23:47:27,629 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204904986] [2019-11-15 23:47:27,629 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:47:27,629 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:47:27,629 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008299072] [2019-11-15 23:47:27,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:47:27,631 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:47:27,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:47:27,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:47:27,631 INFO L87 Difference]: Start difference. First operand 14809 states and 15125 transitions. Second operand 4 states. [2019-11-15 23:47:28,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:47:28,879 INFO L93 Difference]: Finished difference Result 31919 states and 32627 transitions. [2019-11-15 23:47:28,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:47:28,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 2346 [2019-11-15 23:47:28,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:47:28,891 INFO L225 Difference]: With dead ends: 31919 [2019-11-15 23:47:28,892 INFO L226 Difference]: Without dead ends: 17441 [2019-11-15 23:47:28,898 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:47:28,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17441 states. [2019-11-15 23:47:29,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17441 to 16125. [2019-11-15 23:47:29,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16125 states. [2019-11-15 23:47:29,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16125 states to 16125 states and 16424 transitions. [2019-11-15 23:47:29,023 INFO L78 Accepts]: Start accepts. Automaton has 16125 states and 16424 transitions. Word has length 2346 [2019-11-15 23:47:29,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:47:29,024 INFO L462 AbstractCegarLoop]: Abstraction has 16125 states and 16424 transitions. [2019-11-15 23:47:29,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:47:29,024 INFO L276 IsEmpty]: Start isEmpty. Operand 16125 states and 16424 transitions. [2019-11-15 23:47:29,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2491 [2019-11-15 23:47:29,070 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:47:29,071 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:47:29,072 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:47:29,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:29,073 INFO L82 PathProgramCache]: Analyzing trace with hash 2030831558, now seen corresponding path program 1 times [2019-11-15 23:47:29,073 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:29,073 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062774749] [2019-11-15 23:47:29,073 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:29,074 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:29,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:34,269 INFO L134 CoverageAnalysis]: Checked inductivity of 11649 backedges. 3426 proven. 104 refuted. 0 times theorem prover too weak. 8119 trivial. 0 not checked. [2019-11-15 23:47:34,269 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062774749] [2019-11-15 23:47:34,270 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856225246] [2019-11-15 23:47:34,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_54a8d788-0ad5-4196-99b8-3d84514e908d/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:47:34,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:34,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 2858 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:47:34,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:47:37,647 INFO L134 CoverageAnalysis]: Checked inductivity of 11649 backedges. 6136 proven. 0 refuted. 0 times theorem prover too weak. 5513 trivial. 0 not checked. [2019-11-15 23:47:37,647 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:47:37,649 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2019-11-15 23:47:37,649 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659085286] [2019-11-15 23:47:37,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:47:37,651 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:47:37,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:47:37,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:47:37,651 INFO L87 Difference]: Start difference. First operand 16125 states and 16424 transitions. Second operand 3 states. [2019-11-15 23:47:38,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:47:38,533 INFO L93 Difference]: Finished difference Result 32577 states and 33188 transitions. [2019-11-15 23:47:38,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:47:38,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2490 [2019-11-15 23:47:38,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:47:38,544 INFO L225 Difference]: With dead ends: 32577 [2019-11-15 23:47:38,545 INFO L226 Difference]: Without dead ends: 16783 [2019-11-15 23:47:38,550 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2496 GetRequests, 2490 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:47:38,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16783 states. [2019-11-15 23:47:38,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16783 to 16783. [2019-11-15 23:47:38,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16783 states. [2019-11-15 23:47:38,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16783 states to 16783 states and 17086 transitions. [2019-11-15 23:47:38,672 INFO L78 Accepts]: Start accepts. Automaton has 16783 states and 17086 transitions. Word has length 2490 [2019-11-15 23:47:38,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:47:38,674 INFO L462 AbstractCegarLoop]: Abstraction has 16783 states and 17086 transitions. [2019-11-15 23:47:38,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:47:38,674 INFO L276 IsEmpty]: Start isEmpty. Operand 16783 states and 17086 transitions. [2019-11-15 23:47:38,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2529 [2019-11-15 23:47:38,710 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:47:38,711 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 23:47:38,915 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:47:38,915 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:47:38,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:38,916 INFO L82 PathProgramCache]: Analyzing trace with hash -154185387, now seen corresponding path program 1 times [2019-11-15 23:47:38,916 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:38,920 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604191895] [2019-11-15 23:47:38,920 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:38,920 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:38,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:53,778 INFO L134 CoverageAnalysis]: Checked inductivity of 11829 backedges. 3748 proven. 5496 refuted. 0 times theorem prover too weak. 2585 trivial. 0 not checked. [2019-11-15 23:47:53,779 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604191895] [2019-11-15 23:47:53,779 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93771644] [2019-11-15 23:47:53,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_54a8d788-0ad5-4196-99b8-3d84514e908d/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:47:54,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:54,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 2916 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:47:54,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:47:54,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:54,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:58,888 INFO L134 CoverageAnalysis]: Checked inductivity of 11829 backedges. 1545 proven. 51 refuted. 0 times theorem prover too weak. 10233 trivial. 0 not checked. [2019-11-15 23:47:58,889 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:47:58,890 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 4] total 22 [2019-11-15 23:47:58,890 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141468592] [2019-11-15 23:47:58,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-15 23:47:58,892 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:47:58,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-15 23:47:58,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2019-11-15 23:47:58,894 INFO L87 Difference]: Start difference. First operand 16783 states and 17086 transitions. Second operand 22 states. [2019-11-15 23:48:15,545 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 14 [2019-11-15 23:48:29,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:29,945 INFO L93 Difference]: Finished difference Result 43417 states and 44204 transitions. [2019-11-15 23:48:29,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-11-15 23:48:29,946 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 2528 [2019-11-15 23:48:29,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:29,946 INFO L225 Difference]: With dead ends: 43417 [2019-11-15 23:48:29,946 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 23:48:29,954 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2604 GetRequests, 2550 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=360, Invalid=2090, Unknown=0, NotChecked=0, Total=2450 [2019-11-15 23:48:29,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 23:48:29,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 23:48:29,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 23:48:29,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:48:29,955 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2528 [2019-11-15 23:48:29,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:29,955 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:48:29,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-15 23:48:29,955 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:48:29,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 23:48:30,156 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:30,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 23:48:30,518 WARN L191 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 331 DAG size of output: 217 [2019-11-15 23:48:30,716 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 193 [2019-11-15 23:48:31,028 WARN L191 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 334 DAG size of output: 217 [2019-11-15 23:48:32,358 WARN L191 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 195 DAG size of output: 97 [2019-11-15 23:48:33,427 WARN L191 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 175 DAG size of output: 99 [2019-11-15 23:48:34,557 WARN L191 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 195 DAG size of output: 97 [2019-11-15 23:48:34,558 INFO L443 ceAbstractionStarter]: For program point L894(lines 894 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,559 INFO L443 ceAbstractionStarter]: For program point L828(lines 828 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,559 INFO L443 ceAbstractionStarter]: For program point L696(lines 696 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,559 INFO L443 ceAbstractionStarter]: For program point L1687(lines 1687 1763) no Hoare annotation was computed. [2019-11-15 23:48:34,559 INFO L443 ceAbstractionStarter]: For program point L1291(lines 1291 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,559 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,559 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,559 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,559 INFO L443 ceAbstractionStarter]: For program point L961(lines 961 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,559 INFO L443 ceAbstractionStarter]: For program point L763(lines 763 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,559 INFO L443 ceAbstractionStarter]: For program point L631(lines 631 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,559 INFO L443 ceAbstractionStarter]: For program point L1622(lines 1622 1763) no Hoare annotation was computed. [2019-11-15 23:48:34,559 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,559 INFO L443 ceAbstractionStarter]: For program point L1358(lines 1358 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,559 INFO L443 ceAbstractionStarter]: For program point L235(lines 235 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,560 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-15 23:48:34,560 INFO L443 ceAbstractionStarter]: For program point L1160(lines 1160 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,560 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-15 23:48:34,560 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-15 23:48:34,560 INFO L439 ceAbstractionStarter]: At program point L1491(lines 23 1492) the Hoare annotation is: (let ((.cse18 (+ ~a18~0 79)) (.cse4 (= ~a12~0 6)) (.cse15 (= ~a12~0 8))) (let ((.cse9 (= 5 ~a12~0)) (.cse14 (<= 69094 ~a18~0)) (.cse7 (not .cse15)) (.cse12 (<= ~a18~0 513056)) (.cse1 (= ~a15~0 4)) (.cse2 (<= ~a18~0 134)) (.cse16 (= 7 ~a12~0)) (.cse13 (not .cse4)) (.cse5 (<= ~a16~0 9)) (.cse3 (<= ~a16~0 11)) (.cse6 (<= .cse18 0)) (.cse17 (< 0 (+ ~a18~0 156))) (.cse0 (= ~a16~0 8)) (.cse10 (= 3 ~a15~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 (<= 4 ~a15~0) .cse4) (and .cse1 .cse5 .cse6 .cse7) (let ((.cse8 (div (+ ~a18~0 (- 599175)) 3))) (and .cse1 .cse3 (<= (+ .cse8 79) 0) .cse9 (= 0 (mod ~a18~0 3)) (< 0 (+ .cse8 156)))) (and .cse10 (exists ((v_~a18~0_902 Int)) (let ((.cse11 (div (+ v_~a18~0_902 (- 599175)) 3))) (and (<= 0 (* 9 v_~a18~0_902)) (<= (+ ~a18~0 557770) (div (* v_~a18~0_902 9) 10)) (< 0 (+ .cse11 156)) (<= (+ .cse11 79) 0) (= 0 (mod v_~a18~0_902 3))))) .cse4) (and .cse1 .cse3 .cse9 .cse6) (and (and .cse9 .cse10) .cse12) (and .cse3 .cse13 .cse10 .cse12 (not (= 10 ~a16~0))) (and .cse14 .cse10 .cse15) (and .cse1 .cse0 (= ~a12~0 5)) (and (<= 12 ~a16~0) .cse10 .cse7) (and .cse1 .cse14 .cse5 .cse16) (and .cse1 .cse5 .cse6 .cse17) (and .cse1 .cse2 .cse5 .cse15 (< 0 .cse18)) (and .cse0 .cse1 .cse14 .cse12 .cse7) (and (and .cse10 (< 134 ~a18~0) .cse4) .cse12) (and .cse2 .cse10 .cse15) (and .cse1 .cse2 .cse5 .cse16) (and .cse13 .cse5 .cse10) (and .cse3 .cse10 .cse15) (and .cse10 .cse6 .cse17 .cse4) (and .cse0 .cse10)))) [2019-11-15 23:48:34,560 INFO L443 ceAbstractionStarter]: For program point L434(lines 434 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,560 INFO L443 ceAbstractionStarter]: For program point L1227(lines 1227 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,560 INFO L443 ceAbstractionStarter]: For program point L567(lines 567 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,560 INFO L443 ceAbstractionStarter]: For program point L501(lines 501 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,561 INFO L443 ceAbstractionStarter]: For program point L303(lines 303 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,561 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,561 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,561 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,561 INFO L443 ceAbstractionStarter]: For program point L1757(lines 1757 1763) no Hoare annotation was computed. [2019-11-15 23:48:34,561 INFO L443 ceAbstractionStarter]: For program point L1559(lines 1559 1763) no Hoare annotation was computed. [2019-11-15 23:48:34,561 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-15 23:48:34,561 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-15 23:48:34,561 INFO L443 ceAbstractionStarter]: For program point L1097(lines 1097 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,561 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-15 23:48:34,561 INFO L443 ceAbstractionStarter]: For program point L1031(lines 1031 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,561 INFO L443 ceAbstractionStarter]: For program point L899(lines 899 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,561 INFO L443 ceAbstractionStarter]: For program point L1428(lines 1428 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,561 INFO L443 ceAbstractionStarter]: For program point L834(lines 834 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,561 INFO L443 ceAbstractionStarter]: For program point L1693(lines 1693 1763) no Hoare annotation was computed. [2019-11-15 23:48:34,562 INFO L443 ceAbstractionStarter]: For program point L636(lines 636 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,562 INFO L443 ceAbstractionStarter]: For program point L1297(lines 1297 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,562 INFO L443 ceAbstractionStarter]: For program point L240(lines 240 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,562 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,562 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,562 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,562 INFO L443 ceAbstractionStarter]: For program point L967(lines 967 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,562 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,562 INFO L443 ceAbstractionStarter]: For program point L703(lines 703 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,562 INFO L443 ceAbstractionStarter]: For program point L1628(lines 1628 1763) no Hoare annotation was computed. [2019-11-15 23:48:34,562 INFO L443 ceAbstractionStarter]: For program point L373(lines 373 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,562 INFO L443 ceAbstractionStarter]: For program point L1364(lines 1364 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,562 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-15 23:48:34,562 INFO L443 ceAbstractionStarter]: For program point L1166(lines 1166 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,562 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-15 23:48:34,562 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-15 23:48:34,563 INFO L443 ceAbstractionStarter]: For program point L1497(lines 1497 1763) no Hoare annotation was computed. [2019-11-15 23:48:34,563 INFO L443 ceAbstractionStarter]: For program point L440(lines 440 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,563 INFO L443 ceAbstractionStarter]: For program point L573(lines 573 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,563 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,563 INFO L443 ceAbstractionStarter]: For program point L1234(lines 1234 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,563 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,563 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,563 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,563 INFO L443 ceAbstractionStarter]: For program point L1036(lines 1036 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,563 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,563 INFO L443 ceAbstractionStarter]: For program point L508(lines 508 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,563 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-15 23:48:34,563 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-15 23:48:34,563 INFO L443 ceAbstractionStarter]: For program point L1103(lines 1103 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,563 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-15 23:48:34,563 INFO L443 ceAbstractionStarter]: For program point L905(lines 905 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,564 INFO L439 ceAbstractionStarter]: At program point L1764(lines 1494 1765) the Hoare annotation is: (let ((.cse18 (+ ~a18~0 79)) (.cse4 (= ~a12~0 6)) (.cse15 (= ~a12~0 8))) (let ((.cse9 (= 5 ~a12~0)) (.cse14 (<= 69094 ~a18~0)) (.cse13 (<= ~a18~0 513056)) (.cse7 (not .cse15)) (.cse2 (<= ~a18~0 134)) (.cse16 (= 7 ~a12~0)) (.cse12 (not .cse4)) (.cse5 (<= ~a16~0 9)) (.cse3 (<= ~a16~0 11)) (.cse6 (<= .cse18 0)) (.cse17 (< 0 (+ ~a18~0 156))) (.cse10 (= 3 ~a15~0)) (.cse1 (= ~a15~0 4)) (.cse0 (= ~a16~0 8))) (or (and .cse0 .cse1 .cse2) (and .cse3 (<= 4 ~a15~0) .cse4) (and .cse1 .cse5 .cse6 .cse7) (let ((.cse8 (div (+ ~a18~0 (- 599175)) 3))) (and .cse1 .cse3 (<= (+ .cse8 79) 0) .cse9 (= 0 (mod ~a18~0 3)) (< 0 (+ .cse8 156)))) (and .cse10 (exists ((v_~a18~0_902 Int)) (let ((.cse11 (div (+ v_~a18~0_902 (- 599175)) 3))) (and (<= 0 (* 9 v_~a18~0_902)) (<= (+ ~a18~0 557770) (div (* v_~a18~0_902 9) 10)) (< 0 (+ .cse11 156)) (<= (+ .cse11 79) 0) (= 0 (mod v_~a18~0_902 3))))) .cse4) (and .cse1 .cse3 .cse9 .cse6) (and .cse3 .cse12 .cse10 .cse13 (not (= 10 ~a16~0))) (and .cse14 .cse10 .cse15) (and (<= 12 ~a16~0) .cse10 .cse7) (and .cse1 .cse14 .cse5 .cse16) (and .cse9 .cse10 .cse13) (and .cse1 .cse5 .cse6 .cse17) (and .cse1 .cse2 .cse5 .cse15 (< 0 .cse18)) (and (and .cse10 (< 134 ~a18~0) .cse4) .cse13) (and .cse0 .cse1 .cse14 .cse13 .cse7) (and .cse2 .cse10 .cse15) (and .cse1 .cse2 .cse5 .cse16) (and .cse12 .cse5 .cse10) (and .cse3 .cse10 .cse15) (and .cse10 .cse6 .cse17 .cse4) (and .cse0 .cse10) (and .cse1 .cse0 (not (= 3 ULTIMATE.start_calculate_output_~input)) (= ~a12~0 5))))) [2019-11-15 23:48:34,564 INFO L443 ceAbstractionStarter]: For program point L641(lines 641 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,564 INFO L443 ceAbstractionStarter]: For program point L1566(lines 1566 1763) no Hoare annotation was computed. [2019-11-15 23:48:34,564 INFO L443 ceAbstractionStarter]: For program point L443(lines 443 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,564 INFO L443 ceAbstractionStarter]: For program point L1434(lines 1434 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,564 INFO L443 ceAbstractionStarter]: For program point L840(lines 840 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,564 INFO L443 ceAbstractionStarter]: For program point L1699(lines 1699 1763) no Hoare annotation was computed. [2019-11-15 23:48:34,564 INFO L443 ceAbstractionStarter]: For program point L1633(lines 1633 1763) no Hoare annotation was computed. [2019-11-15 23:48:34,564 INFO L443 ceAbstractionStarter]: For program point L1303(lines 1303 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,564 INFO L443 ceAbstractionStarter]: For program point L246(lines 246 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,564 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,564 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,565 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,565 INFO L443 ceAbstractionStarter]: For program point L775(lines 775 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,565 INFO L443 ceAbstractionStarter]: For program point L1370(lines 1370 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,565 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-15 23:48:34,565 INFO L443 ceAbstractionStarter]: For program point L1172(lines 1172 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,565 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-15 23:48:34,565 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-15 23:48:34,565 INFO L443 ceAbstractionStarter]: For program point L974(lines 974 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,565 INFO L446 ceAbstractionStarter]: At program point L1767(lines 1767 1783) the Hoare annotation is: true [2019-11-15 23:48:34,565 INFO L443 ceAbstractionStarter]: For program point L578(lines 578 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,565 INFO L443 ceAbstractionStarter]: For program point L1503(lines 1503 1763) no Hoare annotation was computed. [2019-11-15 23:48:34,565 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,565 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,565 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,565 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,565 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,566 INFO L443 ceAbstractionStarter]: For program point L1042(lines 1042 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,566 INFO L443 ceAbstractionStarter]: For program point L778(lines 778 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,566 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,566 INFO L443 ceAbstractionStarter]: For program point L1241(lines 1241 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,566 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-15 23:48:34,566 INFO L443 ceAbstractionStarter]: For program point L1175(lines 1175 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,566 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-15 23:48:34,566 INFO L443 ceAbstractionStarter]: For program point L1109(lines 1109 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,566 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-15 23:48:34,566 INFO L443 ceAbstractionStarter]: For program point L1704(lines 1704 1763) no Hoare annotation was computed. [2019-11-15 23:48:34,566 INFO L443 ceAbstractionStarter]: For program point L1638(lines 1638 1763) no Hoare annotation was computed. [2019-11-15 23:48:34,566 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,566 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,566 INFO L443 ceAbstractionStarter]: For program point L1440(lines 1440 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,566 INFO L443 ceAbstractionStarter]: For program point L912(lines 912 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,566 INFO L443 ceAbstractionStarter]: For program point L846(lines 846 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,567 INFO L443 ceAbstractionStarter]: For program point L648(lines 648 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,567 INFO L443 ceAbstractionStarter]: For program point L1573(lines 1573 1763) no Hoare annotation was computed. [2019-11-15 23:48:34,567 INFO L443 ceAbstractionStarter]: For program point L1375(lines 1375 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,567 INFO L443 ceAbstractionStarter]: For program point L1309(lines 1309 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,567 INFO L443 ceAbstractionStarter]: For program point L252(lines 252 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,567 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,567 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,567 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,567 INFO L443 ceAbstractionStarter]: For program point L979(lines 979 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,567 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-15 23:48:34,567 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-15 23:48:34,567 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-15 23:48:34,568 INFO L439 ceAbstractionStarter]: At program point L1773-2(lines 1773 1782) the Hoare annotation is: (let ((.cse18 (+ ~a18~0 79)) (.cse4 (= ~a12~0 6)) (.cse15 (= ~a12~0 8))) (let ((.cse9 (= 5 ~a12~0)) (.cse14 (<= 69094 ~a18~0)) (.cse7 (not .cse15)) (.cse12 (<= ~a18~0 513056)) (.cse1 (= ~a15~0 4)) (.cse2 (<= ~a18~0 134)) (.cse16 (= 7 ~a12~0)) (.cse13 (not .cse4)) (.cse5 (<= ~a16~0 9)) (.cse3 (<= ~a16~0 11)) (.cse6 (<= .cse18 0)) (.cse17 (< 0 (+ ~a18~0 156))) (.cse0 (= ~a16~0 8)) (.cse10 (= 3 ~a15~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 (<= 4 ~a15~0) .cse4) (and .cse1 .cse5 .cse6 .cse7) (let ((.cse8 (div (+ ~a18~0 (- 599175)) 3))) (and .cse1 .cse3 (<= (+ .cse8 79) 0) .cse9 (= 0 (mod ~a18~0 3)) (< 0 (+ .cse8 156)))) (and .cse10 (exists ((v_~a18~0_902 Int)) (let ((.cse11 (div (+ v_~a18~0_902 (- 599175)) 3))) (and (<= 0 (* 9 v_~a18~0_902)) (<= (+ ~a18~0 557770) (div (* v_~a18~0_902 9) 10)) (< 0 (+ .cse11 156)) (<= (+ .cse11 79) 0) (= 0 (mod v_~a18~0_902 3))))) .cse4) (and .cse1 .cse3 .cse9 .cse6) (and (and .cse9 .cse10) .cse12) (and .cse3 .cse13 .cse10 .cse12 (not (= 10 ~a16~0))) (and .cse14 .cse10 .cse15) (and .cse1 .cse0 (= ~a12~0 5)) (and (<= 12 ~a16~0) .cse10 .cse7) (and .cse1 .cse14 .cse5 .cse16) (and .cse1 .cse5 .cse6 .cse17) (and .cse1 .cse2 .cse5 .cse15 (< 0 .cse18)) (and .cse0 .cse1 .cse14 .cse12 .cse7) (and (and .cse10 (< 134 ~a18~0) .cse4) .cse12) (and .cse2 .cse10 .cse15) (and .cse1 .cse2 .cse5 .cse16) (and .cse13 .cse5 .cse10) (and .cse3 .cse10 .cse15) (and .cse10 .cse6 .cse17 .cse4) (and .cse0 .cse10)))) [2019-11-15 23:48:34,568 INFO L443 ceAbstractionStarter]: For program point L584(lines 584 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,568 INFO L443 ceAbstractionStarter]: For program point L386(lines 386 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,568 INFO L443 ceAbstractionStarter]: For program point L717(lines 717 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,568 INFO L443 ceAbstractionStarter]: For program point L1510(lines 1510 1763) no Hoare annotation was computed. [2019-11-15 23:48:34,568 INFO L443 ceAbstractionStarter]: For program point L321(lines 321 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,568 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,568 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,568 INFO L443 ceAbstractionStarter]: For program point L1114(lines 1114 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,568 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,568 INFO L443 ceAbstractionStarter]: For program point L1048(lines 1048 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,568 INFO L443 ceAbstractionStarter]: For program point L784(lines 784 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,569 INFO L443 ceAbstractionStarter]: For program point L1709(lines 1709 1763) no Hoare annotation was computed. [2019-11-15 23:48:34,569 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,569 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 23:48:34,569 INFO L443 ceAbstractionStarter]: For program point L1247(lines 1247 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,569 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-15 23:48:34,569 INFO L443 ceAbstractionStarter]: For program point L1181(lines 1181 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,569 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-15 23:48:34,569 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-15 23:48:34,569 INFO L443 ceAbstractionStarter]: For program point L917(lines 917 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,569 INFO L443 ceAbstractionStarter]: For program point L851(lines 851 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,569 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,569 INFO L443 ceAbstractionStarter]: For program point L1446(lines 1446 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,570 INFO L443 ceAbstractionStarter]: For program point L1314(lines 1314 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,570 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,570 INFO L443 ceAbstractionStarter]: For program point L1645(lines 1645 1763) no Hoare annotation was computed. [2019-11-15 23:48:34,570 INFO L443 ceAbstractionStarter]: For program point L1579(lines 1579 1763) no Hoare annotation was computed. [2019-11-15 23:48:34,570 INFO L443 ceAbstractionStarter]: For program point L1381(lines 1381 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,570 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,570 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,570 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,570 INFO L443 ceAbstractionStarter]: For program point L1778(line 1778) no Hoare annotation was computed. [2019-11-15 23:48:34,570 INFO L443 ceAbstractionStarter]: For program point L655(lines 655 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,570 INFO L443 ceAbstractionStarter]: For program point L589(lines 589 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,570 INFO L443 ceAbstractionStarter]: For program point L457(lines 457 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,571 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,571 INFO L443 ceAbstractionStarter]: For program point L1250(lines 1250 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,571 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-15 23:48:34,571 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-15 23:48:34,571 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-15 23:48:34,571 INFO L443 ceAbstractionStarter]: For program point L986(lines 986 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,571 INFO L443 ceAbstractionStarter]: For program point L1515(lines 1515 1763) no Hoare annotation was computed. [2019-11-15 23:48:34,571 INFO L443 ceAbstractionStarter]: For program point L1449(lines 1449 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,571 INFO L443 ceAbstractionStarter]: For program point L789(lines 789 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,571 INFO L443 ceAbstractionStarter]: For program point L723(lines 723 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,571 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,571 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,571 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,572 INFO L443 ceAbstractionStarter]: For program point L1120(lines 1120 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,572 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,572 INFO L443 ceAbstractionStarter]: For program point L922(lines 922 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,572 INFO L443 ceAbstractionStarter]: For program point L1715(lines 1715 1763) no Hoare annotation was computed. [2019-11-15 23:48:34,572 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,572 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-15 23:48:34,572 INFO L443 ceAbstractionStarter]: For program point L1187(lines 1187 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,572 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-15 23:48:34,572 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-15 23:48:34,572 INFO L443 ceAbstractionStarter]: For program point L1055(lines 1055 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,572 INFO L443 ceAbstractionStarter]: For program point L857(lines 857 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,572 INFO L443 ceAbstractionStarter]: For program point L527(lines 527 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,572 INFO L443 ceAbstractionStarter]: For program point L1386(lines 1386 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,573 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 23:48:34,573 INFO L443 ceAbstractionStarter]: For program point L1651(lines 1651 1763) no Hoare annotation was computed. [2019-11-15 23:48:34,573 INFO L443 ceAbstractionStarter]: For program point L594(lines 594 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,573 INFO L443 ceAbstractionStarter]: For program point L1585(lines 1585 1763) no Hoare annotation was computed. [2019-11-15 23:48:34,573 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,573 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,573 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,573 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,573 INFO L443 ceAbstractionStarter]: For program point L661(lines 661 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,573 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,573 INFO L443 ceAbstractionStarter]: For program point L1256(lines 1256 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,573 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-15 23:48:34,574 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-15 23:48:34,574 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-15 23:48:34,574 INFO L443 ceAbstractionStarter]: For program point L728(lines 728 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,574 INFO L443 ceAbstractionStarter]: For program point L1521(lines 1521 1763) no Hoare annotation was computed. [2019-11-15 23:48:34,574 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,574 INFO L443 ceAbstractionStarter]: For program point L1125(lines 1125 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,574 INFO L443 ceAbstractionStarter]: For program point L993(lines 993 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,574 INFO L443 ceAbstractionStarter]: For program point L1456(lines 1456 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,574 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,574 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,574 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,574 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,574 INFO L443 ceAbstractionStarter]: For program point L796(lines 796 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,575 INFO L443 ceAbstractionStarter]: For program point L1721(lines 1721 1763) no Hoare annotation was computed. [2019-11-15 23:48:34,575 INFO L443 ceAbstractionStarter]: For program point L664(lines 664 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,575 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,575 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-15 23:48:34,575 INFO L443 ceAbstractionStarter]: For program point L1193(lines 1193 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,575 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-15 23:48:34,575 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-15 23:48:34,575 INFO L443 ceAbstractionStarter]: For program point L1061(lines 1061 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,575 INFO L443 ceAbstractionStarter]: For program point L929(lines 929 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,575 INFO L443 ceAbstractionStarter]: For program point L863(lines 863 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,575 INFO L443 ceAbstractionStarter]: For program point L1656(lines 1656 1763) no Hoare annotation was computed. [2019-11-15 23:48:34,575 INFO L443 ceAbstractionStarter]: For program point L533(lines 533 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,575 INFO L443 ceAbstractionStarter]: For program point L1392(lines 1392 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,576 INFO L443 ceAbstractionStarter]: For program point L600(lines 600 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,576 INFO L443 ceAbstractionStarter]: For program point L1591(lines 1591 1763) no Hoare annotation was computed. [2019-11-15 23:48:34,576 INFO L443 ceAbstractionStarter]: For program point L1327(lines 1327 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,576 INFO L443 ceAbstractionStarter]: For program point L204-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,576 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,576 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,576 INFO L443 ceAbstractionStarter]: For program point L469(lines 469 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,576 INFO L443 ceAbstractionStarter]: For program point L1262(lines 1262 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,576 INFO L443 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-11-15 23:48:34,576 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-15 23:48:34,576 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-15 23:48:34,576 INFO L443 ceAbstractionStarter]: For program point L734(lines 734 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,577 INFO L443 ceAbstractionStarter]: For program point L1527(lines 1527 1763) no Hoare annotation was computed. [2019-11-15 23:48:34,577 INFO L443 ceAbstractionStarter]: For program point L1461(lines 1461 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,577 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,577 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,577 INFO L443 ceAbstractionStarter]: For program point L1131(lines 1131 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,577 INFO L443 ceAbstractionStarter]: For program point L999(lines 999 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,577 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,577 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,577 INFO L443 ceAbstractionStarter]: For program point L802(lines 802 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,577 INFO L443 ceAbstractionStarter]: For program point L1727(lines 1727 1763) no Hoare annotation was computed. [2019-11-15 23:48:34,577 INFO L443 ceAbstractionStarter]: For program point L670(lines 670 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,577 INFO L443 ceAbstractionStarter]: For program point L538(lines 538 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,577 INFO L443 ceAbstractionStarter]: For program point L1397(lines 1397 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,578 INFO L443 ceAbstractionStarter]: For program point L274(lines 274 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,578 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-15 23:48:34,578 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-15 23:48:34,578 INFO L443 ceAbstractionStarter]: For program point L1067(lines 1067 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,578 INFO L443 ceAbstractionStarter]: For program point L935(lines 935 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,578 INFO L443 ceAbstractionStarter]: For program point L869(lines 869 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,578 INFO L443 ceAbstractionStarter]: For program point L1200(lines 1200 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,578 INFO L443 ceAbstractionStarter]: For program point L1663(lines 1663 1763) no Hoare annotation was computed. [2019-11-15 23:48:34,578 INFO L443 ceAbstractionStarter]: For program point L606(lines 606 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,578 INFO L443 ceAbstractionStarter]: For program point L1597(lines 1597 1763) no Hoare annotation was computed. [2019-11-15 23:48:34,578 INFO L443 ceAbstractionStarter]: For program point L1267(lines 1267 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,578 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,578 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,579 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,579 INFO L443 ceAbstractionStarter]: For program point L1334(lines 1334 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,579 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-15 23:48:34,579 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-15 23:48:34,579 INFO L443 ceAbstractionStarter]: For program point L476(lines 476 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,579 INFO L443 ceAbstractionStarter]: For program point L1137(lines 1137 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,579 INFO L443 ceAbstractionStarter]: For program point L1005(lines 1005 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,579 INFO L443 ceAbstractionStarter]: For program point L741(lines 741 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,579 INFO L443 ceAbstractionStarter]: For program point L543(lines 543 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,579 INFO L443 ceAbstractionStarter]: For program point L1534(lines 1534 1763) no Hoare annotation was computed. [2019-11-15 23:48:34,579 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,579 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,579 INFO L443 ceAbstractionStarter]: For program point L279(lines 279 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,580 INFO L443 ceAbstractionStarter]: For program point L213(lines 213 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,580 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,580 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,580 INFO L443 ceAbstractionStarter]: For program point L808(lines 808 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,580 INFO L443 ceAbstractionStarter]: For program point L1733(lines 1733 1763) no Hoare annotation was computed. [2019-11-15 23:48:34,580 INFO L443 ceAbstractionStarter]: For program point L1403(lines 1403 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,580 INFO L443 ceAbstractionStarter]: For program point L1205(lines 1205 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,580 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-15 23:48:34,580 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-15 23:48:34,580 INFO L443 ceAbstractionStarter]: For program point L1073(lines 1073 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,580 INFO L443 ceAbstractionStarter]: For program point L875(lines 875 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,580 INFO L443 ceAbstractionStarter]: For program point L677(lines 677 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,580 INFO L443 ceAbstractionStarter]: For program point L942(lines 942 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,581 INFO L443 ceAbstractionStarter]: For program point L1669(lines 1669 1763) no Hoare annotation was computed. [2019-11-15 23:48:34,581 INFO L443 ceAbstractionStarter]: For program point L612(lines 612 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,581 INFO L443 ceAbstractionStarter]: For program point L1603(lines 1603 1763) no Hoare annotation was computed. [2019-11-15 23:48:34,581 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,581 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,581 INFO L443 ceAbstractionStarter]: For program point L1472(lines 1472 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,581 INFO L443 ceAbstractionStarter]: For program point L1274(lines 1274 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,581 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-15 23:48:34,581 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-15 23:48:34,581 INFO L443 ceAbstractionStarter]: For program point L746(lines 746 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,581 INFO L443 ceAbstractionStarter]: For program point L680(lines 680 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,582 INFO L443 ceAbstractionStarter]: For program point L548(lines 548 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,582 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,582 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 23:48:34,582 INFO L443 ceAbstractionStarter]: For program point L1341(lines 1341 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,582 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,582 INFO L443 ceAbstractionStarter]: For program point L1143(lines 1143 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,582 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,582 INFO L443 ceAbstractionStarter]: For program point L1540(lines 1540 1763) no Hoare annotation was computed. [2019-11-15 23:48:34,582 INFO L443 ceAbstractionStarter]: For program point L483(lines 483 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,582 INFO L443 ceAbstractionStarter]: For program point L417(lines 417 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,582 INFO L443 ceAbstractionStarter]: For program point L285(lines 285 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,582 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,582 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,583 INFO L443 ceAbstractionStarter]: For program point L1739(lines 1739 1763) no Hoare annotation was computed. [2019-11-15 23:48:34,583 INFO L443 ceAbstractionStarter]: For program point L1409(lines 1409 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,583 INFO L443 ceAbstractionStarter]: For program point L1211(lines 1211 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,583 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-15 23:48:34,583 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-15 23:48:34,583 INFO L443 ceAbstractionStarter]: For program point L1079(lines 1079 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,583 INFO L443 ceAbstractionStarter]: For program point L815(lines 815 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,583 INFO L443 ceAbstractionStarter]: For program point L948(lines 948 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,583 INFO L443 ceAbstractionStarter]: For program point L882(lines 882 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,583 INFO L443 ceAbstractionStarter]: For program point L1675(lines 1675 1763) no Hoare annotation was computed. [2019-11-15 23:48:34,583 INFO L443 ceAbstractionStarter]: For program point L618(lines 618 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,583 INFO L443 ceAbstractionStarter]: For program point L1609(lines 1609 1763) no Hoare annotation was computed. [2019-11-15 23:48:34,583 INFO L443 ceAbstractionStarter]: For program point L1477(lines 1477 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,584 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,584 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,584 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-11-15 23:48:34,584 INFO L443 ceAbstractionStarter]: For program point L24-2(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,584 INFO L443 ceAbstractionStarter]: For program point L1280(lines 1280 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,584 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,584 INFO L443 ceAbstractionStarter]: For program point L1214(lines 1214 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,584 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-15 23:48:34,584 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-15 23:48:34,584 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-15 23:48:34,584 INFO L443 ceAbstractionStarter]: For program point L752(lines 752 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,584 INFO L443 ceAbstractionStarter]: For program point L686(lines 686 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,584 INFO L443 ceAbstractionStarter]: For program point L554(lines 554 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,585 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,585 INFO L443 ceAbstractionStarter]: For program point L1347(lines 1347 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,585 INFO L443 ceAbstractionStarter]: For program point L290(lines 290 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,585 INFO L443 ceAbstractionStarter]: For program point L1149(lines 1149 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,585 INFO L443 ceAbstractionStarter]: For program point L1546(lines 1546 1763) no Hoare annotation was computed. [2019-11-15 23:48:34,585 INFO L443 ceAbstractionStarter]: For program point L489(lines 489 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,585 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,585 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,585 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,585 INFO L443 ceAbstractionStarter]: For program point L1018(lines 1018 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,585 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 166) no Hoare annotation was computed. [2019-11-15 23:48:34,586 INFO L443 ceAbstractionStarter]: For program point L424(lines 424 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,586 INFO L443 ceAbstractionStarter]: For program point L1415(lines 1415 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,586 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-15 23:48:34,586 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-15 23:48:34,586 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 23:48:34,586 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-15 23:48:34,586 INFO L443 ceAbstractionStarter]: For program point L1746(lines 1746 1763) no Hoare annotation was computed. [2019-11-15 23:48:34,586 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,586 INFO L443 ceAbstractionStarter]: For program point L954(lines 954 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,586 INFO L443 ceAbstractionStarter]: For program point L888(lines 888 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,586 INFO L443 ceAbstractionStarter]: For program point L822(lines 822 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,586 INFO L443 ceAbstractionStarter]: For program point L624(lines 624 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,587 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,587 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,587 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,587 INFO L443 ceAbstractionStarter]: For program point L691(lines 691 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,587 INFO L443 ceAbstractionStarter]: For program point L1682(lines 1682 1763) no Hoare annotation was computed. [2019-11-15 23:48:34,587 INFO L443 ceAbstractionStarter]: For program point L1616(lines 1616 1763) no Hoare annotation was computed. [2019-11-15 23:48:34,587 INFO L443 ceAbstractionStarter]: For program point L1484(lines 1484 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,587 INFO L443 ceAbstractionStarter]: For program point L427(lines 427 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,587 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,587 INFO L443 ceAbstractionStarter]: For program point L1286(lines 1286 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,587 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,587 INFO L443 ceAbstractionStarter]: For program point L1220(lines 1220 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,588 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-15 23:48:34,588 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-15 23:48:34,588 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-15 23:48:34,588 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,589 INFO L443 ceAbstractionStarter]: For program point L560(lines 560 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,589 INFO L443 ceAbstractionStarter]: For program point L1353(lines 1353 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,589 INFO L443 ceAbstractionStarter]: For program point L1155(lines 1155 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,589 INFO L443 ceAbstractionStarter]: For program point L495(lines 495 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,589 INFO L443 ceAbstractionStarter]: For program point L297(lines 297 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,589 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,589 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,590 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 23:48:34,590 INFO L443 ceAbstractionStarter]: For program point L1553(lines 1553 1763) no Hoare annotation was computed. [2019-11-15 23:48:34,590 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-15 23:48:34,590 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-15 23:48:34,590 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-15 23:48:34,590 INFO L443 ceAbstractionStarter]: For program point L1025(lines 1025 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,590 INFO L443 ceAbstractionStarter]: For program point L1752(lines 1752 1763) no Hoare annotation was computed. [2019-11-15 23:48:34,591 INFO L443 ceAbstractionStarter]: For program point L1422(lines 1422 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,591 INFO L443 ceAbstractionStarter]: For program point L1092(lines 1092 1490) no Hoare annotation was computed. [2019-11-15 23:48:34,600 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,601 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,601 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,602 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,602 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,612 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,613 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,613 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,613 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,614 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,619 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,619 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,619 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,620 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,620 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,624 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,624 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,625 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,625 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,625 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,629 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,630 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,630 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,631 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,631 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,634 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,634 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,634 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,635 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,635 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:48:34 BoogieIcfgContainer [2019-11-15 23:48:34,639 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:48:34,639 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:48:34,639 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:48:34,639 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:48:34,640 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:46:13" (3/4) ... [2019-11-15 23:48:34,643 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 23:48:34,678 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-15 23:48:34,681 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 23:48:34,711 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((a16 == 8 && a15 == 4) && a18 <= 134) || ((a16 <= 11 && 4 <= a15) && a12 == 6)) || (((a15 == 4 && a16 <= 9) && a18 + 79 <= 0) && !(a12 == 8))) || (((((a15 == 4 && a16 <= 11) && (a18 + -599175) / 3 + 79 <= 0) && 5 == a12) && 0 == a18 % 3) && 0 < (a18 + -599175) / 3 + 156)) || ((3 == a15 && (\exists v_~a18~0_902 : int :: (((0 <= 9 * v_~a18~0_902 && a18 + 557770 <= v_~a18~0_902 * 9 / 10) && 0 < (v_~a18~0_902 + -599175) / 3 + 156) && (v_~a18~0_902 + -599175) / 3 + 79 <= 0) && 0 == v_~a18~0_902 % 3)) && a12 == 6)) || (((a15 == 4 && a16 <= 11) && 5 == a12) && a18 + 79 <= 0)) || ((5 == a12 && 3 == a15) && a18 <= 513056)) || ((((a16 <= 11 && !(a12 == 6)) && 3 == a15) && a18 <= 513056) && !(10 == a16))) || ((69094 <= a18 && 3 == a15) && a12 == 8)) || ((a15 == 4 && a16 == 8) && a12 == 5)) || ((12 <= a16 && 3 == a15) && !(a12 == 8))) || (((a15 == 4 && 69094 <= a18) && a16 <= 9) && 7 == a12)) || (((a15 == 4 && a16 <= 9) && a18 + 79 <= 0) && 0 < a18 + 156)) || ((((a15 == 4 && a18 <= 134) && a16 <= 9) && a12 == 8) && 0 < a18 + 79)) || ((((a16 == 8 && a15 == 4) && 69094 <= a18) && a18 <= 513056) && !(a12 == 8))) || (((3 == a15 && 134 < a18) && a12 == 6) && a18 <= 513056)) || ((a18 <= 134 && 3 == a15) && a12 == 8)) || (((a15 == 4 && a18 <= 134) && a16 <= 9) && 7 == a12)) || ((!(a12 == 6) && a16 <= 9) && 3 == a15)) || ((a16 <= 11 && 3 == a15) && a12 == 8)) || (((3 == a15 && a18 + 79 <= 0) && 0 < a18 + 156) && a12 == 6)) || (a16 == 8 && 3 == a15) [2019-11-15 23:48:34,714 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((a16 == 8 && a15 == 4) && a18 <= 134) || ((a16 <= 11 && 4 <= a15) && a12 == 6)) || (((a15 == 4 && a16 <= 9) && a18 + 79 <= 0) && !(a12 == 8))) || (((((a15 == 4 && a16 <= 11) && (a18 + -599175) / 3 + 79 <= 0) && 5 == a12) && 0 == a18 % 3) && 0 < (a18 + -599175) / 3 + 156)) || ((3 == a15 && (\exists v_~a18~0_902 : int :: (((0 <= 9 * v_~a18~0_902 && a18 + 557770 <= v_~a18~0_902 * 9 / 10) && 0 < (v_~a18~0_902 + -599175) / 3 + 156) && (v_~a18~0_902 + -599175) / 3 + 79 <= 0) && 0 == v_~a18~0_902 % 3)) && a12 == 6)) || (((a15 == 4 && a16 <= 11) && 5 == a12) && a18 + 79 <= 0)) || ((5 == a12 && 3 == a15) && a18 <= 513056)) || ((((a16 <= 11 && !(a12 == 6)) && 3 == a15) && a18 <= 513056) && !(10 == a16))) || ((69094 <= a18 && 3 == a15) && a12 == 8)) || ((a15 == 4 && a16 == 8) && a12 == 5)) || ((12 <= a16 && 3 == a15) && !(a12 == 8))) || (((a15 == 4 && 69094 <= a18) && a16 <= 9) && 7 == a12)) || (((a15 == 4 && a16 <= 9) && a18 + 79 <= 0) && 0 < a18 + 156)) || ((((a15 == 4 && a18 <= 134) && a16 <= 9) && a12 == 8) && 0 < a18 + 79)) || ((((a16 == 8 && a15 == 4) && 69094 <= a18) && a18 <= 513056) && !(a12 == 8))) || (((3 == a15 && 134 < a18) && a12 == 6) && a18 <= 513056)) || ((a18 <= 134 && 3 == a15) && a12 == 8)) || (((a15 == 4 && a18 <= 134) && a16 <= 9) && 7 == a12)) || ((!(a12 == 6) && a16 <= 9) && 3 == a15)) || ((a16 <= 11 && 3 == a15) && a12 == 8)) || (((3 == a15 && a18 + 79 <= 0) && 0 < a18 + 156) && a12 == 6)) || (a16 == 8 && 3 == a15) [2019-11-15 23:48:34,724 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((a16 == 8 && a15 == 4) && a18 <= 134) || ((a16 <= 11 && 4 <= a15) && a12 == 6)) || (((a15 == 4 && a16 <= 9) && a18 + 79 <= 0) && !(a12 == 8))) || (((((a15 == 4 && a16 <= 11) && (a18 + -599175) / 3 + 79 <= 0) && 5 == a12) && 0 == a18 % 3) && 0 < (a18 + -599175) / 3 + 156)) || ((3 == a15 && (\exists v_~a18~0_902 : int :: (((0 <= 9 * v_~a18~0_902 && a18 + 557770 <= v_~a18~0_902 * 9 / 10) && 0 < (v_~a18~0_902 + -599175) / 3 + 156) && (v_~a18~0_902 + -599175) / 3 + 79 <= 0) && 0 == v_~a18~0_902 % 3)) && a12 == 6)) || (((a15 == 4 && a16 <= 11) && 5 == a12) && a18 + 79 <= 0)) || ((((a16 <= 11 && !(a12 == 6)) && 3 == a15) && a18 <= 513056) && !(10 == a16))) || ((69094 <= a18 && 3 == a15) && a12 == 8)) || ((12 <= a16 && 3 == a15) && !(a12 == 8))) || (((a15 == 4 && 69094 <= a18) && a16 <= 9) && 7 == a12)) || ((5 == a12 && 3 == a15) && a18 <= 513056)) || (((a15 == 4 && a16 <= 9) && a18 + 79 <= 0) && 0 < a18 + 156)) || ((((a15 == 4 && a18 <= 134) && a16 <= 9) && a12 == 8) && 0 < a18 + 79)) || (((3 == a15 && 134 < a18) && a12 == 6) && a18 <= 513056)) || ((((a16 == 8 && a15 == 4) && 69094 <= a18) && a18 <= 513056) && !(a12 == 8))) || ((a18 <= 134 && 3 == a15) && a12 == 8)) || (((a15 == 4 && a18 <= 134) && a16 <= 9) && 7 == a12)) || ((!(a12 == 6) && a16 <= 9) && 3 == a15)) || ((a16 <= 11 && 3 == a15) && a12 == 8)) || (((3 == a15 && a18 + 79 <= 0) && 0 < a18 + 156) && a12 == 6)) || (a16 == 8 && 3 == a15)) || (((a15 == 4 && a16 == 8) && !(3 == input)) && a12 == 5) [2019-11-15 23:48:34,891 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_54a8d788-0ad5-4196-99b8-3d84514e908d/bin/uautomizer/witness.graphml [2019-11-15 23:48:34,892 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:48:34,893 INFO L168 Benchmark]: Toolchain (without parser) took 145039.15 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 4.0 GB). Free memory was 939.4 MB in the beginning and 2.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2019-11-15 23:48:34,893 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:48:34,894 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1090.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -129.0 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:48:34,894 INFO L168 Benchmark]: Boogie Procedure Inliner took 189.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:48:34,894 INFO L168 Benchmark]: Boogie Preprocessor took 174.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:48:34,895 INFO L168 Benchmark]: RCFGBuilder took 2523.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 25.2 MB). Peak memory consumption was 187.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:48:34,895 INFO L168 Benchmark]: TraceAbstraction took 140805.04 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.9 GB). Free memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. [2019-11-15 23:48:34,895 INFO L168 Benchmark]: Witness Printer took 252.84 ms. Allocated memory is still 5.0 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 106.8 MB). Peak memory consumption was 106.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:48:34,897 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1090.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -129.0 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 189.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 174.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2523.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 25.2 MB). Peak memory consumption was 187.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 140805.04 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.9 GB). Free memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. * Witness Printer took 252.84 ms. Allocated memory is still 5.0 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 106.8 MB). Peak memory consumption was 106.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 166]: 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: 23]: Loop Invariant [2019-11-15 23:48:34,905 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,906 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,906 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,907 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,907 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,908 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,909 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,909 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,909 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,910 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((a16 == 8 && a15 == 4) && a18 <= 134) || ((a16 <= 11 && 4 <= a15) && a12 == 6)) || (((a15 == 4 && a16 <= 9) && a18 + 79 <= 0) && !(a12 == 8))) || (((((a15 == 4 && a16 <= 11) && (a18 + -599175) / 3 + 79 <= 0) && 5 == a12) && 0 == a18 % 3) && 0 < (a18 + -599175) / 3 + 156)) || ((3 == a15 && (\exists v_~a18~0_902 : int :: (((0 <= 9 * v_~a18~0_902 && a18 + 557770 <= v_~a18~0_902 * 9 / 10) && 0 < (v_~a18~0_902 + -599175) / 3 + 156) && (v_~a18~0_902 + -599175) / 3 + 79 <= 0) && 0 == v_~a18~0_902 % 3)) && a12 == 6)) || (((a15 == 4 && a16 <= 11) && 5 == a12) && a18 + 79 <= 0)) || ((5 == a12 && 3 == a15) && a18 <= 513056)) || ((((a16 <= 11 && !(a12 == 6)) && 3 == a15) && a18 <= 513056) && !(10 == a16))) || ((69094 <= a18 && 3 == a15) && a12 == 8)) || ((a15 == 4 && a16 == 8) && a12 == 5)) || ((12 <= a16 && 3 == a15) && !(a12 == 8))) || (((a15 == 4 && 69094 <= a18) && a16 <= 9) && 7 == a12)) || (((a15 == 4 && a16 <= 9) && a18 + 79 <= 0) && 0 < a18 + 156)) || ((((a15 == 4 && a18 <= 134) && a16 <= 9) && a12 == 8) && 0 < a18 + 79)) || ((((a16 == 8 && a15 == 4) && 69094 <= a18) && a18 <= 513056) && !(a12 == 8))) || (((3 == a15 && 134 < a18) && a12 == 6) && a18 <= 513056)) || ((a18 <= 134 && 3 == a15) && a12 == 8)) || (((a15 == 4 && a18 <= 134) && a16 <= 9) && 7 == a12)) || ((!(a12 == 6) && a16 <= 9) && 3 == a15)) || ((a16 <= 11 && 3 == a15) && a12 == 8)) || (((3 == a15 && a18 + 79 <= 0) && 0 < a18 + 156) && a12 == 6)) || (a16 == 8 && 3 == a15) - InvariantResult [Line: 1494]: Loop Invariant [2019-11-15 23:48:34,911 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,912 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,912 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,912 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,913 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,914 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,914 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,915 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,915 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,915 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((a16 == 8 && a15 == 4) && a18 <= 134) || ((a16 <= 11 && 4 <= a15) && a12 == 6)) || (((a15 == 4 && a16 <= 9) && a18 + 79 <= 0) && !(a12 == 8))) || (((((a15 == 4 && a16 <= 11) && (a18 + -599175) / 3 + 79 <= 0) && 5 == a12) && 0 == a18 % 3) && 0 < (a18 + -599175) / 3 + 156)) || ((3 == a15 && (\exists v_~a18~0_902 : int :: (((0 <= 9 * v_~a18~0_902 && a18 + 557770 <= v_~a18~0_902 * 9 / 10) && 0 < (v_~a18~0_902 + -599175) / 3 + 156) && (v_~a18~0_902 + -599175) / 3 + 79 <= 0) && 0 == v_~a18~0_902 % 3)) && a12 == 6)) || (((a15 == 4 && a16 <= 11) && 5 == a12) && a18 + 79 <= 0)) || ((((a16 <= 11 && !(a12 == 6)) && 3 == a15) && a18 <= 513056) && !(10 == a16))) || ((69094 <= a18 && 3 == a15) && a12 == 8)) || ((12 <= a16 && 3 == a15) && !(a12 == 8))) || (((a15 == 4 && 69094 <= a18) && a16 <= 9) && 7 == a12)) || ((5 == a12 && 3 == a15) && a18 <= 513056)) || (((a15 == 4 && a16 <= 9) && a18 + 79 <= 0) && 0 < a18 + 156)) || ((((a15 == 4 && a18 <= 134) && a16 <= 9) && a12 == 8) && 0 < a18 + 79)) || (((3 == a15 && 134 < a18) && a12 == 6) && a18 <= 513056)) || ((((a16 == 8 && a15 == 4) && 69094 <= a18) && a18 <= 513056) && !(a12 == 8))) || ((a18 <= 134 && 3 == a15) && a12 == 8)) || (((a15 == 4 && a18 <= 134) && a16 <= 9) && 7 == a12)) || ((!(a12 == 6) && a16 <= 9) && 3 == a15)) || ((a16 <= 11 && 3 == a15) && a12 == 8)) || (((3 == a15 && a18 + 79 <= 0) && 0 < a18 + 156) && a12 == 6)) || (a16 == 8 && 3 == a15)) || (((a15 == 4 && a16 == 8) && !(3 == input)) && a12 == 5) - InvariantResult [Line: 1767]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1773]: Loop Invariant [2019-11-15 23:48:34,917 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,917 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,917 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,918 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,918 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,919 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,919 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,920 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,920 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] [2019-11-15 23:48:34,920 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_902,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((a16 == 8 && a15 == 4) && a18 <= 134) || ((a16 <= 11 && 4 <= a15) && a12 == 6)) || (((a15 == 4 && a16 <= 9) && a18 + 79 <= 0) && !(a12 == 8))) || (((((a15 == 4 && a16 <= 11) && (a18 + -599175) / 3 + 79 <= 0) && 5 == a12) && 0 == a18 % 3) && 0 < (a18 + -599175) / 3 + 156)) || ((3 == a15 && (\exists v_~a18~0_902 : int :: (((0 <= 9 * v_~a18~0_902 && a18 + 557770 <= v_~a18~0_902 * 9 / 10) && 0 < (v_~a18~0_902 + -599175) / 3 + 156) && (v_~a18~0_902 + -599175) / 3 + 79 <= 0) && 0 == v_~a18~0_902 % 3)) && a12 == 6)) || (((a15 == 4 && a16 <= 11) && 5 == a12) && a18 + 79 <= 0)) || ((5 == a12 && 3 == a15) && a18 <= 513056)) || ((((a16 <= 11 && !(a12 == 6)) && 3 == a15) && a18 <= 513056) && !(10 == a16))) || ((69094 <= a18 && 3 == a15) && a12 == 8)) || ((a15 == 4 && a16 == 8) && a12 == 5)) || ((12 <= a16 && 3 == a15) && !(a12 == 8))) || (((a15 == 4 && 69094 <= a18) && a16 <= 9) && 7 == a12)) || (((a15 == 4 && a16 <= 9) && a18 + 79 <= 0) && 0 < a18 + 156)) || ((((a15 == 4 && a18 <= 134) && a16 <= 9) && a12 == 8) && 0 < a18 + 79)) || ((((a16 == 8 && a15 == 4) && 69094 <= a18) && a18 <= 513056) && !(a12 == 8))) || (((3 == a15 && 134 < a18) && a12 == 6) && a18 <= 513056)) || ((a18 <= 134 && 3 == a15) && a12 == 8)) || (((a15 == 4 && a18 <= 134) && a16 <= 9) && 7 == a12)) || ((!(a12 == 6) && a16 <= 9) && 3 == a15)) || ((a16 <= 11 && 3 == a15) && a12 == 8)) || (((3 == a15 && a18 + 79 <= 0) && 0 < a18 + 156) && a12 == 6)) || (a16 == 8 && 3 == a15) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 396 locations, 1 error locations. Result: SAFE, OverallTime: 140.6s, OverallIterations: 19, TraceHistogramMax: 15, AutomataDifference: 62.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.4s, HoareTripleCheckerStatistics: 3713 SDtfs, 14089 SDslu, 713 SDs, 0 SdLazy, 64084 SolverSat, 3734 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 49.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12443 GetRequests, 12302 SyntacticMatches, 19 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16783occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 8924 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 308 NumberOfFragments, 1018 HoareAnnotationTreeSize, 4 FomulaSimplifications, 22748 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 4 FomulaSimplificationsInter, 7492 FormulaSimplificationTreeSizeReductionInter, 3.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 25.1s InterpolantComputationTime, 34336 NumberOfCodeBlocks, 34336 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 34309 ConstructedInterpolants, 51 QuantifiedInterpolants, 197964778 SizeOfPredicates, 4 NumberOfNonLiveVariables, 14180 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 27 InterpolantComputations, 18 PerfectInterpolantSequences, 108235/116277 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...