./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label32.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_477abee9-686b-48ae-8012-bab4e488a418/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_477abee9-686b-48ae-8012-bab4e488a418/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_477abee9-686b-48ae-8012-bab4e488a418/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_477abee9-686b-48ae-8012-bab4e488a418/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label32.c -s /tmp/vcloud-vcloud-master/worker/run_dir_477abee9-686b-48ae-8012-bab4e488a418/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_477abee9-686b-48ae-8012-bab4e488a418/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 a7f583c5696f770774eed073d41307374ee0c036 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 16:26:39,820 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:26:39,821 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:26:39,828 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:26:39,829 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:26:39,829 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:26:39,830 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:26:39,831 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:26:39,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:26:39,833 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:26:39,834 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:26:39,835 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:26:39,835 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:26:39,836 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:26:39,836 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:26:39,837 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:26:39,837 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:26:39,838 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:26:39,840 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:26:39,841 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:26:39,842 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:26:39,843 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:26:39,844 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:26:39,844 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:26:39,846 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:26:39,846 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:26:39,846 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:26:39,847 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:26:39,847 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:26:39,848 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:26:39,848 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:26:39,848 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:26:39,848 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:26:39,849 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:26:39,849 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:26:39,850 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:26:39,850 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:26:39,850 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:26:39,850 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:26:39,851 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:26:39,851 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:26:39,852 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_477abee9-686b-48ae-8012-bab4e488a418/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 16:26:39,861 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:26:39,861 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:26:39,862 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 16:26:39,862 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 16:26:39,862 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 16:26:39,863 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:26:39,863 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:26:39,863 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:26:39,863 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:26:39,863 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:26:39,863 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:26:39,863 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:26:39,864 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:26:39,864 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:26:39,864 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:26:39,864 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:26:39,864 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:26:39,864 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:26:39,864 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 16:26:39,864 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:26:39,865 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:26:39,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:26:39,865 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:26:39,865 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:26:39,865 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:26:39,865 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 16:26:39,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:26:39,865 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:26:39,865 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:26:39,866 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_477abee9-686b-48ae-8012-bab4e488a418/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 -> a7f583c5696f770774eed073d41307374ee0c036 [2019-12-07 16:26:39,964 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:26:39,971 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:26:39,973 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:26:39,974 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:26:39,974 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:26:39,975 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_477abee9-686b-48ae-8012-bab4e488a418/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem15_label32.c [2019-12-07 16:26:40,011 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_477abee9-686b-48ae-8012-bab4e488a418/bin/uautomizer/data/75b3cee6b/5a37504327e74420a88a308c1a127e70/FLAG2341d242d [2019-12-07 16:26:40,553 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:26:40,553 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_477abee9-686b-48ae-8012-bab4e488a418/sv-benchmarks/c/eca-rers2012/Problem15_label32.c [2019-12-07 16:26:40,566 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_477abee9-686b-48ae-8012-bab4e488a418/bin/uautomizer/data/75b3cee6b/5a37504327e74420a88a308c1a127e70/FLAG2341d242d [2019-12-07 16:26:40,995 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_477abee9-686b-48ae-8012-bab4e488a418/bin/uautomizer/data/75b3cee6b/5a37504327e74420a88a308c1a127e70 [2019-12-07 16:26:40,997 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:26:40,998 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:26:40,998 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:26:40,999 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:26:41,001 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:26:41,001 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:26:40" (1/1) ... [2019-12-07 16:26:41,003 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@189bcb43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:26:41, skipping insertion in model container [2019-12-07 16:26:41,003 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:26:40" (1/1) ... [2019-12-07 16:26:41,008 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:26:41,059 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:26:41,486 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:26:41,489 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:26:41,685 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:26:41,696 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:26:41,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:26:41 WrapperNode [2019-12-07 16:26:41,697 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:26:41,697 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:26:41,697 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:26:41,697 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:26:41,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:26:41" (1/1) ... [2019-12-07 16:26:41,723 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:26:41" (1/1) ... [2019-12-07 16:26:41,809 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:26:41,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:26:41,810 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:26:41,810 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:26:41,816 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:26:41" (1/1) ... [2019-12-07 16:26:41,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:26:41" (1/1) ... [2019-12-07 16:26:41,827 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:26:41" (1/1) ... [2019-12-07 16:26:41,827 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:26:41" (1/1) ... [2019-12-07 16:26:41,884 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:26:41" (1/1) ... [2019-12-07 16:26:41,893 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:26:41" (1/1) ... [2019-12-07 16:26:41,919 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:26:41" (1/1) ... [2019-12-07 16:26:41,942 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:26:41,942 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:26:41,942 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:26:41,942 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:26:41,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:26:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_477abee9-686b-48ae-8012-bab4e488a418/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-12-07 16:26:41,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:26:41,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:26:43,787 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:26:43,788 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-07 16:26:43,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:26:43 BoogieIcfgContainer [2019-12-07 16:26:43,789 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:26:43,789 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:26:43,789 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:26:43,791 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:26:43,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:26:40" (1/3) ... [2019-12-07 16:26:43,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2307fbba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:26:43, skipping insertion in model container [2019-12-07 16:26:43,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:26:41" (2/3) ... [2019-12-07 16:26:43,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2307fbba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:26:43, skipping insertion in model container [2019-12-07 16:26:43,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:26:43" (3/3) ... [2019-12-07 16:26:43,793 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label32.c [2019-12-07 16:26:43,799 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:26:43,804 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 16:26:43,811 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 16:26:43,829 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:26:43,829 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:26:43,829 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:26:43,830 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:26:43,830 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:26:43,830 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:26:43,830 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:26:43,830 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:26:43,846 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-12-07 16:26:43,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 16:26:43,851 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:26:43,852 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:26:43,852 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:26:43,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:26:43,856 INFO L82 PathProgramCache]: Analyzing trace with hash 301649817, now seen corresponding path program 1 times [2019-12-07 16:26:43,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:26:43,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179403511] [2019-12-07 16:26:43,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:26:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:26:44,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:26:44,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179403511] [2019-12-07 16:26:44,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:26:44,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:26:44,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643079787] [2019-12-07 16:26:44,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:26:44,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:26:44,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:26:44,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:26:44,044 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-12-07 16:26:47,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:26:47,484 INFO L93 Difference]: Finished difference Result 1466 states and 2714 transitions. [2019-12-07 16:26:47,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:26:47,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-12-07 16:26:47,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:26:47,500 INFO L225 Difference]: With dead ends: 1466 [2019-12-07 16:26:47,500 INFO L226 Difference]: Without dead ends: 975 [2019-12-07 16:26:47,504 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:26:47,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2019-12-07 16:26:47,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 973. [2019-12-07 16:26:47,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 973 states. [2019-12-07 16:26:47,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1485 transitions. [2019-12-07 16:26:47,567 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1485 transitions. Word has length 49 [2019-12-07 16:26:47,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:26:47,568 INFO L462 AbstractCegarLoop]: Abstraction has 973 states and 1485 transitions. [2019-12-07 16:26:47,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:26:47,568 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1485 transitions. [2019-12-07 16:26:47,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-12-07 16:26:47,574 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:26:47,575 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 16:26:47,575 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:26:47,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:26:47,575 INFO L82 PathProgramCache]: Analyzing trace with hash -602741442, now seen corresponding path program 1 times [2019-12-07 16:26:47,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:26:47,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62674669] [2019-12-07 16:26:47,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:26:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:26:47,745 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:26:47,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62674669] [2019-12-07 16:26:47,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:26:47,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:26:47,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409926533] [2019-12-07 16:26:47,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:26:47,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:26:47,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:26:47,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:26:47,748 INFO L87 Difference]: Start difference. First operand 973 states and 1485 transitions. Second operand 4 states. [2019-12-07 16:26:49,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:26:49,866 INFO L93 Difference]: Finished difference Result 3745 states and 5745 transitions. [2019-12-07 16:26:49,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:26:49,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-12-07 16:26:49,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:26:49,877 INFO L225 Difference]: With dead ends: 3745 [2019-12-07 16:26:49,878 INFO L226 Difference]: Without dead ends: 2774 [2019-12-07 16:26:49,879 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:26:49,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states. [2019-12-07 16:26:49,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 1871. [2019-12-07 16:26:49,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1871 states. [2019-12-07 16:26:49,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1871 states and 2498 transitions. [2019-12-07 16:26:49,912 INFO L78 Accepts]: Start accepts. Automaton has 1871 states and 2498 transitions. Word has length 161 [2019-12-07 16:26:49,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:26:49,912 INFO L462 AbstractCegarLoop]: Abstraction has 1871 states and 2498 transitions. [2019-12-07 16:26:49,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:26:49,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2498 transitions. [2019-12-07 16:26:49,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-12-07 16:26:49,916 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:26:49,917 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 16:26:49,917 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:26:49,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:26:49,917 INFO L82 PathProgramCache]: Analyzing trace with hash 172169868, now seen corresponding path program 1 times [2019-12-07 16:26:49,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:26:49,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091000486] [2019-12-07 16:26:49,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:26:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:26:50,316 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-12-07 16:26:50,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091000486] [2019-12-07 16:26:50,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:26:50,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:26:50,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180930411] [2019-12-07 16:26:50,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:26:50,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:26:50,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:26:50,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:26:50,318 INFO L87 Difference]: Start difference. First operand 1871 states and 2498 transitions. Second operand 5 states. [2019-12-07 16:26:53,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:26:53,265 INFO L93 Difference]: Finished difference Result 4639 states and 5973 transitions. [2019-12-07 16:26:53,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:26:53,266 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 321 [2019-12-07 16:26:53,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:26:53,276 INFO L225 Difference]: With dead ends: 4639 [2019-12-07 16:26:53,276 INFO L226 Difference]: Without dead ends: 2770 [2019-12-07 16:26:53,278 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:26:53,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2770 states. [2019-12-07 16:26:53,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2770 to 2470. [2019-12-07 16:26:53,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2470 states. [2019-12-07 16:26:53,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2470 states to 2470 states and 3139 transitions. [2019-12-07 16:26:53,310 INFO L78 Accepts]: Start accepts. Automaton has 2470 states and 3139 transitions. Word has length 321 [2019-12-07 16:26:53,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:26:53,311 INFO L462 AbstractCegarLoop]: Abstraction has 2470 states and 3139 transitions. [2019-12-07 16:26:53,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:26:53,311 INFO L276 IsEmpty]: Start isEmpty. Operand 2470 states and 3139 transitions. [2019-12-07 16:26:53,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2019-12-07 16:26:53,315 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:26:53,315 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 16:26:53,316 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:26:53,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:26:53,316 INFO L82 PathProgramCache]: Analyzing trace with hash 591064250, now seen corresponding path program 1 times [2019-12-07 16:26:53,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:26:53,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410786521] [2019-12-07 16:26:53,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:26:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:26:53,932 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 86 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:26:53,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410786521] [2019-12-07 16:26:53,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399847387] [2019-12-07 16:26:53,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_477abee9-686b-48ae-8012-bab4e488a418/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-12-07 16:26:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:26:54,032 INFO L264 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 16:26:54,044 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:26:54,198 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:26:54,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 16:26:54,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2019-12-07 16:26:54,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117984427] [2019-12-07 16:26:54,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:26:54,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:26:54,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:26:54,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-07 16:26:54,200 INFO L87 Difference]: Start difference. First operand 2470 states and 3139 transitions. Second operand 3 states. [2019-12-07 16:26:55,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:26:55,708 INFO L93 Difference]: Finished difference Result 5547 states and 7133 transitions. [2019-12-07 16:26:55,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:26:55,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 395 [2019-12-07 16:26:55,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:26:55,719 INFO L225 Difference]: With dead ends: 5547 [2019-12-07 16:26:55,719 INFO L226 Difference]: Without dead ends: 3079 [2019-12-07 16:26:55,722 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 395 SyntacticMatches, 9 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-07 16:26:55,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3079 states. [2019-12-07 16:26:55,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3079 to 3077. [2019-12-07 16:26:55,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3077 states. [2019-12-07 16:26:55,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3077 states to 3077 states and 3865 transitions. [2019-12-07 16:26:55,763 INFO L78 Accepts]: Start accepts. Automaton has 3077 states and 3865 transitions. Word has length 395 [2019-12-07 16:26:55,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:26:55,764 INFO L462 AbstractCegarLoop]: Abstraction has 3077 states and 3865 transitions. [2019-12-07 16:26:55,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:26:55,764 INFO L276 IsEmpty]: Start isEmpty. Operand 3077 states and 3865 transitions. [2019-12-07 16:26:55,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-12-07 16:26:55,769 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:26:55,769 INFO L410 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, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 16:26:55,970 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:26:55,970 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:26:55,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:26:55,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1003761663, now seen corresponding path program 1 times [2019-12-07 16:26:55,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:26:55,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673019247] [2019-12-07 16:26:55,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:26:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:26:56,648 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 331 proven. 3 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-12-07 16:26:56,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673019247] [2019-12-07 16:26:56,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753790433] [2019-12-07 16:26:56,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_477abee9-686b-48ae-8012-bab4e488a418/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-12-07 16:26:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:26:56,740 INFO L264 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 16:26:56,746 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:26:56,835 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-12-07 16:26:56,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 16:26:56,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-12-07 16:26:56,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789165027] [2019-12-07 16:26:56,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:26:56,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:26:56,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:26:56,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:26:56,837 INFO L87 Difference]: Start difference. First operand 3077 states and 3865 transitions. Second operand 3 states. [2019-12-07 16:26:59,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:26:59,095 INFO L93 Difference]: Finished difference Result 6750 states and 8572 transitions. [2019-12-07 16:26:59,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:26:59,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 412 [2019-12-07 16:26:59,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:26:59,108 INFO L225 Difference]: With dead ends: 6750 [2019-12-07 16:26:59,108 INFO L226 Difference]: Without dead ends: 3675 [2019-12-07 16:26:59,111 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 411 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:26:59,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3675 states. [2019-12-07 16:26:59,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3675 to 3675. [2019-12-07 16:26:59,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3675 states. [2019-12-07 16:26:59,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3675 states to 3675 states and 4637 transitions. [2019-12-07 16:26:59,176 INFO L78 Accepts]: Start accepts. Automaton has 3675 states and 4637 transitions. Word has length 412 [2019-12-07 16:26:59,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:26:59,177 INFO L462 AbstractCegarLoop]: Abstraction has 3675 states and 4637 transitions. [2019-12-07 16:26:59,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:26:59,177 INFO L276 IsEmpty]: Start isEmpty. Operand 3675 states and 4637 transitions. [2019-12-07 16:26:59,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2019-12-07 16:26:59,180 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:26:59,181 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 16:26:59,381 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:26:59,382 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:26:59,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:26:59,382 INFO L82 PathProgramCache]: Analyzing trace with hash 728013481, now seen corresponding path program 1 times [2019-12-07 16:26:59,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:26:59,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724137833] [2019-12-07 16:26:59,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:26:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:26:59,835 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2019-12-07 16:26:59,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724137833] [2019-12-07 16:26:59,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045664787] [2019-12-07 16:26:59,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_477abee9-686b-48ae-8012-bab4e488a418/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-12-07 16:26:59,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:26:59,934 INFO L264 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 16:26:59,938 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:27:00,262 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2019-12-07 16:27:00,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 16:27:00,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2019-12-07 16:27:00,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864504750] [2019-12-07 16:27:00,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:27:00,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:27:00,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:27:00,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:27:00,264 INFO L87 Difference]: Start difference. First operand 3675 states and 4637 transitions. Second operand 3 states. [2019-12-07 16:27:01,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:27:01,673 INFO L93 Difference]: Finished difference Result 9146 states and 11374 transitions. [2019-12-07 16:27:01,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:27:01,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 508 [2019-12-07 16:27:01,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:27:01,691 INFO L225 Difference]: With dead ends: 9146 [2019-12-07 16:27:01,691 INFO L226 Difference]: Without dead ends: 5473 [2019-12-07 16:27:01,694 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 508 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-12-07 16:27:01,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5473 states. [2019-12-07 16:27:01,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5473 to 5172. [2019-12-07 16:27:01,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5172 states. [2019-12-07 16:27:01,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5172 states to 5172 states and 6291 transitions. [2019-12-07 16:27:01,744 INFO L78 Accepts]: Start accepts. Automaton has 5172 states and 6291 transitions. Word has length 508 [2019-12-07 16:27:01,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:27:01,745 INFO L462 AbstractCegarLoop]: Abstraction has 5172 states and 6291 transitions. [2019-12-07 16:27:01,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:27:01,745 INFO L276 IsEmpty]: Start isEmpty. Operand 5172 states and 6291 transitions. [2019-12-07 16:27:01,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2019-12-07 16:27:01,749 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:27:01,750 INFO L410 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 16:27:01,950 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:27:01,950 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:27:01,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:27:01,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1513408573, now seen corresponding path program 1 times [2019-12-07 16:27:01,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:27:01,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429486606] [2019-12-07 16:27:01,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:27:01,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:27:02,203 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2019-12-07 16:27:02,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429486606] [2019-12-07 16:27:02,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:27:02,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:27:02,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074583419] [2019-12-07 16:27:02,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:27:02,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:27:02,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:27:02,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:27:02,205 INFO L87 Difference]: Start difference. First operand 5172 states and 6291 transitions. Second operand 3 states. [2019-12-07 16:27:04,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:27:04,221 INFO L93 Difference]: Finished difference Result 13927 states and 17103 transitions. [2019-12-07 16:27:04,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:27:04,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 523 [2019-12-07 16:27:04,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:27:04,249 INFO L225 Difference]: With dead ends: 13927 [2019-12-07 16:27:04,249 INFO L226 Difference]: Without dead ends: 8757 [2019-12-07 16:27:04,252 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:27:04,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8757 states. [2019-12-07 16:27:04,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8757 to 5765. [2019-12-07 16:27:04,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5765 states. [2019-12-07 16:27:04,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5765 states to 5765 states and 7156 transitions. [2019-12-07 16:27:04,309 INFO L78 Accepts]: Start accepts. Automaton has 5765 states and 7156 transitions. Word has length 523 [2019-12-07 16:27:04,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:27:04,310 INFO L462 AbstractCegarLoop]: Abstraction has 5765 states and 7156 transitions. [2019-12-07 16:27:04,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:27:04,310 INFO L276 IsEmpty]: Start isEmpty. Operand 5765 states and 7156 transitions. [2019-12-07 16:27:04,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2019-12-07 16:27:04,314 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:27:04,314 INFO L410 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 16:27:04,314 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:27:04,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:27:04,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1542699677, now seen corresponding path program 1 times [2019-12-07 16:27:04,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:27:04,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922766000] [2019-12-07 16:27:04,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:27:04,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:27:04,918 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 297 proven. 134 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 16:27:04,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922766000] [2019-12-07 16:27:04,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045676110] [2019-12-07 16:27:04,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_477abee9-686b-48ae-8012-bab4e488a418/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-12-07 16:27:05,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:27:05,055 INFO L264 TraceCheckSpWp]: Trace formula consists of 654 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 16:27:05,059 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:27:05,203 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 364 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-12-07 16:27:05,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 16:27:05,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-12-07 16:27:05,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139759832] [2019-12-07 16:27:05,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:27:05,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:27:05,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:27:05,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:27:05,205 INFO L87 Difference]: Start difference. First operand 5765 states and 7156 transitions. Second operand 3 states. [2019-12-07 16:27:06,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:27:06,463 INFO L93 Difference]: Finished difference Result 11529 states and 14313 transitions. [2019-12-07 16:27:06,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:27:06,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 546 [2019-12-07 16:27:06,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:27:06,475 INFO L225 Difference]: With dead ends: 11529 [2019-12-07 16:27:06,475 INFO L226 Difference]: Without dead ends: 5766 [2019-12-07 16:27:06,480 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 559 GetRequests, 547 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:27:06,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5766 states. [2019-12-07 16:27:06,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5766 to 5765. [2019-12-07 16:27:06,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5765 states. [2019-12-07 16:27:06,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5765 states to 5765 states and 6711 transitions. [2019-12-07 16:27:06,537 INFO L78 Accepts]: Start accepts. Automaton has 5765 states and 6711 transitions. Word has length 546 [2019-12-07 16:27:06,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:27:06,538 INFO L462 AbstractCegarLoop]: Abstraction has 5765 states and 6711 transitions. [2019-12-07 16:27:06,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:27:06,538 INFO L276 IsEmpty]: Start isEmpty. Operand 5765 states and 6711 transitions. [2019-12-07 16:27:06,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2019-12-07 16:27:06,542 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:27:06,542 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 16:27:06,743 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:27:06,743 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:27:06,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:27:06,744 INFO L82 PathProgramCache]: Analyzing trace with hash 737054137, now seen corresponding path program 1 times [2019-12-07 16:27:06,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:27:06,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063181214] [2019-12-07 16:27:06,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:27:06,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:27:07,666 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 585 proven. 3 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2019-12-07 16:27:07,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063181214] [2019-12-07 16:27:07,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803977831] [2019-12-07 16:27:07,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_477abee9-686b-48ae-8012-bab4e488a418/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-12-07 16:27:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:27:07,773 INFO L264 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 16:27:07,777 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:27:07,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:27:08,131 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 549 proven. 39 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2019-12-07 16:27:08,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:27:08,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-12-07 16:27:08,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83674184] [2019-12-07 16:27:08,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 16:27:08,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:27:08,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 16:27:08,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:27:08,133 INFO L87 Difference]: Start difference. First operand 5765 states and 6711 transitions. Second operand 9 states. [2019-12-07 16:27:15,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:27:15,079 INFO L93 Difference]: Finished difference Result 16467 states and 18955 transitions. [2019-12-07 16:27:15,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 16:27:15,079 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 576 [2019-12-07 16:27:15,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:27:15,088 INFO L225 Difference]: With dead ends: 16467 [2019-12-07 16:27:15,088 INFO L226 Difference]: Without dead ends: 7558 [2019-12-07 16:27:15,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 587 GetRequests, 574 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-12-07 16:27:15,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7558 states. [2019-12-07 16:27:15,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7558 to 7258. [2019-12-07 16:27:15,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7258 states. [2019-12-07 16:27:15,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7258 states to 7258 states and 7732 transitions. [2019-12-07 16:27:15,160 INFO L78 Accepts]: Start accepts. Automaton has 7258 states and 7732 transitions. Word has length 576 [2019-12-07 16:27:15,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:27:15,160 INFO L462 AbstractCegarLoop]: Abstraction has 7258 states and 7732 transitions. [2019-12-07 16:27:15,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 16:27:15,161 INFO L276 IsEmpty]: Start isEmpty. Operand 7258 states and 7732 transitions. [2019-12-07 16:27:15,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2019-12-07 16:27:15,164 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:27:15,164 INFO L410 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 16:27:15,364 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:27:15,365 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:27:15,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:27:15,365 INFO L82 PathProgramCache]: Analyzing trace with hash 766630606, now seen corresponding path program 1 times [2019-12-07 16:27:15,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:27:15,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236096087] [2019-12-07 16:27:15,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:27:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:27:15,686 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 396 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-12-07 16:27:15,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236096087] [2019-12-07 16:27:15,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:27:15,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:27:15,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323600142] [2019-12-07 16:27:15,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:27:15,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:27:15,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:27:15,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:27:15,688 INFO L87 Difference]: Start difference. First operand 7258 states and 7732 transitions. Second operand 3 states. [2019-12-07 16:27:16,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:27:16,619 INFO L93 Difference]: Finished difference Result 17505 states and 18653 transitions. [2019-12-07 16:27:16,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:27:16,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 576 [2019-12-07 16:27:16,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:27:16,630 INFO L225 Difference]: With dead ends: 17505 [2019-12-07 16:27:16,631 INFO L226 Difference]: Without dead ends: 10249 [2019-12-07 16:27:16,636 INFO L630 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-12-07 16:27:16,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10249 states. [2019-12-07 16:27:16,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10249 to 9053. [2019-12-07 16:27:16,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9053 states. [2019-12-07 16:27:16,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9053 states to 9053 states and 9641 transitions. [2019-12-07 16:27:16,768 INFO L78 Accepts]: Start accepts. Automaton has 9053 states and 9641 transitions. Word has length 576 [2019-12-07 16:27:16,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:27:16,769 INFO L462 AbstractCegarLoop]: Abstraction has 9053 states and 9641 transitions. [2019-12-07 16:27:16,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:27:16,769 INFO L276 IsEmpty]: Start isEmpty. Operand 9053 states and 9641 transitions. [2019-12-07 16:27:16,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2019-12-07 16:27:16,772 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:27:16,772 INFO L410 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, 3, 3, 3, 3, 3, 3, 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, 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] [2019-12-07 16:27:16,772 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:27:16,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:27:16,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1687499565, now seen corresponding path program 1 times [2019-12-07 16:27:16,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:27:16,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292733474] [2019-12-07 16:27:16,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:27:16,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:27:18,425 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 151 proven. 328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:27:18,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292733474] [2019-12-07 16:27:18,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932321020] [2019-12-07 16:27:18,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_477abee9-686b-48ae-8012-bab4e488a418/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-12-07 16:27:18,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:27:18,535 INFO L264 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 16:27:18,540 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:27:18,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:27:18,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:27:18,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:27:18,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:27:18,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:27:18,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:27:18,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:27:18,877 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 244 proven. 47 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-12-07 16:27:18,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:27:18,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4] total 13 [2019-12-07 16:27:18,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126182725] [2019-12-07 16:27:18,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 16:27:18,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:27:18,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 16:27:18,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-07 16:27:18,880 INFO L87 Difference]: Start difference. First operand 9053 states and 9641 transitions. Second operand 13 states. [2019-12-07 16:27:31,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:27:31,291 INFO L93 Difference]: Finished difference Result 29822 states and 31778 transitions. [2019-12-07 16:27:31,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 16:27:31,291 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 584 [2019-12-07 16:27:31,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:27:31,305 INFO L225 Difference]: With dead ends: 29822 [2019-12-07 16:27:31,305 INFO L226 Difference]: Without dead ends: 19874 [2019-12-07 16:27:31,313 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 596 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=655, Unknown=0, NotChecked=0, Total=812 [2019-12-07 16:27:31,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19874 states. [2019-12-07 16:27:31,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19874 to 16842. [2019-12-07 16:27:31,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16842 states. [2019-12-07 16:27:31,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16842 states to 16842 states and 17643 transitions. [2019-12-07 16:27:31,447 INFO L78 Accepts]: Start accepts. Automaton has 16842 states and 17643 transitions. Word has length 584 [2019-12-07 16:27:31,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:27:31,448 INFO L462 AbstractCegarLoop]: Abstraction has 16842 states and 17643 transitions. [2019-12-07 16:27:31,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 16:27:31,448 INFO L276 IsEmpty]: Start isEmpty. Operand 16842 states and 17643 transitions. [2019-12-07 16:27:31,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 683 [2019-12-07 16:27:31,454 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:27:31,455 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 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] [2019-12-07 16:27:31,655 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:27:31,656 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:27:31,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:27:31,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1622617196, now seen corresponding path program 1 times [2019-12-07 16:27:31,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:27:31,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804505606] [2019-12-07 16:27:31,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:27:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:27:32,061 INFO L134 CoverageAnalysis]: Checked inductivity of 863 backedges. 529 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2019-12-07 16:27:32,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804505606] [2019-12-07 16:27:32,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:27:32,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:27:32,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389641695] [2019-12-07 16:27:32,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:27:32,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:27:32,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:27:32,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:27:32,063 INFO L87 Difference]: Start difference. First operand 16842 states and 17643 transitions. Second operand 5 states. [2019-12-07 16:27:34,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:27:34,348 INFO L93 Difference]: Finished difference Result 29152 states and 30562 transitions. [2019-12-07 16:27:34,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:27:34,350 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 682 [2019-12-07 16:27:34,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:27:34,365 INFO L225 Difference]: With dead ends: 29152 [2019-12-07 16:27:34,365 INFO L226 Difference]: Without dead ends: 14108 [2019-12-07 16:27:34,375 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-12-07 16:27:34,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14108 states. [2019-12-07 16:27:34,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14108 to 10512. [2019-12-07 16:27:34,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10512 states. [2019-12-07 16:27:34,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10512 states to 10512 states and 10861 transitions. [2019-12-07 16:27:34,458 INFO L78 Accepts]: Start accepts. Automaton has 10512 states and 10861 transitions. Word has length 682 [2019-12-07 16:27:34,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:27:34,458 INFO L462 AbstractCegarLoop]: Abstraction has 10512 states and 10861 transitions. [2019-12-07 16:27:34,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:27:34,458 INFO L276 IsEmpty]: Start isEmpty. Operand 10512 states and 10861 transitions. [2019-12-07 16:27:34,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 753 [2019-12-07 16:27:34,467 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:27:34,467 INFO L410 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 16:27:34,467 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:27:34,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:27:34,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1427691895, now seen corresponding path program 1 times [2019-12-07 16:27:34,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:27:34,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648065876] [2019-12-07 16:27:34,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:27:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:27:34,958 INFO L134 CoverageAnalysis]: Checked inductivity of 913 backedges. 566 proven. 0 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2019-12-07 16:27:34,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648065876] [2019-12-07 16:27:34,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:27:34,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:27:34,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910751598] [2019-12-07 16:27:34,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:27:34,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:27:34,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:27:34,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:27:34,959 INFO L87 Difference]: Start difference. First operand 10512 states and 10861 transitions. Second operand 5 states. [2019-12-07 16:27:36,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:27:36,359 INFO L93 Difference]: Finished difference Result 15315 states and 15856 transitions. [2019-12-07 16:27:36,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:27:36,360 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 752 [2019-12-07 16:27:36,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:27:36,373 INFO L225 Difference]: With dead ends: 15315 [2019-12-07 16:27:36,373 INFO L226 Difference]: Without dead ends: 15313 [2019-12-07 16:27:36,375 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-12-07 16:27:36,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15313 states. [2019-12-07 16:27:36,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15313 to 12316. [2019-12-07 16:27:36,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12316 states. [2019-12-07 16:27:36,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12316 states to 12316 states and 12759 transitions. [2019-12-07 16:27:36,471 INFO L78 Accepts]: Start accepts. Automaton has 12316 states and 12759 transitions. Word has length 752 [2019-12-07 16:27:36,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:27:36,471 INFO L462 AbstractCegarLoop]: Abstraction has 12316 states and 12759 transitions. [2019-12-07 16:27:36,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:27:36,471 INFO L276 IsEmpty]: Start isEmpty. Operand 12316 states and 12759 transitions. [2019-12-07 16:27:36,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 838 [2019-12-07 16:27:36,482 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:27:36,483 INFO L410 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 16:27:36,483 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:27:36,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:27:36,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1048499012, now seen corresponding path program 1 times [2019-12-07 16:27:36,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:27:36,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44934186] [2019-12-07 16:27:36,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:27:36,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:27:36,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1029 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 842 trivial. 0 not checked. [2019-12-07 16:27:36,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44934186] [2019-12-07 16:27:36,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:27:36,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:27:36,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145076731] [2019-12-07 16:27:36,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:27:36,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:27:36,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:27:36,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:27:36,984 INFO L87 Difference]: Start difference. First operand 12316 states and 12759 transitions. Second operand 3 states. [2019-12-07 16:27:37,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:27:37,669 INFO L93 Difference]: Finished difference Result 23430 states and 24303 transitions. [2019-12-07 16:27:37,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:27:37,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 837 [2019-12-07 16:27:37,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:27:37,678 INFO L225 Difference]: With dead ends: 23430 [2019-12-07 16:27:37,678 INFO L226 Difference]: Without dead ends: 12912 [2019-12-07 16:27:37,682 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:27:37,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12912 states. [2019-12-07 16:27:37,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12912 to 11114. [2019-12-07 16:27:37,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11114 states. [2019-12-07 16:27:37,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11114 states to 11114 states and 11417 transitions. [2019-12-07 16:27:37,757 INFO L78 Accepts]: Start accepts. Automaton has 11114 states and 11417 transitions. Word has length 837 [2019-12-07 16:27:37,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:27:37,758 INFO L462 AbstractCegarLoop]: Abstraction has 11114 states and 11417 transitions. [2019-12-07 16:27:37,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:27:37,758 INFO L276 IsEmpty]: Start isEmpty. Operand 11114 states and 11417 transitions. [2019-12-07 16:27:37,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 842 [2019-12-07 16:27:37,768 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:27:37,768 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 16:27:37,768 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:27:37,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:27:37,769 INFO L82 PathProgramCache]: Analyzing trace with hash 859414251, now seen corresponding path program 1 times [2019-12-07 16:27:37,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:27:37,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817255229] [2019-12-07 16:27:37,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:27:37,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:27:38,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 593 proven. 0 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2019-12-07 16:27:38,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817255229] [2019-12-07 16:27:38,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:27:38,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:27:38,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955478949] [2019-12-07 16:27:38,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:27:38,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:27:38,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:27:38,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:27:38,271 INFO L87 Difference]: Start difference. First operand 11114 states and 11417 transitions. Second operand 4 states. [2019-12-07 16:27:39,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:27:39,242 INFO L93 Difference]: Finished difference Result 21631 states and 22229 transitions. [2019-12-07 16:27:39,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:27:39,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 841 [2019-12-07 16:27:39,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:27:39,250 INFO L225 Difference]: With dead ends: 21631 [2019-12-07 16:27:39,250 INFO L226 Difference]: Without dead ends: 11117 [2019-12-07 16:27:39,253 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:27:39,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11117 states. [2019-12-07 16:27:39,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11117 to 10815. [2019-12-07 16:27:39,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10815 states. [2019-12-07 16:27:39,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10815 states to 10815 states and 11056 transitions. [2019-12-07 16:27:39,340 INFO L78 Accepts]: Start accepts. Automaton has 10815 states and 11056 transitions. Word has length 841 [2019-12-07 16:27:39,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:27:39,341 INFO L462 AbstractCegarLoop]: Abstraction has 10815 states and 11056 transitions. [2019-12-07 16:27:39,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:27:39,341 INFO L276 IsEmpty]: Start isEmpty. Operand 10815 states and 11056 transitions. [2019-12-07 16:27:39,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 971 [2019-12-07 16:27:39,352 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:27:39,353 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:27:39,353 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:27:39,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:27:39,353 INFO L82 PathProgramCache]: Analyzing trace with hash -2128403174, now seen corresponding path program 1 times [2019-12-07 16:27:39,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:27:39,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973441211] [2019-12-07 16:27:39,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:27:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:27:39,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 636 proven. 0 refuted. 0 times theorem prover too weak. 699 trivial. 0 not checked. [2019-12-07 16:27:39,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973441211] [2019-12-07 16:27:39,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:27:39,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:27:39,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652884354] [2019-12-07 16:27:39,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:27:39,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:27:39,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:27:39,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:27:39,956 INFO L87 Difference]: Start difference. First operand 10815 states and 11056 transitions. Second operand 3 states. [2019-12-07 16:27:40,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:27:40,661 INFO L93 Difference]: Finished difference Result 25823 states and 26410 transitions. [2019-12-07 16:27:40,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:27:40,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 970 [2019-12-07 16:27:40,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:27:40,671 INFO L225 Difference]: With dead ends: 25823 [2019-12-07 16:27:40,671 INFO L226 Difference]: Without dead ends: 15309 [2019-12-07 16:27:40,676 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:27:40,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15309 states. [2019-12-07 16:27:40,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15309 to 14105. [2019-12-07 16:27:40,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14105 states. [2019-12-07 16:27:40,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14105 states to 14105 states and 14381 transitions. [2019-12-07 16:27:40,782 INFO L78 Accepts]: Start accepts. Automaton has 14105 states and 14381 transitions. Word has length 970 [2019-12-07 16:27:40,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:27:40,783 INFO L462 AbstractCegarLoop]: Abstraction has 14105 states and 14381 transitions. [2019-12-07 16:27:40,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:27:40,783 INFO L276 IsEmpty]: Start isEmpty. Operand 14105 states and 14381 transitions. [2019-12-07 16:27:40,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1045 [2019-12-07 16:27:40,800 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:27:40,801 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 16:27:40,801 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:27:40,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:27:40,801 INFO L82 PathProgramCache]: Analyzing trace with hash 738593332, now seen corresponding path program 1 times [2019-12-07 16:27:40,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:27:40,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329723528] [2019-12-07 16:27:40,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:27:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:27:41,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1660 backedges. 1069 proven. 0 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2019-12-07 16:27:41,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329723528] [2019-12-07 16:27:41,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:27:41,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:27:41,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390608350] [2019-12-07 16:27:41,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:27:41,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:27:41,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:27:41,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:27:41,474 INFO L87 Difference]: Start difference. First operand 14105 states and 14381 transitions. Second operand 3 states. [2019-12-07 16:27:42,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:27:42,190 INFO L93 Difference]: Finished difference Result 27610 states and 28156 transitions. [2019-12-07 16:27:42,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:27:42,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1044 [2019-12-07 16:27:42,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:27:42,199 INFO L225 Difference]: With dead ends: 27610 [2019-12-07 16:27:42,199 INFO L226 Difference]: Without dead ends: 14105 [2019-12-07 16:27:42,205 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:27:42,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14105 states. [2019-12-07 16:27:42,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14105 to 12002. [2019-12-07 16:27:42,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12002 states. [2019-12-07 16:27:42,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12002 states to 12002 states and 12217 transitions. [2019-12-07 16:27:42,293 INFO L78 Accepts]: Start accepts. Automaton has 12002 states and 12217 transitions. Word has length 1044 [2019-12-07 16:27:42,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:27:42,294 INFO L462 AbstractCegarLoop]: Abstraction has 12002 states and 12217 transitions. [2019-12-07 16:27:42,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:27:42,294 INFO L276 IsEmpty]: Start isEmpty. Operand 12002 states and 12217 transitions. [2019-12-07 16:27:42,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1128 [2019-12-07 16:27:42,308 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:27:42,309 INFO L410 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 16:27:42,309 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:27:42,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:27:42,309 INFO L82 PathProgramCache]: Analyzing trace with hash -690998195, now seen corresponding path program 1 times [2019-12-07 16:27:42,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:27:42,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353281809] [2019-12-07 16:27:42,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:27:42,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:27:44,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2394 backedges. 94 proven. 1121 refuted. 0 times theorem prover too weak. 1179 trivial. 0 not checked. [2019-12-07 16:27:44,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353281809] [2019-12-07 16:27:44,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229299358] [2019-12-07 16:27:44,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_477abee9-686b-48ae-8012-bab4e488a418/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-12-07 16:27:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:27:44,720 INFO L264 TraceCheckSpWp]: Trace formula consists of 1298 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 16:27:44,727 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:27:44,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:27:44,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:27:44,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:27:44,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:27:44,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:27:44,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:27:44,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:27:44,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:27:44,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:27:44,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:27:46,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2394 backedges. 94 proven. 1121 refuted. 0 times theorem prover too weak. 1179 trivial. 0 not checked. [2019-12-07 16:27:46,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:27:46,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-12-07 16:27:46,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074777499] [2019-12-07 16:27:46,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:27:46,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:27:46,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:27:46,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:27:46,201 INFO L87 Difference]: Start difference. First operand 12002 states and 12217 transitions. Second operand 7 states. [2019-12-07 16:27:48,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:27:48,538 INFO L93 Difference]: Finished difference Result 22197 states and 22612 transitions. [2019-12-07 16:27:48,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 16:27:48,539 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1127 [2019-12-07 16:27:48,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:27:48,552 INFO L225 Difference]: With dead ends: 22197 [2019-12-07 16:27:48,552 INFO L226 Difference]: Without dead ends: 22195 [2019-12-07 16:27:48,555 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1133 GetRequests, 1124 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:27:48,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22195 states. [2019-12-07 16:27:48,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22195 to 13796. [2019-12-07 16:27:48,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13796 states. [2019-12-07 16:27:48,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13796 states to 13796 states and 14052 transitions. [2019-12-07 16:27:48,682 INFO L78 Accepts]: Start accepts. Automaton has 13796 states and 14052 transitions. Word has length 1127 [2019-12-07 16:27:48,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:27:48,682 INFO L462 AbstractCegarLoop]: Abstraction has 13796 states and 14052 transitions. [2019-12-07 16:27:48,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:27:48,683 INFO L276 IsEmpty]: Start isEmpty. Operand 13796 states and 14052 transitions. [2019-12-07 16:27:48,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1132 [2019-12-07 16:27:48,695 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:27:48,696 INFO L410 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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-12-07 16:27:48,896 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:27:48,897 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:27:48,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:27:48,897 INFO L82 PathProgramCache]: Analyzing trace with hash 357917745, now seen corresponding path program 1 times [2019-12-07 16:27:48,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:27:48,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525016709] [2019-12-07 16:27:48,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:27:49,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:27:49,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2126 backedges. 895 proven. 0 refuted. 0 times theorem prover too weak. 1231 trivial. 0 not checked. [2019-12-07 16:27:49,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525016709] [2019-12-07 16:27:49,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:27:49,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 16:27:49,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176552580] [2019-12-07 16:27:49,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:27:49,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:27:49,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:27:49,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:27:49,833 INFO L87 Difference]: Start difference. First operand 13796 states and 14052 transitions. Second operand 6 states. [2019-12-07 16:27:51,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:27:51,809 INFO L93 Difference]: Finished difference Result 20694 states and 21079 transitions. [2019-12-07 16:27:51,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:27:51,810 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1131 [2019-12-07 16:27:51,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:27:51,830 INFO L225 Difference]: With dead ends: 20694 [2019-12-07 16:27:51,830 INFO L226 Difference]: Without dead ends: 20692 [2019-12-07 16:27:51,834 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:27:51,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20692 states. [2019-12-07 16:27:51,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20692 to 13796. [2019-12-07 16:27:51,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13796 states. [2019-12-07 16:27:51,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13796 states to 13796 states and 14052 transitions. [2019-12-07 16:27:51,966 INFO L78 Accepts]: Start accepts. Automaton has 13796 states and 14052 transitions. Word has length 1131 [2019-12-07 16:27:51,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:27:51,967 INFO L462 AbstractCegarLoop]: Abstraction has 13796 states and 14052 transitions. [2019-12-07 16:27:51,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:27:51,967 INFO L276 IsEmpty]: Start isEmpty. Operand 13796 states and 14052 transitions. [2019-12-07 16:27:51,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1361 [2019-12-07 16:27:51,985 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:27:51,985 INFO L410 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, 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, 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, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2019-12-07 16:27:51,986 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:27:51,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:27:51,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1870571882, now seen corresponding path program 1 times [2019-12-07 16:27:51,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:27:51,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722824292] [2019-12-07 16:27:51,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:27:52,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:27:55,282 INFO L134 CoverageAnalysis]: Checked inductivity of 3846 backedges. 2755 proven. 514 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2019-12-07 16:27:55,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722824292] [2019-12-07 16:27:55,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019921738] [2019-12-07 16:27:55,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_477abee9-686b-48ae-8012-bab4e488a418/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-12-07 16:27:55,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:27:55,518 INFO L264 TraceCheckSpWp]: Trace formula consists of 1580 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 16:27:55,529 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:27:55,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:27:55,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:27:55,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:27:55,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:27:55,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:27:55,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 16:27:57,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3846 backedges. 2752 proven. 2 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2019-12-07 16:27:57,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:27:57,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 5] total 19 [2019-12-07 16:27:57,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905693725] [2019-12-07 16:27:57,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 16:27:57,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:27:57,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 16:27:57,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-12-07 16:27:57,122 INFO L87 Difference]: Start difference. First operand 13796 states and 14052 transitions. Second operand 19 states. [2019-12-07 16:28:05,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:28:05,539 INFO L93 Difference]: Finished difference Result 26909 states and 27411 transitions. [2019-12-07 16:28:05,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-07 16:28:05,540 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 1360 [2019-12-07 16:28:05,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:28:05,556 INFO L225 Difference]: With dead ends: 26909 [2019-12-07 16:28:05,556 INFO L226 Difference]: Without dead ends: 16404 [2019-12-07 16:28:05,562 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1422 GetRequests, 1377 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=345, Invalid=1295, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 16:28:05,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16404 states. [2019-12-07 16:28:05,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16404 to 14994. [2019-12-07 16:28:05,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14994 states. [2019-12-07 16:28:05,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14994 states to 14994 states and 15237 transitions. [2019-12-07 16:28:05,684 INFO L78 Accepts]: Start accepts. Automaton has 14994 states and 15237 transitions. Word has length 1360 [2019-12-07 16:28:05,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:28:05,684 INFO L462 AbstractCegarLoop]: Abstraction has 14994 states and 15237 transitions. [2019-12-07 16:28:05,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 16:28:05,684 INFO L276 IsEmpty]: Start isEmpty. Operand 14994 states and 15237 transitions. [2019-12-07 16:28:05,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1379 [2019-12-07 16:28:05,702 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:28:05,702 INFO L410 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, 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, 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, 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, 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] [2019-12-07 16:28:05,903 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:28:05,903 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:28:05,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:28:05,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1545903027, now seen corresponding path program 1 times [2019-12-07 16:28:05,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:28:05,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767205663] [2019-12-07 16:28:05,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:28:06,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:28:07,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3956 backedges. 2708 proven. 0 refuted. 0 times theorem prover too weak. 1248 trivial. 0 not checked. [2019-12-07 16:28:07,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767205663] [2019-12-07 16:28:07,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:28:07,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:28:07,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116684605] [2019-12-07 16:28:07,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:28:07,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:28:07,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:28:07,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:28:07,577 INFO L87 Difference]: Start difference. First operand 14994 states and 15237 transitions. Second operand 5 states. [2019-12-07 16:28:09,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:28:09,164 INFO L93 Difference]: Finished difference Result 29401 states and 29888 transitions. [2019-12-07 16:28:09,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:28:09,164 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1378 [2019-12-07 16:28:09,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:28:09,173 INFO L225 Difference]: With dead ends: 29401 [2019-12-07 16:28:09,173 INFO L226 Difference]: Without dead ends: 15007 [2019-12-07 16:28:09,178 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:28:09,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15007 states. [2019-12-07 16:28:09,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15007 to 13497. [2019-12-07 16:28:09,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13497 states. [2019-12-07 16:28:09,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13497 states to 13497 states and 13701 transitions. [2019-12-07 16:28:09,281 INFO L78 Accepts]: Start accepts. Automaton has 13497 states and 13701 transitions. Word has length 1378 [2019-12-07 16:28:09,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:28:09,282 INFO L462 AbstractCegarLoop]: Abstraction has 13497 states and 13701 transitions. [2019-12-07 16:28:09,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:28:09,282 INFO L276 IsEmpty]: Start isEmpty. Operand 13497 states and 13701 transitions. [2019-12-07 16:28:09,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1692 [2019-12-07 16:28:09,303 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:28:09,304 INFO L410 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, 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, 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, 7, 7, 7, 7, 7, 7, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 16:28:09,304 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:28:09,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:28:09,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1249907196, now seen corresponding path program 1 times [2019-12-07 16:28:09,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:28:09,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5964993] [2019-12-07 16:28:09,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:28:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:28:10,949 INFO L134 CoverageAnalysis]: Checked inductivity of 5511 backedges. 3589 proven. 0 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2019-12-07 16:28:10,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5964993] [2019-12-07 16:28:10,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:28:10,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:28:10,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349229709] [2019-12-07 16:28:10,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:28:10,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:28:10,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:28:10,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:28:10,951 INFO L87 Difference]: Start difference. First operand 13497 states and 13701 transitions. Second operand 4 states. [2019-12-07 16:28:11,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:28:11,908 INFO L93 Difference]: Finished difference Result 25496 states and 25886 transitions. [2019-12-07 16:28:11,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:28:11,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1691 [2019-12-07 16:28:11,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:28:11,912 INFO L225 Difference]: With dead ends: 25496 [2019-12-07 16:28:11,912 INFO L226 Difference]: Without dead ends: 5688 [2019-12-07 16:28:11,917 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-12-07 16:28:11,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5688 states. [2019-12-07 16:28:11,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5688 to 4790. [2019-12-07 16:28:11,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4790 states. [2019-12-07 16:28:11,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4790 states to 4790 states and 4817 transitions. [2019-12-07 16:28:11,951 INFO L78 Accepts]: Start accepts. Automaton has 4790 states and 4817 transitions. Word has length 1691 [2019-12-07 16:28:11,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:28:11,951 INFO L462 AbstractCegarLoop]: Abstraction has 4790 states and 4817 transitions. [2019-12-07 16:28:11,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:28:11,951 INFO L276 IsEmpty]: Start isEmpty. Operand 4790 states and 4817 transitions. [2019-12-07 16:28:11,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1790 [2019-12-07 16:28:11,966 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:28:11,966 INFO L410 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, 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, 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, 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, 2, 2, 2, 2, 2, 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] [2019-12-07 16:28:11,967 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:28:11,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:28:11,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1413703160, now seen corresponding path program 1 times [2019-12-07 16:28:11,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:28:11,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621928945] [2019-12-07 16:28:11,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:28:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:28:14,105 INFO L134 CoverageAnalysis]: Checked inductivity of 6174 backedges. 4041 proven. 0 refuted. 0 times theorem prover too weak. 2133 trivial. 0 not checked. [2019-12-07 16:28:14,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621928945] [2019-12-07 16:28:14,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:28:14,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:28:14,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901008120] [2019-12-07 16:28:14,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:28:14,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:28:14,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:28:14,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:28:14,107 INFO L87 Difference]: Start difference. First operand 4790 states and 4817 transitions. Second operand 3 states. [2019-12-07 16:28:14,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:28:14,569 INFO L93 Difference]: Finished difference Result 7784 states and 7828 transitions. [2019-12-07 16:28:14,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:28:14,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1789 [2019-12-07 16:28:14,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:28:14,573 INFO L225 Difference]: With dead ends: 7784 [2019-12-07 16:28:14,574 INFO L226 Difference]: Without dead ends: 4491 [2019-12-07 16:28:14,575 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:28:14,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4491 states. [2019-12-07 16:28:14,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4491 to 4491. [2019-12-07 16:28:14,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4491 states. [2019-12-07 16:28:14,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4491 states to 4491 states and 4515 transitions. [2019-12-07 16:28:14,604 INFO L78 Accepts]: Start accepts. Automaton has 4491 states and 4515 transitions. Word has length 1789 [2019-12-07 16:28:14,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:28:14,605 INFO L462 AbstractCegarLoop]: Abstraction has 4491 states and 4515 transitions. [2019-12-07 16:28:14,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:28:14,605 INFO L276 IsEmpty]: Start isEmpty. Operand 4491 states and 4515 transitions. [2019-12-07 16:28:14,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1886 [2019-12-07 16:28:14,621 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:28:14,622 INFO L410 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:28:14,622 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:28:14,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:28:14,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1314169253, now seen corresponding path program 1 times [2019-12-07 16:28:14,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:28:14,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016781778] [2019-12-07 16:28:14,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:28:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:28:20,819 INFO L134 CoverageAnalysis]: Checked inductivity of 6447 backedges. 94 proven. 5014 refuted. 0 times theorem prover too weak. 1339 trivial. 0 not checked. [2019-12-07 16:28:20,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016781778] [2019-12-07 16:28:20,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711436078] [2019-12-07 16:28:20,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_477abee9-686b-48ae-8012-bab4e488a418/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:28:21,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:28:21,159 INFO L264 TraceCheckSpWp]: Trace formula consists of 2130 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 16:28:21,170 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:28:21,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:28:21,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:28:21,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:28:21,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:28:21,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:28:21,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:28:21,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:28:21,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:28:21,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:28:21,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:28:21,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:28:21,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:28:21,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:28:21,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:28:21,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:28:21,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:28:21,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:28:21,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:28:21,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:28:21,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:28:21,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:28:21,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:28:21,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:28:21,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:28:21,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:28:21,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:28:21,742 WARN L192 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 24 [2019-12-07 16:28:21,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:28:21,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:28:27,165 INFO L134 CoverageAnalysis]: Checked inductivity of 6447 backedges. 3995 proven. 440 refuted. 0 times theorem prover too weak. 2012 trivial. 0 not checked. [2019-12-07 16:28:27,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:28:27,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2019-12-07 16:28:27,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679866087] [2019-12-07 16:28:27,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 16:28:27,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:28:27,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 16:28:27,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-12-07 16:28:27,168 INFO L87 Difference]: Start difference. First operand 4491 states and 4515 transitions. Second operand 12 states. [2019-12-07 16:28:35,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:28:35,020 INFO L93 Difference]: Finished difference Result 11372 states and 11436 transitions. [2019-12-07 16:28:35,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 16:28:35,022 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 1885 [2019-12-07 16:28:35,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:28:35,024 INFO L225 Difference]: With dead ends: 11372 [2019-12-07 16:28:35,024 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 16:28:35,028 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1899 GetRequests, 1885 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-12-07 16:28:35,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 16:28:35,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 16:28:35,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 16:28:35,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 16:28:35,029 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1885 [2019-12-07 16:28:35,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:28:35,029 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 16:28:35,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 16:28:35,030 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 16:28:35,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 16:28:35,230 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:28:35,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 16:28:36,024 WARN L192 SmtUtils]: Spent 784.00 ms on a formula simplification. DAG size of input: 685 DAG size of output: 592 [2019-12-07 16:28:36,712 WARN L192 SmtUtils]: Spent 684.00 ms on a formula simplification. DAG size of input: 685 DAG size of output: 592 [2019-12-07 16:28:37,108 WARN L192 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 527 DAG size of output: 465 [2019-12-07 16:28:41,024 WARN L192 SmtUtils]: Spent 3.91 s on a formula simplification. DAG size of input: 565 DAG size of output: 144 [2019-12-07 16:28:45,532 WARN L192 SmtUtils]: Spent 4.50 s on a formula simplification. DAG size of input: 565 DAG size of output: 144 [2019-12-07 16:28:49,335 WARN L192 SmtUtils]: Spent 3.80 s on a formula simplification. DAG size of input: 448 DAG size of output: 147 [2019-12-07 16:28:49,338 INFO L246 CegarLoopResult]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,339 INFO L246 CegarLoopResult]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,339 INFO L246 CegarLoopResult]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,339 INFO L246 CegarLoopResult]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,339 INFO L246 CegarLoopResult]: For program point L103(line 103) no Hoare annotation was computed. [2019-12-07 16:28:49,339 INFO L246 CegarLoopResult]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,339 INFO L246 CegarLoopResult]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,339 INFO L246 CegarLoopResult]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,339 INFO L246 CegarLoopResult]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,339 INFO L246 CegarLoopResult]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,339 INFO L246 CegarLoopResult]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,339 INFO L246 CegarLoopResult]: For program point L106(line 106) no Hoare annotation was computed. [2019-12-07 16:28:49,339 INFO L246 CegarLoopResult]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,339 INFO L246 CegarLoopResult]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,339 INFO L246 CegarLoopResult]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,339 INFO L246 CegarLoopResult]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-12-07 16:28:49,339 INFO L246 CegarLoopResult]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,339 INFO L246 CegarLoopResult]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,339 INFO L246 CegarLoopResult]: For program point L109(line 109) no Hoare annotation was computed. [2019-12-07 16:28:49,339 INFO L246 CegarLoopResult]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,339 INFO L246 CegarLoopResult]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,340 INFO L246 CegarLoopResult]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,340 INFO L246 CegarLoopResult]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,340 INFO L246 CegarLoopResult]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,340 INFO L246 CegarLoopResult]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,340 INFO L246 CegarLoopResult]: For program point L112(line 112) no Hoare annotation was computed. [2019-12-07 16:28:49,340 INFO L246 CegarLoopResult]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,340 INFO L246 CegarLoopResult]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,340 INFO L246 CegarLoopResult]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,340 INFO L246 CegarLoopResult]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,340 INFO L246 CegarLoopResult]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-12-07 16:28:49,340 INFO L246 CegarLoopResult]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-12-07 16:28:49,340 INFO L246 CegarLoopResult]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,340 INFO L246 CegarLoopResult]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,340 INFO L246 CegarLoopResult]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,340 INFO L246 CegarLoopResult]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,340 INFO L246 CegarLoopResult]: For program point L115(line 115) no Hoare annotation was computed. [2019-12-07 16:28:49,340 INFO L246 CegarLoopResult]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-12-07 16:28:49,340 INFO L246 CegarLoopResult]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,340 INFO L246 CegarLoopResult]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,340 INFO L246 CegarLoopResult]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,341 INFO L246 CegarLoopResult]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,341 INFO L246 CegarLoopResult]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,341 INFO L246 CegarLoopResult]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-12-07 16:28:49,341 INFO L246 CegarLoopResult]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,341 INFO L246 CegarLoopResult]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-12-07 16:28:49,341 INFO L246 CegarLoopResult]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-12-07 16:28:49,341 INFO L246 CegarLoopResult]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-12-07 16:28:49,341 INFO L246 CegarLoopResult]: For program point L118(line 118) no Hoare annotation was computed. [2019-12-07 16:28:49,341 INFO L246 CegarLoopResult]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,341 INFO L246 CegarLoopResult]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,341 INFO L246 CegarLoopResult]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,341 INFO L246 CegarLoopResult]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,341 INFO L246 CegarLoopResult]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,341 INFO L246 CegarLoopResult]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-12-07 16:28:49,341 INFO L246 CegarLoopResult]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,341 INFO L246 CegarLoopResult]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,341 INFO L246 CegarLoopResult]: For program point L121(line 121) no Hoare annotation was computed. [2019-12-07 16:28:49,341 INFO L246 CegarLoopResult]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,341 INFO L246 CegarLoopResult]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-12-07 16:28:49,341 INFO L246 CegarLoopResult]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,342 INFO L246 CegarLoopResult]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,342 INFO L246 CegarLoopResult]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,342 INFO L246 CegarLoopResult]: For program point L124(line 124) no Hoare annotation was computed. [2019-12-07 16:28:49,342 INFO L246 CegarLoopResult]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,342 INFO L246 CegarLoopResult]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-12-07 16:28:49,342 INFO L246 CegarLoopResult]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-12-07 16:28:49,342 INFO L246 CegarLoopResult]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-12-07 16:28:49,342 INFO L246 CegarLoopResult]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-12-07 16:28:49,342 INFO L246 CegarLoopResult]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-12-07 16:28:49,342 INFO L246 CegarLoopResult]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-12-07 16:28:49,342 INFO L246 CegarLoopResult]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,342 INFO L246 CegarLoopResult]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,342 INFO L246 CegarLoopResult]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,342 INFO L246 CegarLoopResult]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,342 INFO L246 CegarLoopResult]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-12-07 16:28:49,342 INFO L246 CegarLoopResult]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-12-07 16:28:49,342 INFO L246 CegarLoopResult]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,342 INFO L246 CegarLoopResult]: For program point L127(line 127) no Hoare annotation was computed. [2019-12-07 16:28:49,342 INFO L246 CegarLoopResult]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,342 INFO L246 CegarLoopResult]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,343 INFO L246 CegarLoopResult]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,343 INFO L246 CegarLoopResult]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,343 INFO L246 CegarLoopResult]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,343 INFO L246 CegarLoopResult]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,343 INFO L246 CegarLoopResult]: For program point L130(line 130) no Hoare annotation was computed. [2019-12-07 16:28:49,343 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 16:28:49,343 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 154) no Hoare annotation was computed. [2019-12-07 16:28:49,343 INFO L246 CegarLoopResult]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,343 INFO L246 CegarLoopResult]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,343 INFO L246 CegarLoopResult]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,343 INFO L246 CegarLoopResult]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,343 INFO L246 CegarLoopResult]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,343 INFO L246 CegarLoopResult]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-12-07 16:28:49,343 INFO L246 CegarLoopResult]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-12-07 16:28:49,343 INFO L246 CegarLoopResult]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,343 INFO L246 CegarLoopResult]: For program point L133(line 133) no Hoare annotation was computed. [2019-12-07 16:28:49,343 INFO L246 CegarLoopResult]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-12-07 16:28:49,343 INFO L246 CegarLoopResult]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-12-07 16:28:49,343 INFO L246 CegarLoopResult]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,343 INFO L246 CegarLoopResult]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-12-07 16:28:49,344 INFO L246 CegarLoopResult]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-12-07 16:28:49,344 INFO L246 CegarLoopResult]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,344 INFO L246 CegarLoopResult]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,344 INFO L246 CegarLoopResult]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,344 INFO L246 CegarLoopResult]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,344 INFO L246 CegarLoopResult]: For program point L136(line 136) no Hoare annotation was computed. [2019-12-07 16:28:49,344 INFO L246 CegarLoopResult]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-12-07 16:28:49,344 INFO L246 CegarLoopResult]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,344 INFO L246 CegarLoopResult]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,344 INFO L246 CegarLoopResult]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,344 INFO L246 CegarLoopResult]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-12-07 16:28:49,344 INFO L246 CegarLoopResult]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-12-07 16:28:49,344 INFO L246 CegarLoopResult]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,344 INFO L246 CegarLoopResult]: For program point L139(line 139) no Hoare annotation was computed. [2019-12-07 16:28:49,344 INFO L246 CegarLoopResult]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,344 INFO L246 CegarLoopResult]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,344 INFO L246 CegarLoopResult]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,344 INFO L246 CegarLoopResult]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,344 INFO L246 CegarLoopResult]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,344 INFO L246 CegarLoopResult]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,345 INFO L246 CegarLoopResult]: For program point L142(line 142) no Hoare annotation was computed. [2019-12-07 16:28:49,345 INFO L246 CegarLoopResult]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,345 INFO L246 CegarLoopResult]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,345 INFO L246 CegarLoopResult]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-12-07 16:28:49,345 INFO L246 CegarLoopResult]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,345 INFO L246 CegarLoopResult]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,345 INFO L246 CegarLoopResult]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,345 INFO L246 CegarLoopResult]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,345 INFO L246 CegarLoopResult]: For program point L145(line 145) no Hoare annotation was computed. [2019-12-07 16:28:49,345 INFO L246 CegarLoopResult]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,345 INFO L246 CegarLoopResult]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,345 INFO L246 CegarLoopResult]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,345 INFO L246 CegarLoopResult]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,345 INFO L246 CegarLoopResult]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,345 INFO L246 CegarLoopResult]: For program point L148(line 148) no Hoare annotation was computed. [2019-12-07 16:28:49,345 INFO L246 CegarLoopResult]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,345 INFO L246 CegarLoopResult]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,345 INFO L246 CegarLoopResult]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,345 INFO L246 CegarLoopResult]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,345 INFO L246 CegarLoopResult]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-12-07 16:28:49,346 INFO L246 CegarLoopResult]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,346 INFO L246 CegarLoopResult]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,346 INFO L246 CegarLoopResult]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,346 INFO L246 CegarLoopResult]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-12-07 16:28:49,346 INFO L246 CegarLoopResult]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-12-07 16:28:49,346 INFO L246 CegarLoopResult]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,346 INFO L246 CegarLoopResult]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,346 INFO L246 CegarLoopResult]: For program point L151(line 151) no Hoare annotation was computed. [2019-12-07 16:28:49,346 INFO L246 CegarLoopResult]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,346 INFO L246 CegarLoopResult]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,346 INFO L246 CegarLoopResult]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,346 INFO L246 CegarLoopResult]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,346 INFO L246 CegarLoopResult]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,346 INFO L246 CegarLoopResult]: For program point L154(line 154) no Hoare annotation was computed. [2019-12-07 16:28:49,346 INFO L246 CegarLoopResult]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,346 INFO L246 CegarLoopResult]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,346 INFO L246 CegarLoopResult]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,346 INFO L246 CegarLoopResult]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,346 INFO L246 CegarLoopResult]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,346 INFO L246 CegarLoopResult]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-12-07 16:28:49,346 INFO L246 CegarLoopResult]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,347 INFO L246 CegarLoopResult]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,347 INFO L246 CegarLoopResult]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-12-07 16:28:49,347 INFO L246 CegarLoopResult]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,347 INFO L246 CegarLoopResult]: For program point L157(line 157) no Hoare annotation was computed. [2019-12-07 16:28:49,347 INFO L246 CegarLoopResult]: For program point L25(line 25) no Hoare annotation was computed. [2019-12-07 16:28:49,347 INFO L246 CegarLoopResult]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,347 INFO L246 CegarLoopResult]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,347 INFO L246 CegarLoopResult]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,347 INFO L246 CegarLoopResult]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,347 INFO L246 CegarLoopResult]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,347 INFO L246 CegarLoopResult]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-12-07 16:28:49,347 INFO L246 CegarLoopResult]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-12-07 16:28:49,347 INFO L246 CegarLoopResult]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,347 INFO L246 CegarLoopResult]: For program point L160(line 160) no Hoare annotation was computed. [2019-12-07 16:28:49,347 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 16:28:49,347 INFO L246 CegarLoopResult]: For program point L28(line 28) no Hoare annotation was computed. [2019-12-07 16:28:49,347 INFO L246 CegarLoopResult]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,347 INFO L246 CegarLoopResult]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,347 INFO L246 CegarLoopResult]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,347 INFO L246 CegarLoopResult]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,348 INFO L246 CegarLoopResult]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,348 INFO L246 CegarLoopResult]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-12-07 16:28:49,348 INFO L246 CegarLoopResult]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-12-07 16:28:49,348 INFO L246 CegarLoopResult]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-12-07 16:28:49,348 INFO L246 CegarLoopResult]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-12-07 16:28:49,348 INFO L246 CegarLoopResult]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,348 INFO L246 CegarLoopResult]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,348 INFO L246 CegarLoopResult]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,348 INFO L246 CegarLoopResult]: For program point L163(line 163) no Hoare annotation was computed. [2019-12-07 16:28:49,348 INFO L246 CegarLoopResult]: For program point L31(line 31) no Hoare annotation was computed. [2019-12-07 16:28:49,348 INFO L246 CegarLoopResult]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,348 INFO L246 CegarLoopResult]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-12-07 16:28:49,348 INFO L246 CegarLoopResult]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,348 INFO L246 CegarLoopResult]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,348 INFO L246 CegarLoopResult]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,348 INFO L246 CegarLoopResult]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,348 INFO L246 CegarLoopResult]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-12-07 16:28:49,348 INFO L246 CegarLoopResult]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-12-07 16:28:49,348 INFO L246 CegarLoopResult]: For program point L166(line 166) no Hoare annotation was computed. [2019-12-07 16:28:49,348 INFO L246 CegarLoopResult]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,348 INFO L246 CegarLoopResult]: For program point L34(line 34) no Hoare annotation was computed. [2019-12-07 16:28:49,349 INFO L246 CegarLoopResult]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,349 INFO L246 CegarLoopResult]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,349 INFO L246 CegarLoopResult]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,349 INFO L246 CegarLoopResult]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,349 INFO L246 CegarLoopResult]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,349 INFO L246 CegarLoopResult]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,349 INFO L246 CegarLoopResult]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,349 INFO L246 CegarLoopResult]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,349 INFO L246 CegarLoopResult]: For program point L169(line 169) no Hoare annotation was computed. [2019-12-07 16:28:49,349 INFO L246 CegarLoopResult]: For program point L37(line 37) no Hoare annotation was computed. [2019-12-07 16:28:49,349 INFO L246 CegarLoopResult]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-12-07 16:28:49,349 INFO L246 CegarLoopResult]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-12-07 16:28:49,349 INFO L246 CegarLoopResult]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,349 INFO L246 CegarLoopResult]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,349 INFO L246 CegarLoopResult]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,349 INFO L246 CegarLoopResult]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,350 INFO L242 CegarLoopResult]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse21 (= 4 ~a2~0)) (.cse4 (+ ~a0~0 44)) (.cse32 (+ ~a4~0 86)) (.cse15 (+ ~a29~0 16))) (let ((.cse24 (< 0 .cse15)) (.cse30 (< 0 .cse32)) (.cse20 (<= (+ ~a0~0 147) 0)) (.cse2 (<= 0 .cse4)) (.cse11 (<= .cse32 0)) (.cse7 (not .cse21)) (.cse17 (+ ~a0~0 98))) (let ((.cse13 (<= ~a0~0 599970)) (.cse22 (<= ~a29~0 42)) (.cse25 (<= ~a29~0 43)) (.cse18 (<= 0 (+ ~a0~0 599998))) (.cse9 (<= ~a2~0 4)) (.cse14 (= 5 ~a2~0)) (.cse5 (<= .cse17 0)) (.cse6 (<= 0 (+ ~a0~0 146))) (.cse19 (not (= 1 ULTIMATE.start_calculate_output_~input))) (.cse23 (let ((.cse31 (<= ~a2~0 3))) (or (and .cse2 .cse31) (and .cse11 .cse7 .cse31)))) (.cse26 (+ ~a29~0 144)) (.cse8 (<= 3 ~a2~0)) (.cse10 (or .cse24 .cse30 .cse20)) (.cse16 (= 2 ~a2~0)) (.cse12 (<= (+ ~a0~0 61) 0)) (.cse1 (= 1 ~a2~0)) (.cse27 (< 43 ~a29~0))) (or (let ((.cse0 (+ ~a4~0 89)) (.cse3 (+ ~a29~0 127))) (and (<= .cse0 0) (<= 0 .cse0) .cse1 .cse2 (<= .cse3 0) (<= 0 .cse3) (<= .cse4 0))) (and .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse11 .cse12) (and .cse13 .cse10 .cse11 .cse14 .cse7) (and .cse13 .cse11 (<= .cse15 0) .cse16 .cse7) (and .cse11 (< 0 .cse17) .cse12) (and .cse18 (or (< 0 (+ ~a4~0 42)) .cse19) .cse20 .cse21) (and .cse18 .cse22 .cse20 .cse21) (and .cse18 .cse20 .cse14) (and .cse13 .cse23 .cse8) (and .cse5 .cse24 .cse6 .cse16) (and .cse10 .cse18 .cse13 .cse1 .cse25 (< 0 .cse26)) (and .cse22 (or (and .cse11 (<= 13 ~a0~0)) (and .cse10 .cse11)) .cse21) (and .cse18 .cse20 .cse25 .cse7 .cse8 .cse9) (and .cse5 .cse6 .cse8 .cse9 .cse27) (and .cse10 .cse11 .cse25 .cse14 .cse7) (and .cse5 .cse25 .cse14) (and .cse18 .cse20 .cse16) (and .cse20 .cse7 .cse8 .cse9 (exists ((v_~a0~0_829 Int)) (let ((.cse29 (div v_~a0~0_829 5))) (let ((.cse28 (* 10 .cse29))) (and (<= v_~a0~0_829 599970) (<= 0 (+ .cse28 3459790)) (<= (div (+ (* .cse29 10) 3459790) (- 9)) ~a0~0) (<= 0 (+ .cse28 3459800)) (= (mod v_~a0~0_829 5) 0)))))) (and .cse5 .cse6 (<= (+ ~a0~0 38608) (+ ~a4~0 ~a29~0)) .cse14) (and .cse5 .cse1 .cse6) (and (or .cse30 .cse19) .cse23 (<= .cse26 0) .cse8) (and .cse10 .cse11 (not (= 6 ULTIMATE.start_calculate_output_~input)) .cse16 .cse7) (and .cse11 .cse12 .cse7) (and (<= 0 (+ ~a0~0 384412)) .cse1 .cse20 .cse27))))) [2019-12-07 16:28:49,350 INFO L246 CegarLoopResult]: For program point L172(line 172) no Hoare annotation was computed. [2019-12-07 16:28:49,350 INFO L246 CegarLoopResult]: For program point L40(line 40) no Hoare annotation was computed. [2019-12-07 16:28:49,350 INFO L246 CegarLoopResult]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,350 INFO L246 CegarLoopResult]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,350 INFO L246 CegarLoopResult]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,350 INFO L246 CegarLoopResult]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,350 INFO L246 CegarLoopResult]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,350 INFO L246 CegarLoopResult]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,350 INFO L246 CegarLoopResult]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,350 INFO L246 CegarLoopResult]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-12-07 16:28:49,350 INFO L246 CegarLoopResult]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,350 INFO L246 CegarLoopResult]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-12-07 16:28:49,350 INFO L249 CegarLoopResult]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-12-07 16:28:49,350 INFO L246 CegarLoopResult]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,350 INFO L246 CegarLoopResult]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-12-07 16:28:49,351 INFO L246 CegarLoopResult]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-12-07 16:28:49,351 INFO L246 CegarLoopResult]: For program point L175(line 175) no Hoare annotation was computed. [2019-12-07 16:28:49,351 INFO L246 CegarLoopResult]: For program point L43(line 43) no Hoare annotation was computed. [2019-12-07 16:28:49,351 INFO L246 CegarLoopResult]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,351 INFO L246 CegarLoopResult]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,351 INFO L246 CegarLoopResult]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,351 INFO L246 CegarLoopResult]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,351 INFO L246 CegarLoopResult]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,351 INFO L246 CegarLoopResult]: For program point L178(line 178) no Hoare annotation was computed. [2019-12-07 16:28:49,351 INFO L246 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed. [2019-12-07 16:28:49,351 INFO L246 CegarLoopResult]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,351 INFO L246 CegarLoopResult]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-12-07 16:28:49,351 INFO L246 CegarLoopResult]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-12-07 16:28:49,351 INFO L246 CegarLoopResult]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,351 INFO L246 CegarLoopResult]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,351 INFO L246 CegarLoopResult]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,351 INFO L246 CegarLoopResult]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,351 INFO L246 CegarLoopResult]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,351 INFO L246 CegarLoopResult]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,352 INFO L242 CegarLoopResult]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse21 (+ ~a29~0 16)) (.cse26 (= 4 ~a2~0)) (.cse31 (+ ~a4~0 86)) (.cse5 (+ ~a0~0 44))) (let ((.cse28 (+ ~a29~0 144)) (.cse3 (<= 0 .cse5)) (.cse0 (<= .cse31 0)) (.cse8 (not .cse26)) (.cse23 (< 0 .cse21)) (.cse14 (<= (+ ~a0~0 147) 0)) (.cse29 (+ ~a0~0 98))) (let ((.cse10 (<= ~a2~0 4)) (.cse22 (= 2 ~a2~0)) (.cse18 (< 0 .cse29)) (.cse17 (= 5 ~a2~0)) (.cse16 (<= ~a0~0 599970)) (.cse11 (or .cse23 (< 0 .cse31) .cse14)) (.cse15 (<= ~a29~0 43)) (.cse19 (let ((.cse30 (<= ~a2~0 3))) (or (and .cse3 .cse30) (and .cse0 .cse8 .cse30)))) (.cse20 (<= .cse28 0)) (.cse9 (<= 3 ~a2~0)) (.cse13 (<= 0 (+ ~a0~0 599998))) (.cse6 (<= .cse29 0)) (.cse7 (<= 0 (+ ~a0~0 146))) (.cse12 (<= (+ ~a0~0 61) 0)) (.cse2 (= 1 ~a2~0)) (.cse27 (< 43 ~a29~0))) (or (let ((.cse1 (+ ~a4~0 89)) (.cse4 (+ ~a29~0 127))) (and .cse0 (<= .cse1 0) (<= 0 .cse1) .cse2 .cse3 (<= .cse4 0) (<= 0 .cse4) (<= .cse5 0))) (and .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse12) (and .cse13 .cse14 .cse15 .cse9 .cse10) (and .cse16 .cse11 .cse0 .cse17 .cse8) (and .cse0 .cse18 .cse12) (and .cse16 .cse19 .cse9) (and .cse0 .cse2 .cse20) (and .cse13 .cse14 .cse17) (and .cse16 .cse0 (<= .cse21 0) .cse22 .cse8 .cse18) (and .cse6 .cse23 .cse7 .cse22) (and .cse14 .cse9 .cse10 (exists ((v_~a0~0_829 Int)) (let ((.cse25 (div v_~a0~0_829 5))) (let ((.cse24 (* 10 .cse25))) (and (<= v_~a0~0_829 599970) (<= 0 (+ .cse24 3459790)) (<= (div (+ (* .cse25 10) 3459790) (- 9)) ~a0~0) (<= 0 (+ .cse24 3459800)) (= (mod v_~a0~0_829 5) 0)))))) (and (<= ~a29~0 42) (or (and .cse0 (<= 13 ~a0~0)) (and .cse11 .cse0)) .cse26) (and .cse6 .cse7 .cse9 .cse10 .cse27) (and .cse11 .cse0 .cse15 .cse17 .cse8) (and .cse6 .cse15 .cse17) (and .cse13 .cse14 .cse22) (and .cse11 .cse0 (not (= 6 ULTIMATE.start_calculate_output_~input)) .cse22 .cse8 .cse18) (and .cse6 .cse7 (<= (+ ~a0~0 38608) (+ ~a4~0 ~a29~0)) .cse17) (and .cse16 .cse11 .cse13 .cse2 .cse15 (< 0 .cse28)) (and .cse19 .cse20 .cse9) (and .cse13 .cse14 .cse26) (and .cse6 .cse2 .cse7) (and .cse0 .cse12 .cse8) (and (<= 0 (+ ~a0~0 384412)) .cse2 .cse14 .cse27))))) [2019-12-07 16:28:49,352 INFO L246 CegarLoopResult]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,352 INFO L246 CegarLoopResult]: For program point L181(line 181) no Hoare annotation was computed. [2019-12-07 16:28:49,352 INFO L246 CegarLoopResult]: For program point L49(line 49) no Hoare annotation was computed. [2019-12-07 16:28:49,352 INFO L246 CegarLoopResult]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,352 INFO L246 CegarLoopResult]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,352 INFO L246 CegarLoopResult]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,352 INFO L246 CegarLoopResult]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,352 INFO L246 CegarLoopResult]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,352 INFO L246 CegarLoopResult]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,352 INFO L246 CegarLoopResult]: For program point L184(line 184) no Hoare annotation was computed. [2019-12-07 16:28:49,352 INFO L246 CegarLoopResult]: For program point L52(line 52) no Hoare annotation was computed. [2019-12-07 16:28:49,352 INFO L246 CegarLoopResult]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,352 INFO L246 CegarLoopResult]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,353 INFO L246 CegarLoopResult]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-12-07 16:28:49,353 INFO L246 CegarLoopResult]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,353 INFO L246 CegarLoopResult]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,353 INFO L246 CegarLoopResult]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,353 INFO L246 CegarLoopResult]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,353 INFO L246 CegarLoopResult]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,353 INFO L246 CegarLoopResult]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,353 INFO L246 CegarLoopResult]: For program point L187(line 187) no Hoare annotation was computed. [2019-12-07 16:28:49,353 INFO L246 CegarLoopResult]: For program point L55(line 55) no Hoare annotation was computed. [2019-12-07 16:28:49,353 INFO L246 CegarLoopResult]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,353 INFO L246 CegarLoopResult]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,353 INFO L246 CegarLoopResult]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,353 INFO L246 CegarLoopResult]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,353 INFO L246 CegarLoopResult]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,353 INFO L246 CegarLoopResult]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,353 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 16:28:49,353 INFO L246 CegarLoopResult]: For program point L190(line 190) no Hoare annotation was computed. [2019-12-07 16:28:49,353 INFO L246 CegarLoopResult]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,353 INFO L246 CegarLoopResult]: For program point L58(line 58) no Hoare annotation was computed. [2019-12-07 16:28:49,353 INFO L246 CegarLoopResult]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,354 INFO L246 CegarLoopResult]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,354 INFO L246 CegarLoopResult]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,354 INFO L246 CegarLoopResult]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,354 INFO L246 CegarLoopResult]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,354 INFO L246 CegarLoopResult]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,354 INFO L246 CegarLoopResult]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,354 INFO L246 CegarLoopResult]: For program point L193(line 193) no Hoare annotation was computed. [2019-12-07 16:28:49,354 INFO L246 CegarLoopResult]: For program point L61(line 61) no Hoare annotation was computed. [2019-12-07 16:28:49,354 INFO L246 CegarLoopResult]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,354 INFO L246 CegarLoopResult]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,354 INFO L246 CegarLoopResult]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,354 INFO L246 CegarLoopResult]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,354 INFO L246 CegarLoopResult]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,354 INFO L246 CegarLoopResult]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,354 INFO L246 CegarLoopResult]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,354 INFO L246 CegarLoopResult]: For program point L196(line 196) no Hoare annotation was computed. [2019-12-07 16:28:49,354 INFO L246 CegarLoopResult]: For program point L64(line 64) no Hoare annotation was computed. [2019-12-07 16:28:49,354 INFO L246 CegarLoopResult]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,354 INFO L246 CegarLoopResult]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,354 INFO L246 CegarLoopResult]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,354 INFO L246 CegarLoopResult]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,355 INFO L246 CegarLoopResult]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,355 INFO L246 CegarLoopResult]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,355 INFO L246 CegarLoopResult]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,355 INFO L246 CegarLoopResult]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-12-07 16:28:49,355 INFO L246 CegarLoopResult]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-12-07 16:28:49,355 INFO L246 CegarLoopResult]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,355 INFO L246 CegarLoopResult]: For program point L199(line 199) no Hoare annotation was computed. [2019-12-07 16:28:49,355 INFO L246 CegarLoopResult]: For program point L67(line 67) no Hoare annotation was computed. [2019-12-07 16:28:49,355 INFO L246 CegarLoopResult]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,355 INFO L246 CegarLoopResult]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,355 INFO L246 CegarLoopResult]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,355 INFO L246 CegarLoopResult]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,355 INFO L246 CegarLoopResult]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,355 INFO L246 CegarLoopResult]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,355 INFO L242 CegarLoopResult]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse21 (+ ~a29~0 16)) (.cse26 (= 4 ~a2~0)) (.cse31 (+ ~a4~0 86)) (.cse5 (+ ~a0~0 44))) (let ((.cse28 (+ ~a29~0 144)) (.cse3 (<= 0 .cse5)) (.cse0 (<= .cse31 0)) (.cse8 (not .cse26)) (.cse23 (< 0 .cse21)) (.cse14 (<= (+ ~a0~0 147) 0)) (.cse29 (+ ~a0~0 98))) (let ((.cse10 (<= ~a2~0 4)) (.cse22 (= 2 ~a2~0)) (.cse18 (< 0 .cse29)) (.cse17 (= 5 ~a2~0)) (.cse16 (<= ~a0~0 599970)) (.cse11 (or .cse23 (< 0 .cse31) .cse14)) (.cse15 (<= ~a29~0 43)) (.cse19 (let ((.cse30 (<= ~a2~0 3))) (or (and .cse3 .cse30) (and .cse0 .cse8 .cse30)))) (.cse20 (<= .cse28 0)) (.cse9 (<= 3 ~a2~0)) (.cse13 (<= 0 (+ ~a0~0 599998))) (.cse6 (<= .cse29 0)) (.cse7 (<= 0 (+ ~a0~0 146))) (.cse12 (<= (+ ~a0~0 61) 0)) (.cse2 (= 1 ~a2~0)) (.cse27 (< 43 ~a29~0))) (or (let ((.cse1 (+ ~a4~0 89)) (.cse4 (+ ~a29~0 127))) (and .cse0 (<= .cse1 0) (<= 0 .cse1) .cse2 .cse3 (<= .cse4 0) (<= 0 .cse4) (<= .cse5 0))) (and .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse12) (and .cse13 .cse14 .cse15 .cse9 .cse10) (and .cse16 .cse11 .cse0 .cse17 .cse8) (and .cse0 .cse18 .cse12) (and .cse16 .cse19 .cse9) (and .cse0 .cse2 .cse20) (and .cse13 .cse14 .cse17) (and .cse16 .cse0 (<= .cse21 0) .cse22 .cse8 .cse18) (and .cse6 .cse23 .cse7 .cse22) (and .cse14 .cse9 .cse10 (exists ((v_~a0~0_829 Int)) (let ((.cse25 (div v_~a0~0_829 5))) (let ((.cse24 (* 10 .cse25))) (and (<= v_~a0~0_829 599970) (<= 0 (+ .cse24 3459790)) (<= (div (+ (* .cse25 10) 3459790) (- 9)) ~a0~0) (<= 0 (+ .cse24 3459800)) (= (mod v_~a0~0_829 5) 0)))))) (and (<= ~a29~0 42) (or (and .cse0 (<= 13 ~a0~0)) (and .cse11 .cse0)) .cse26) (and .cse6 .cse7 .cse9 .cse10 .cse27) (and .cse11 .cse0 .cse15 .cse17 .cse8) (and .cse6 .cse15 .cse17) (and .cse13 .cse14 .cse22) (and .cse11 .cse0 (not (= 6 ULTIMATE.start_calculate_output_~input)) .cse22 .cse8 .cse18) (and .cse6 .cse7 (<= (+ ~a0~0 38608) (+ ~a4~0 ~a29~0)) .cse17) (and .cse16 .cse11 .cse13 .cse2 .cse15 (< 0 .cse28)) (and .cse19 .cse20 .cse9) (and .cse13 .cse14 .cse26) (and .cse6 .cse2 .cse7) (and .cse0 .cse12 .cse8) (and (<= 0 (+ ~a0~0 384412)) .cse2 .cse14 .cse27))))) [2019-12-07 16:28:49,356 INFO L246 CegarLoopResult]: For program point L202(line 202) no Hoare annotation was computed. [2019-12-07 16:28:49,356 INFO L246 CegarLoopResult]: For program point L70(line 70) no Hoare annotation was computed. [2019-12-07 16:28:49,356 INFO L246 CegarLoopResult]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,356 INFO L246 CegarLoopResult]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,356 INFO L246 CegarLoopResult]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,356 INFO L246 CegarLoopResult]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,356 INFO L246 CegarLoopResult]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,356 INFO L246 CegarLoopResult]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,356 INFO L246 CegarLoopResult]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,356 INFO L246 CegarLoopResult]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,356 INFO L246 CegarLoopResult]: For program point L205(line 205) no Hoare annotation was computed. [2019-12-07 16:28:49,356 INFO L246 CegarLoopResult]: For program point L73(line 73) no Hoare annotation was computed. [2019-12-07 16:28:49,356 INFO L246 CegarLoopResult]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,356 INFO L246 CegarLoopResult]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-12-07 16:28:49,356 INFO L246 CegarLoopResult]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-12-07 16:28:49,356 INFO L246 CegarLoopResult]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,356 INFO L246 CegarLoopResult]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,356 INFO L246 CegarLoopResult]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,356 INFO L246 CegarLoopResult]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,356 INFO L246 CegarLoopResult]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,356 INFO L246 CegarLoopResult]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-12-07 16:28:49,357 INFO L246 CegarLoopResult]: For program point L76(line 76) no Hoare annotation was computed. [2019-12-07 16:28:49,357 INFO L246 CegarLoopResult]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,357 INFO L246 CegarLoopResult]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,357 INFO L246 CegarLoopResult]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,357 INFO L246 CegarLoopResult]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,357 INFO L246 CegarLoopResult]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-12-07 16:28:49,357 INFO L246 CegarLoopResult]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-12-07 16:28:49,357 INFO L246 CegarLoopResult]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-12-07 16:28:49,357 INFO L246 CegarLoopResult]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,357 INFO L246 CegarLoopResult]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-12-07 16:28:49,357 INFO L246 CegarLoopResult]: For program point L79(line 79) no Hoare annotation was computed. [2019-12-07 16:28:49,357 INFO L246 CegarLoopResult]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,357 INFO L246 CegarLoopResult]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,357 INFO L246 CegarLoopResult]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,357 INFO L246 CegarLoopResult]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,357 INFO L246 CegarLoopResult]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,357 INFO L246 CegarLoopResult]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,357 INFO L246 CegarLoopResult]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,357 INFO L246 CegarLoopResult]: For program point L82(line 82) no Hoare annotation was computed. [2019-12-07 16:28:49,357 INFO L246 CegarLoopResult]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-12-07 16:28:49,357 INFO L246 CegarLoopResult]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,357 INFO L246 CegarLoopResult]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,358 INFO L246 CegarLoopResult]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,358 INFO L246 CegarLoopResult]: For program point L85(line 85) no Hoare annotation was computed. [2019-12-07 16:28:49,358 INFO L246 CegarLoopResult]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,358 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 16:28:49,358 INFO L246 CegarLoopResult]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,358 INFO L246 CegarLoopResult]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-12-07 16:28:49,358 INFO L246 CegarLoopResult]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,358 INFO L246 CegarLoopResult]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,358 INFO L246 CegarLoopResult]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,358 INFO L246 CegarLoopResult]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,358 INFO L246 CegarLoopResult]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,358 INFO L246 CegarLoopResult]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,358 INFO L246 CegarLoopResult]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,358 INFO L246 CegarLoopResult]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-12-07 16:28:49,358 INFO L246 CegarLoopResult]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-12-07 16:28:49,358 INFO L246 CegarLoopResult]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,358 INFO L246 CegarLoopResult]: For program point L88(line 88) no Hoare annotation was computed. [2019-12-07 16:28:49,358 INFO L246 CegarLoopResult]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,358 INFO L246 CegarLoopResult]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,358 INFO L246 CegarLoopResult]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,358 INFO L246 CegarLoopResult]: For program point L91(line 91) no Hoare annotation was computed. [2019-12-07 16:28:49,358 INFO L246 CegarLoopResult]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,359 INFO L246 CegarLoopResult]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,359 INFO L246 CegarLoopResult]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,359 INFO L246 CegarLoopResult]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,359 INFO L246 CegarLoopResult]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-12-07 16:28:49,359 INFO L246 CegarLoopResult]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,359 INFO L246 CegarLoopResult]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,359 INFO L246 CegarLoopResult]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-12-07 16:28:49,359 INFO L246 CegarLoopResult]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-12-07 16:28:49,359 INFO L246 CegarLoopResult]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,359 INFO L246 CegarLoopResult]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,359 INFO L246 CegarLoopResult]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,359 INFO L246 CegarLoopResult]: For program point L94(line 94) no Hoare annotation was computed. [2019-12-07 16:28:49,359 INFO L246 CegarLoopResult]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,359 INFO L246 CegarLoopResult]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,359 INFO L246 CegarLoopResult]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,359 INFO L246 CegarLoopResult]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,359 INFO L246 CegarLoopResult]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,359 INFO L246 CegarLoopResult]: For program point L97(line 97) no Hoare annotation was computed. [2019-12-07 16:28:49,359 INFO L246 CegarLoopResult]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,359 INFO L246 CegarLoopResult]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,359 INFO L246 CegarLoopResult]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-12-07 16:28:49,360 INFO L246 CegarLoopResult]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-12-07 16:28:49,360 INFO L246 CegarLoopResult]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,360 INFO L246 CegarLoopResult]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:28:49,360 INFO L246 CegarLoopResult]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-12-07 16:28:49,360 INFO L246 CegarLoopResult]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,360 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-12-07 16:28:49,360 INFO L246 CegarLoopResult]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,360 INFO L246 CegarLoopResult]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-12-07 16:28:49,360 INFO L246 CegarLoopResult]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-12-07 16:28:49,360 INFO L246 CegarLoopResult]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,360 INFO L246 CegarLoopResult]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,360 INFO L246 CegarLoopResult]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-12-07 16:28:49,360 INFO L246 CegarLoopResult]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-12-07 16:28:49,360 INFO L246 CegarLoopResult]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-12-07 16:28:49,368 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,385 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,385 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,385 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,385 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,385 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,387 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,387 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,388 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,388 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,388 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,390 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,390 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,390 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,390 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,390 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,392 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,392 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,392 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,392 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,392 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:28:49 BoogieIcfgContainer [2019-12-07 16:28:49,395 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:28:49,395 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:28:49,395 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:28:49,395 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:28:49,396 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:26:43" (3/4) ... [2019-12-07 16:28:49,398 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 16:28:49,421 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-12-07 16:28:49,424 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 16:28:49,445 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((a4 + 86 <= 0 && a4 + 89 <= 0) && 0 <= a4 + 89) && 1 == a2) && 0 <= a0 + 44) && a29 + 127 <= 0) && 0 <= a29 + 127) && a0 + 44 <= 0) || ((((a0 + 98 <= 0 && 0 <= a0 + 146) && !(4 == a2)) && 3 <= a2) && a2 <= 4)) || ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0) && a0 + 61 <= 0)) || ((((0 <= a0 + 599998 && a0 + 147 <= 0) && a29 <= 43) && 3 <= a2) && a2 <= 4)) || ((((a0 <= 599970 && ((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0)) && a4 + 86 <= 0) && 5 == a2) && !(4 == a2))) || ((a4 + 86 <= 0 && 0 < a0 + 98) && a0 + 61 <= 0)) || ((a0 <= 599970 && ((0 <= a0 + 44 && a2 <= 3) || ((a4 + 86 <= 0 && !(4 == a2)) && a2 <= 3))) && 3 <= a2)) || ((a4 + 86 <= 0 && 1 == a2) && a29 + 144 <= 0)) || ((0 <= a0 + 599998 && a0 + 147 <= 0) && 5 == a2)) || (((((a0 <= 599970 && a4 + 86 <= 0) && a29 + 16 <= 0) && 2 == a2) && !(4 == a2)) && 0 < a0 + 98)) || (((a0 + 98 <= 0 && 0 < a29 + 16) && 0 <= a0 + 146) && 2 == a2)) || (((a0 + 147 <= 0 && 3 <= a2) && a2 <= 4) && (\exists v_~a0~0_829 : int :: (((v_~a0~0_829 <= 599970 && 0 <= 10 * (v_~a0~0_829 / 5) + 3459790) && (v_~a0~0_829 / 5 * 10 + 3459790) / -9 <= a0) && 0 <= 10 * (v_~a0~0_829 / 5) + 3459800) && v_~a0~0_829 % 5 == 0))) || ((a29 <= 42 && ((a4 + 86 <= 0 && 13 <= a0) || (((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0))) && 4 == a2)) || ((((a0 + 98 <= 0 && 0 <= a0 + 146) && 3 <= a2) && a2 <= 4) && 43 < a29)) || ((((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0) && a29 <= 43) && 5 == a2) && !(4 == a2))) || ((a0 + 98 <= 0 && a29 <= 43) && 5 == a2)) || ((0 <= a0 + 599998 && a0 + 147 <= 0) && 2 == a2)) || (((((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0) && !(6 == input)) && 2 == a2) && !(4 == a2)) && 0 < a0 + 98)) || (((a0 + 98 <= 0 && 0 <= a0 + 146) && a0 + 38608 <= a4 + a29) && 5 == a2)) || (((((a0 <= 599970 && ((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0)) && 0 <= a0 + 599998) && 1 == a2) && a29 <= 43) && 0 < a29 + 144)) || ((((0 <= a0 + 44 && a2 <= 3) || ((a4 + 86 <= 0 && !(4 == a2)) && a2 <= 3)) && a29 + 144 <= 0) && 3 <= a2)) || ((0 <= a0 + 599998 && a0 + 147 <= 0) && 4 == a2)) || ((a0 + 98 <= 0 && 1 == a2) && 0 <= a0 + 146)) || ((a4 + 86 <= 0 && a0 + 61 <= 0) && !(4 == a2))) || (((0 <= a0 + 384412 && 1 == a2) && a0 + 147 <= 0) && 43 < a29) [2019-12-07 16:28:49,448 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((a4 + 86 <= 0 && a4 + 89 <= 0) && 0 <= a4 + 89) && 1 == a2) && 0 <= a0 + 44) && a29 + 127 <= 0) && 0 <= a29 + 127) && a0 + 44 <= 0) || ((((a0 + 98 <= 0 && 0 <= a0 + 146) && !(4 == a2)) && 3 <= a2) && a2 <= 4)) || ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0) && a0 + 61 <= 0)) || ((((0 <= a0 + 599998 && a0 + 147 <= 0) && a29 <= 43) && 3 <= a2) && a2 <= 4)) || ((((a0 <= 599970 && ((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0)) && a4 + 86 <= 0) && 5 == a2) && !(4 == a2))) || ((a4 + 86 <= 0 && 0 < a0 + 98) && a0 + 61 <= 0)) || ((a0 <= 599970 && ((0 <= a0 + 44 && a2 <= 3) || ((a4 + 86 <= 0 && !(4 == a2)) && a2 <= 3))) && 3 <= a2)) || ((a4 + 86 <= 0 && 1 == a2) && a29 + 144 <= 0)) || ((0 <= a0 + 599998 && a0 + 147 <= 0) && 5 == a2)) || (((((a0 <= 599970 && a4 + 86 <= 0) && a29 + 16 <= 0) && 2 == a2) && !(4 == a2)) && 0 < a0 + 98)) || (((a0 + 98 <= 0 && 0 < a29 + 16) && 0 <= a0 + 146) && 2 == a2)) || (((a0 + 147 <= 0 && 3 <= a2) && a2 <= 4) && (\exists v_~a0~0_829 : int :: (((v_~a0~0_829 <= 599970 && 0 <= 10 * (v_~a0~0_829 / 5) + 3459790) && (v_~a0~0_829 / 5 * 10 + 3459790) / -9 <= a0) && 0 <= 10 * (v_~a0~0_829 / 5) + 3459800) && v_~a0~0_829 % 5 == 0))) || ((a29 <= 42 && ((a4 + 86 <= 0 && 13 <= a0) || (((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0))) && 4 == a2)) || ((((a0 + 98 <= 0 && 0 <= a0 + 146) && 3 <= a2) && a2 <= 4) && 43 < a29)) || ((((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0) && a29 <= 43) && 5 == a2) && !(4 == a2))) || ((a0 + 98 <= 0 && a29 <= 43) && 5 == a2)) || ((0 <= a0 + 599998 && a0 + 147 <= 0) && 2 == a2)) || (((((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0) && !(6 == input)) && 2 == a2) && !(4 == a2)) && 0 < a0 + 98)) || (((a0 + 98 <= 0 && 0 <= a0 + 146) && a0 + 38608 <= a4 + a29) && 5 == a2)) || (((((a0 <= 599970 && ((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0)) && 0 <= a0 + 599998) && 1 == a2) && a29 <= 43) && 0 < a29 + 144)) || ((((0 <= a0 + 44 && a2 <= 3) || ((a4 + 86 <= 0 && !(4 == a2)) && a2 <= 3)) && a29 + 144 <= 0) && 3 <= a2)) || ((0 <= a0 + 599998 && a0 + 147 <= 0) && 4 == a2)) || ((a0 + 98 <= 0 && 1 == a2) && 0 <= a0 + 146)) || ((a4 + 86 <= 0 && a0 + 61 <= 0) && !(4 == a2))) || (((0 <= a0 + 384412 && 1 == a2) && a0 + 147 <= 0) && 43 < a29) [2019-12-07 16:28:49,459 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((a4 + 89 <= 0 && 0 <= a4 + 89) && 1 == a2) && 0 <= a0 + 44) && a29 + 127 <= 0) && 0 <= a29 + 127) && a0 + 44 <= 0) || ((((a0 + 98 <= 0 && 0 <= a0 + 146) && !(4 == a2)) && 3 <= a2) && a2 <= 4)) || ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0) && a0 + 61 <= 0)) || ((((a0 <= 599970 && ((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0)) && a4 + 86 <= 0) && 5 == a2) && !(4 == a2))) || ((((a0 <= 599970 && a4 + 86 <= 0) && a29 + 16 <= 0) && 2 == a2) && !(4 == a2))) || ((a4 + 86 <= 0 && 0 < a0 + 98) && a0 + 61 <= 0)) || (((0 <= a0 + 599998 && (0 < a4 + 42 || !(1 == input))) && a0 + 147 <= 0) && 4 == a2)) || (((0 <= a0 + 599998 && a29 <= 42) && a0 + 147 <= 0) && 4 == a2)) || ((0 <= a0 + 599998 && a0 + 147 <= 0) && 5 == a2)) || ((a0 <= 599970 && ((0 <= a0 + 44 && a2 <= 3) || ((a4 + 86 <= 0 && !(4 == a2)) && a2 <= 3))) && 3 <= a2)) || (((a0 + 98 <= 0 && 0 < a29 + 16) && 0 <= a0 + 146) && 2 == a2)) || (((((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && 0 <= a0 + 599998) && a0 <= 599970) && 1 == a2) && a29 <= 43) && 0 < a29 + 144)) || ((a29 <= 42 && ((a4 + 86 <= 0 && 13 <= a0) || (((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0))) && 4 == a2)) || (((((0 <= a0 + 599998 && a0 + 147 <= 0) && a29 <= 43) && !(4 == a2)) && 3 <= a2) && a2 <= 4)) || ((((a0 + 98 <= 0 && 0 <= a0 + 146) && 3 <= a2) && a2 <= 4) && 43 < a29)) || ((((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0) && a29 <= 43) && 5 == a2) && !(4 == a2))) || ((a0 + 98 <= 0 && a29 <= 43) && 5 == a2)) || ((0 <= a0 + 599998 && a0 + 147 <= 0) && 2 == a2)) || ((((a0 + 147 <= 0 && !(4 == a2)) && 3 <= a2) && a2 <= 4) && (\exists v_~a0~0_829 : int :: (((v_~a0~0_829 <= 599970 && 0 <= 10 * (v_~a0~0_829 / 5) + 3459790) && (v_~a0~0_829 / 5 * 10 + 3459790) / -9 <= a0) && 0 <= 10 * (v_~a0~0_829 / 5) + 3459800) && v_~a0~0_829 % 5 == 0))) || (((a0 + 98 <= 0 && 0 <= a0 + 146) && a0 + 38608 <= a4 + a29) && 5 == a2)) || ((a0 + 98 <= 0 && 1 == a2) && 0 <= a0 + 146)) || ((((0 < a4 + 86 || !(1 == input)) && ((0 <= a0 + 44 && a2 <= 3) || ((a4 + 86 <= 0 && !(4 == a2)) && a2 <= 3))) && a29 + 144 <= 0) && 3 <= a2)) || ((((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0) && !(6 == input)) && 2 == a2) && !(4 == a2))) || ((a4 + 86 <= 0 && a0 + 61 <= 0) && !(4 == a2))) || (((0 <= a0 + 384412 && 1 == a2) && a0 + 147 <= 0) && 43 < a29) [2019-12-07 16:28:49,586 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_477abee9-686b-48ae-8012-bab4e488a418/bin/uautomizer/witness.graphml [2019-12-07 16:28:49,586 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:28:49,587 INFO L168 Benchmark]: Toolchain (without parser) took 128589.60 ms. Allocated memory was 1.0 GB in the beginning and 3.3 GB in the end (delta: 2.3 GB). Free memory was 931.3 MB in the beginning and 2.9 GB in the end (delta: -2.0 GB). Peak memory consumption was 290.6 MB. Max. memory is 11.5 GB. [2019-12-07 16:28:49,587 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 960.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:28:49,587 INFO L168 Benchmark]: CACSL2BoogieTranslator took 698.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 930.2 MB in the beginning and 1.1 GB in the end (delta: -128.3 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. [2019-12-07 16:28:49,588 INFO L168 Benchmark]: Boogie Procedure Inliner took 112.07 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: 37.2 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2019-12-07 16:28:49,588 INFO L168 Benchmark]: Boogie Preprocessor took 132.34 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: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-12-07 16:28:49,588 INFO L168 Benchmark]: RCFGBuilder took 1846.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 934.6 MB in the end (delta: 66.2 MB). Peak memory consumption was 162.3 MB. Max. memory is 11.5 GB. [2019-12-07 16:28:49,588 INFO L168 Benchmark]: TraceAbstraction took 125605.56 ms. Allocated memory was 1.2 GB in the beginning and 3.3 GB in the end (delta: 2.1 GB). Free memory was 934.6 MB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2019-12-07 16:28:49,588 INFO L168 Benchmark]: Witness Printer took 191.26 ms. Allocated memory is still 3.3 GB. Free memory was 3.0 GB in the beginning and 2.9 GB in the end (delta: 63.9 MB). Peak memory consumption was 63.9 MB. Max. memory is 11.5 GB. [2019-12-07 16:28:49,590 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 960.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 698.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 930.2 MB in the beginning and 1.1 GB in the end (delta: -128.3 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 112.07 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: 37.2 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 132.34 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: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1846.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 934.6 MB in the end (delta: 66.2 MB). Peak memory consumption was 162.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 125605.56 ms. Allocated memory was 1.2 GB in the beginning and 3.3 GB in the end (delta: 2.1 GB). Free memory was 934.6 MB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. * Witness Printer took 191.26 ms. Allocated memory is still 3.3 GB. Free memory was 3.0 GB in the beginning and 2.9 GB in the end (delta: 63.9 MB). Peak memory consumption was 63.9 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_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 154]: 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: 1766]: Loop Invariant [2019-12-07 16:28:49,593 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,594 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,594 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,594 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,594 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,595 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,595 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,595 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,595 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,596 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((a4 + 86 <= 0 && a4 + 89 <= 0) && 0 <= a4 + 89) && 1 == a2) && 0 <= a0 + 44) && a29 + 127 <= 0) && 0 <= a29 + 127) && a0 + 44 <= 0) || ((((a0 + 98 <= 0 && 0 <= a0 + 146) && !(4 == a2)) && 3 <= a2) && a2 <= 4)) || ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0) && a0 + 61 <= 0)) || ((((0 <= a0 + 599998 && a0 + 147 <= 0) && a29 <= 43) && 3 <= a2) && a2 <= 4)) || ((((a0 <= 599970 && ((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0)) && a4 + 86 <= 0) && 5 == a2) && !(4 == a2))) || ((a4 + 86 <= 0 && 0 < a0 + 98) && a0 + 61 <= 0)) || ((a0 <= 599970 && ((0 <= a0 + 44 && a2 <= 3) || ((a4 + 86 <= 0 && !(4 == a2)) && a2 <= 3))) && 3 <= a2)) || ((a4 + 86 <= 0 && 1 == a2) && a29 + 144 <= 0)) || ((0 <= a0 + 599998 && a0 + 147 <= 0) && 5 == a2)) || (((((a0 <= 599970 && a4 + 86 <= 0) && a29 + 16 <= 0) && 2 == a2) && !(4 == a2)) && 0 < a0 + 98)) || (((a0 + 98 <= 0 && 0 < a29 + 16) && 0 <= a0 + 146) && 2 == a2)) || (((a0 + 147 <= 0 && 3 <= a2) && a2 <= 4) && (\exists v_~a0~0_829 : int :: (((v_~a0~0_829 <= 599970 && 0 <= 10 * (v_~a0~0_829 / 5) + 3459790) && (v_~a0~0_829 / 5 * 10 + 3459790) / -9 <= a0) && 0 <= 10 * (v_~a0~0_829 / 5) + 3459800) && v_~a0~0_829 % 5 == 0))) || ((a29 <= 42 && ((a4 + 86 <= 0 && 13 <= a0) || (((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0))) && 4 == a2)) || ((((a0 + 98 <= 0 && 0 <= a0 + 146) && 3 <= a2) && a2 <= 4) && 43 < a29)) || ((((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0) && a29 <= 43) && 5 == a2) && !(4 == a2))) || ((a0 + 98 <= 0 && a29 <= 43) && 5 == a2)) || ((0 <= a0 + 599998 && a0 + 147 <= 0) && 2 == a2)) || (((((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0) && !(6 == input)) && 2 == a2) && !(4 == a2)) && 0 < a0 + 98)) || (((a0 + 98 <= 0 && 0 <= a0 + 146) && a0 + 38608 <= a4 + a29) && 5 == a2)) || (((((a0 <= 599970 && ((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0)) && 0 <= a0 + 599998) && 1 == a2) && a29 <= 43) && 0 < a29 + 144)) || ((((0 <= a0 + 44 && a2 <= 3) || ((a4 + 86 <= 0 && !(4 == a2)) && a2 <= 3)) && a29 + 144 <= 0) && 3 <= a2)) || ((0 <= a0 + 599998 && a0 + 147 <= 0) && 4 == a2)) || ((a0 + 98 <= 0 && 1 == a2) && 0 <= a0 + 146)) || ((a4 + 86 <= 0 && a0 + 61 <= 0) && !(4 == a2))) || (((0 <= a0 + 384412 && 1 == a2) && a0 + 147 <= 0) && 43 < a29) - InvariantResult [Line: 23]: Loop Invariant [2019-12-07 16:28:49,596 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,597 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,597 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,597 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,597 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,598 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,598 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,598 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,598 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,598 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((a4 + 86 <= 0 && a4 + 89 <= 0) && 0 <= a4 + 89) && 1 == a2) && 0 <= a0 + 44) && a29 + 127 <= 0) && 0 <= a29 + 127) && a0 + 44 <= 0) || ((((a0 + 98 <= 0 && 0 <= a0 + 146) && !(4 == a2)) && 3 <= a2) && a2 <= 4)) || ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0) && a0 + 61 <= 0)) || ((((0 <= a0 + 599998 && a0 + 147 <= 0) && a29 <= 43) && 3 <= a2) && a2 <= 4)) || ((((a0 <= 599970 && ((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0)) && a4 + 86 <= 0) && 5 == a2) && !(4 == a2))) || ((a4 + 86 <= 0 && 0 < a0 + 98) && a0 + 61 <= 0)) || ((a0 <= 599970 && ((0 <= a0 + 44 && a2 <= 3) || ((a4 + 86 <= 0 && !(4 == a2)) && a2 <= 3))) && 3 <= a2)) || ((a4 + 86 <= 0 && 1 == a2) && a29 + 144 <= 0)) || ((0 <= a0 + 599998 && a0 + 147 <= 0) && 5 == a2)) || (((((a0 <= 599970 && a4 + 86 <= 0) && a29 + 16 <= 0) && 2 == a2) && !(4 == a2)) && 0 < a0 + 98)) || (((a0 + 98 <= 0 && 0 < a29 + 16) && 0 <= a0 + 146) && 2 == a2)) || (((a0 + 147 <= 0 && 3 <= a2) && a2 <= 4) && (\exists v_~a0~0_829 : int :: (((v_~a0~0_829 <= 599970 && 0 <= 10 * (v_~a0~0_829 / 5) + 3459790) && (v_~a0~0_829 / 5 * 10 + 3459790) / -9 <= a0) && 0 <= 10 * (v_~a0~0_829 / 5) + 3459800) && v_~a0~0_829 % 5 == 0))) || ((a29 <= 42 && ((a4 + 86 <= 0 && 13 <= a0) || (((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0))) && 4 == a2)) || ((((a0 + 98 <= 0 && 0 <= a0 + 146) && 3 <= a2) && a2 <= 4) && 43 < a29)) || ((((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0) && a29 <= 43) && 5 == a2) && !(4 == a2))) || ((a0 + 98 <= 0 && a29 <= 43) && 5 == a2)) || ((0 <= a0 + 599998 && a0 + 147 <= 0) && 2 == a2)) || (((((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0) && !(6 == input)) && 2 == a2) && !(4 == a2)) && 0 < a0 + 98)) || (((a0 + 98 <= 0 && 0 <= a0 + 146) && a0 + 38608 <= a4 + a29) && 5 == a2)) || (((((a0 <= 599970 && ((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0)) && 0 <= a0 + 599998) && 1 == a2) && a29 <= 43) && 0 < a29 + 144)) || ((((0 <= a0 + 44 && a2 <= 3) || ((a4 + 86 <= 0 && !(4 == a2)) && a2 <= 3)) && a29 + 144 <= 0) && 3 <= a2)) || ((0 <= a0 + 599998 && a0 + 147 <= 0) && 4 == a2)) || ((a0 + 98 <= 0 && 1 == a2) && 0 <= a0 + 146)) || ((a4 + 86 <= 0 && a0 + 61 <= 0) && !(4 == a2))) || (((0 <= a0 + 384412 && 1 == a2) && a0 + 147 <= 0) && 43 < a29) - InvariantResult [Line: 1658]: Loop Invariant [2019-12-07 16:28:49,599 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,599 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,599 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,599 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,599 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,600 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,600 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,600 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,600 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-12-07 16:28:49,601 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((a4 + 89 <= 0 && 0 <= a4 + 89) && 1 == a2) && 0 <= a0 + 44) && a29 + 127 <= 0) && 0 <= a29 + 127) && a0 + 44 <= 0) || ((((a0 + 98 <= 0 && 0 <= a0 + 146) && !(4 == a2)) && 3 <= a2) && a2 <= 4)) || ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0) && a0 + 61 <= 0)) || ((((a0 <= 599970 && ((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0)) && a4 + 86 <= 0) && 5 == a2) && !(4 == a2))) || ((((a0 <= 599970 && a4 + 86 <= 0) && a29 + 16 <= 0) && 2 == a2) && !(4 == a2))) || ((a4 + 86 <= 0 && 0 < a0 + 98) && a0 + 61 <= 0)) || (((0 <= a0 + 599998 && (0 < a4 + 42 || !(1 == input))) && a0 + 147 <= 0) && 4 == a2)) || (((0 <= a0 + 599998 && a29 <= 42) && a0 + 147 <= 0) && 4 == a2)) || ((0 <= a0 + 599998 && a0 + 147 <= 0) && 5 == a2)) || ((a0 <= 599970 && ((0 <= a0 + 44 && a2 <= 3) || ((a4 + 86 <= 0 && !(4 == a2)) && a2 <= 3))) && 3 <= a2)) || (((a0 + 98 <= 0 && 0 < a29 + 16) && 0 <= a0 + 146) && 2 == a2)) || (((((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && 0 <= a0 + 599998) && a0 <= 599970) && 1 == a2) && a29 <= 43) && 0 < a29 + 144)) || ((a29 <= 42 && ((a4 + 86 <= 0 && 13 <= a0) || (((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0))) && 4 == a2)) || (((((0 <= a0 + 599998 && a0 + 147 <= 0) && a29 <= 43) && !(4 == a2)) && 3 <= a2) && a2 <= 4)) || ((((a0 + 98 <= 0 && 0 <= a0 + 146) && 3 <= a2) && a2 <= 4) && 43 < a29)) || ((((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0) && a29 <= 43) && 5 == a2) && !(4 == a2))) || ((a0 + 98 <= 0 && a29 <= 43) && 5 == a2)) || ((0 <= a0 + 599998 && a0 + 147 <= 0) && 2 == a2)) || ((((a0 + 147 <= 0 && !(4 == a2)) && 3 <= a2) && a2 <= 4) && (\exists v_~a0~0_829 : int :: (((v_~a0~0_829 <= 599970 && 0 <= 10 * (v_~a0~0_829 / 5) + 3459790) && (v_~a0~0_829 / 5 * 10 + 3459790) / -9 <= a0) && 0 <= 10 * (v_~a0~0_829 / 5) + 3459800) && v_~a0~0_829 % 5 == 0))) || (((a0 + 98 <= 0 && 0 <= a0 + 146) && a0 + 38608 <= a4 + a29) && 5 == a2)) || ((a0 + 98 <= 0 && 1 == a2) && 0 <= a0 + 146)) || ((((0 < a4 + 86 || !(1 == input)) && ((0 <= a0 + 44 && a2 <= 3) || ((a4 + 86 <= 0 && !(4 == a2)) && a2 <= 3))) && a29 + 144 <= 0) && 3 <= a2)) || ((((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0) && !(6 == input)) && 2 == a2) && !(4 == a2))) || ((a4 + 86 <= 0 && a0 + 61 <= 0) && !(4 == a2))) || (((0 <= a0 + 384412 && 1 == a2) && a0 + 147 <= 0) && 43 < a29) - InvariantResult [Line: 1760]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Result: SAFE, OverallTime: 111.4s, OverallIterations: 24, TraceHistogramMax: 10, AutomataDifference: 68.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 14.1s, HoareTripleCheckerStatistics: 4778 SDtfs, 26407 SDslu, 1817 SDs, 0 SdLazy, 62557 SolverSat, 5141 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 54.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7636 GetRequests, 7449 SyntacticMatches, 32 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16842occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 24 MinimizatonAttempts, 40142 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 202 NumberOfFragments, 1859 HoareAnnotationTreeSize, 4 FomulaSimplifications, 559132 FormulaSimplificationTreeSizeReduction, 1.8s HoareSimplificationTime, 4 FomulaSimplificationsInter, 831462 FormulaSimplificationTreeSizeReductionInter, 12.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 16.0s InterpolantComputationTime, 27531 NumberOfCodeBlocks, 27531 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 27498 ConstructedInterpolants, 402 QuantifiedInterpolants, 140336809 SizeOfPredicates, 12 NumberOfNonLiveVariables, 8620 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 33 InterpolantComputations, 19 PerfectInterpolantSequences, 47366/56226 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...