./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 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4bb33fa7-be3a-4170-94e1-7abfd4ca95cb/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4bb33fa7-be3a-4170-94e1-7abfd4ca95cb/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4bb33fa7-be3a-4170-94e1-7abfd4ca95cb/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4bb33fa7-be3a-4170-94e1-7abfd4ca95cb/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label32.c -s /tmp/vcloud-vcloud-master/worker/run_dir_4bb33fa7-be3a-4170-94e1-7abfd4ca95cb/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4bb33fa7-be3a-4170-94e1-7abfd4ca95cb/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.24-678e011 [2019-11-20 04:42:02,894 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 04:42:02,895 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 04:42:02,905 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 04:42:02,906 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 04:42:02,907 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 04:42:02,908 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 04:42:02,910 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 04:42:02,912 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 04:42:02,913 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 04:42:02,914 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 04:42:02,915 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 04:42:02,915 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 04:42:02,916 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 04:42:02,918 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 04:42:02,919 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 04:42:02,919 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 04:42:02,920 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 04:42:02,922 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 04:42:02,924 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 04:42:02,926 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 04:42:02,927 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 04:42:02,928 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 04:42:02,929 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 04:42:02,931 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 04:42:02,932 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 04:42:02,932 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 04:42:02,933 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 04:42:02,933 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 04:42:02,934 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 04:42:02,935 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 04:42:02,935 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 04:42:02,936 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 04:42:02,937 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 04:42:02,938 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 04:42:02,938 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 04:42:02,939 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 04:42:02,939 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 04:42:02,939 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 04:42:02,940 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 04:42:02,941 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 04:42:02,941 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4bb33fa7-be3a-4170-94e1-7abfd4ca95cb/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 04:42:02,954 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 04:42:02,954 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 04:42:02,955 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 04:42:02,955 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 04:42:02,955 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 04:42:02,955 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 04:42:02,955 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 04:42:02,955 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 04:42:02,955 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 04:42:02,956 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 04:42:02,956 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 04:42:02,956 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 04:42:02,956 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 04:42:02,956 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 04:42:02,956 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 04:42:02,957 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 04:42:02,957 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 04:42:02,957 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 04:42:02,957 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 04:42:02,957 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 04:42:02,957 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 04:42:02,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 04:42:02,958 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 04:42:02,958 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 04:42:02,958 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 04:42:02,958 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 04:42:02,958 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 04:42:02,958 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 04:42:02,958 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_4bb33fa7-be3a-4170-94e1-7abfd4ca95cb/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-11-20 04:42:03,115 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 04:42:03,125 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 04:42:03,129 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 04:42:03,130 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 04:42:03,130 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 04:42:03,131 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4bb33fa7-be3a-4170-94e1-7abfd4ca95cb/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem15_label32.c [2019-11-20 04:42:03,181 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4bb33fa7-be3a-4170-94e1-7abfd4ca95cb/bin/uautomizer/data/4a2517daf/684947aaf95f4539b310c32512430947/FLAG845fabd07 [2019-11-20 04:42:03,792 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 04:42:03,795 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4bb33fa7-be3a-4170-94e1-7abfd4ca95cb/sv-benchmarks/c/eca-rers2012/Problem15_label32.c [2019-11-20 04:42:03,819 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4bb33fa7-be3a-4170-94e1-7abfd4ca95cb/bin/uautomizer/data/4a2517daf/684947aaf95f4539b310c32512430947/FLAG845fabd07 [2019-11-20 04:42:04,200 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4bb33fa7-be3a-4170-94e1-7abfd4ca95cb/bin/uautomizer/data/4a2517daf/684947aaf95f4539b310c32512430947 [2019-11-20 04:42:04,205 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 04:42:04,207 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 04:42:04,207 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 04:42:04,208 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 04:42:04,211 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 04:42:04,211 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:42:04" (1/1) ... [2019-11-20 04:42:04,213 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dad0900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:42:04, skipping insertion in model container [2019-11-20 04:42:04,213 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:42:04" (1/1) ... [2019-11-20 04:42:04,219 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 04:42:04,300 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 04:42:05,119 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 04:42:05,123 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 04:42:05,354 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 04:42:05,369 INFO L192 MainTranslator]: Completed translation [2019-11-20 04:42:05,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:42:05 WrapperNode [2019-11-20 04:42:05,370 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 04:42:05,371 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 04:42:05,371 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 04:42:05,371 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 04:42:05,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:42:05" (1/1) ... [2019-11-20 04:42:05,404 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:42:05" (1/1) ... [2019-11-20 04:42:05,531 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 04:42:05,532 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 04:42:05,532 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 04:42:05,532 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 04:42:05,541 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:42:05" (1/1) ... [2019-11-20 04:42:05,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:42:05" (1/1) ... [2019-11-20 04:42:05,559 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:42:05" (1/1) ... [2019-11-20 04:42:05,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:42:05" (1/1) ... [2019-11-20 04:42:05,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:42:05" (1/1) ... [2019-11-20 04:42:05,627 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:42:05" (1/1) ... [2019-11-20 04:42:05,648 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:42:05" (1/1) ... [2019-11-20 04:42:05,671 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 04:42:05,671 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 04:42:05,671 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 04:42:05,672 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 04:42:05,673 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:42:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4bb33fa7-be3a-4170-94e1-7abfd4ca95cb/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 04:42:05,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 04:42:05,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 04:42:08,926 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 04:42:08,926 INFO L285 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-20 04:42:08,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:42:08 BoogieIcfgContainer [2019-11-20 04:42:08,928 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 04:42:08,929 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 04:42:08,929 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 04:42:08,932 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 04:42:08,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:42:04" (1/3) ... [2019-11-20 04:42:08,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3084ada2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:42:08, skipping insertion in model container [2019-11-20 04:42:08,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:42:05" (2/3) ... [2019-11-20 04:42:08,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3084ada2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:42:08, skipping insertion in model container [2019-11-20 04:42:08,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:42:08" (3/3) ... [2019-11-20 04:42:08,936 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label32.c [2019-11-20 04:42:08,946 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 04:42:08,953 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 04:42:08,965 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 04:42:09,011 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 04:42:09,011 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 04:42:09,011 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 04:42:09,011 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 04:42:09,011 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 04:42:09,011 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 04:42:09,012 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 04:42:09,012 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 04:42:09,044 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-11-20 04:42:09,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-20 04:42:09,053 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:42:09,053 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-11-20 04:42:09,054 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:42:09,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:42:09,060 INFO L82 PathProgramCache]: Analyzing trace with hash 301649817, now seen corresponding path program 1 times [2019-11-20 04:42:09,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:42:09,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193621869] [2019-11-20 04:42:09,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:42:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:42:09,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:42:09,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193621869] [2019-11-20 04:42:09,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:42:09,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:42:09,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455687635] [2019-11-20 04:42:09,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:42:09,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:42:09,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:42:09,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:42:09,417 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-11-20 04:42:13,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:42:13,425 INFO L93 Difference]: Finished difference Result 1466 states and 2714 transitions. [2019-11-20 04:42:13,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:42:13,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-20 04:42:13,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:42:13,453 INFO L225 Difference]: With dead ends: 1466 [2019-11-20 04:42:13,454 INFO L226 Difference]: Without dead ends: 975 [2019-11-20 04:42:13,458 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:42:13,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2019-11-20 04:42:13,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 973. [2019-11-20 04:42:13,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 973 states. [2019-11-20 04:42:13,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1485 transitions. [2019-11-20 04:42:13,553 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1485 transitions. Word has length 49 [2019-11-20 04:42:13,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:42:13,554 INFO L462 AbstractCegarLoop]: Abstraction has 973 states and 1485 transitions. [2019-11-20 04:42:13,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:42:13,554 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1485 transitions. [2019-11-20 04:42:13,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-20 04:42:13,563 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:42:13,563 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-11-20 04:42:13,564 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:42:13,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:42:13,564 INFO L82 PathProgramCache]: Analyzing trace with hash -602741442, now seen corresponding path program 1 times [2019-11-20 04:42:13,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:42:13,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296542386] [2019-11-20 04:42:13,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:42:13,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:42:13,824 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:42:13,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296542386] [2019-11-20 04:42:13,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:42:13,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:42:13,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637788988] [2019-11-20 04:42:13,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:42:13,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:42:13,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:42:13,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:42:13,829 INFO L87 Difference]: Start difference. First operand 973 states and 1485 transitions. Second operand 4 states. [2019-11-20 04:42:16,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:42:16,887 INFO L93 Difference]: Finished difference Result 3745 states and 5745 transitions. [2019-11-20 04:42:16,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:42:16,888 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-11-20 04:42:16,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:42:16,903 INFO L225 Difference]: With dead ends: 3745 [2019-11-20 04:42:16,903 INFO L226 Difference]: Without dead ends: 2774 [2019-11-20 04:42:16,909 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:42:16,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states. [2019-11-20 04:42:16,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 1871. [2019-11-20 04:42:16,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1871 states. [2019-11-20 04:42:16,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1871 states and 2498 transitions. [2019-11-20 04:42:16,970 INFO L78 Accepts]: Start accepts. Automaton has 1871 states and 2498 transitions. Word has length 161 [2019-11-20 04:42:16,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:42:16,973 INFO L462 AbstractCegarLoop]: Abstraction has 1871 states and 2498 transitions. [2019-11-20 04:42:16,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:42:16,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2498 transitions. [2019-11-20 04:42:16,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-11-20 04:42:16,991 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:42:16,992 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-11-20 04:42:16,992 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:42:16,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:42:16,993 INFO L82 PathProgramCache]: Analyzing trace with hash 172169868, now seen corresponding path program 1 times [2019-11-20 04:42:16,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:42:16,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604062266] [2019-11-20 04:42:16,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:42:17,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:42:17,827 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-11-20 04:42:17,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604062266] [2019-11-20 04:42:17,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:42:17,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:42:17,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611119120] [2019-11-20 04:42:17,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 04:42:17,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:42:17,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 04:42:17,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:42:17,830 INFO L87 Difference]: Start difference. First operand 1871 states and 2498 transitions. Second operand 5 states. [2019-11-20 04:42:21,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:42:21,829 INFO L93 Difference]: Finished difference Result 4639 states and 5973 transitions. [2019-11-20 04:42:21,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:42:21,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 321 [2019-11-20 04:42:21,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:42:21,843 INFO L225 Difference]: With dead ends: 4639 [2019-11-20 04:42:21,843 INFO L226 Difference]: Without dead ends: 2770 [2019-11-20 04:42:21,846 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-11-20 04:42:21,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2770 states. [2019-11-20 04:42:21,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2770 to 2470. [2019-11-20 04:42:21,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2470 states. [2019-11-20 04:42:21,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2470 states to 2470 states and 3139 transitions. [2019-11-20 04:42:21,896 INFO L78 Accepts]: Start accepts. Automaton has 2470 states and 3139 transitions. Word has length 321 [2019-11-20 04:42:21,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:42:21,897 INFO L462 AbstractCegarLoop]: Abstraction has 2470 states and 3139 transitions. [2019-11-20 04:42:21,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 04:42:21,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2470 states and 3139 transitions. [2019-11-20 04:42:21,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2019-11-20 04:42:21,904 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:42:21,904 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-11-20 04:42:21,905 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:42:21,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:42:21,905 INFO L82 PathProgramCache]: Analyzing trace with hash 591064250, now seen corresponding path program 1 times [2019-11-20 04:42:21,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:42:21,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326046251] [2019-11-20 04:42:21,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:42:21,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:42:22,785 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 86 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:42:22,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326046251] [2019-11-20 04:42:22,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961440411] [2019-11-20 04:42:22,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4bb33fa7-be3a-4170-94e1-7abfd4ca95cb/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:42:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:42:22,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 04:42:22,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:42:23,207 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:42:23,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 04:42:23,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2019-11-20 04:42:23,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738419454] [2019-11-20 04:42:23,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:42:23,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:42:23,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:42:23,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-20 04:42:23,210 INFO L87 Difference]: Start difference. First operand 2470 states and 3139 transitions. Second operand 3 states. [2019-11-20 04:42:25,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:42:25,375 INFO L93 Difference]: Finished difference Result 5547 states and 7133 transitions. [2019-11-20 04:42:25,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:42:25,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 395 [2019-11-20 04:42:25,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:42:25,391 INFO L225 Difference]: With dead ends: 5547 [2019-11-20 04:42:25,391 INFO L226 Difference]: Without dead ends: 3079 [2019-11-20 04:42:25,395 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 395 SyntacticMatches, 9 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-20 04:42:25,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3079 states. [2019-11-20 04:42:25,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3079 to 3077. [2019-11-20 04:42:25,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3077 states. [2019-11-20 04:42:25,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3077 states to 3077 states and 3865 transitions. [2019-11-20 04:42:25,453 INFO L78 Accepts]: Start accepts. Automaton has 3077 states and 3865 transitions. Word has length 395 [2019-11-20 04:42:25,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:42:25,454 INFO L462 AbstractCegarLoop]: Abstraction has 3077 states and 3865 transitions. [2019-11-20 04:42:25,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:42:25,455 INFO L276 IsEmpty]: Start isEmpty. Operand 3077 states and 3865 transitions. [2019-11-20 04:42:25,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-11-20 04:42:25,462 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:42:25,463 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-11-20 04:42:25,675 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:42:25,676 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:42:25,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:42:25,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1003761663, now seen corresponding path program 1 times [2019-11-20 04:42:25,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:42:25,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700165567] [2019-11-20 04:42:25,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:42:25,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:42:26,731 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 331 proven. 3 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-11-20 04:42:26,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700165567] [2019-11-20 04:42:26,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172333668] [2019-11-20 04:42:26,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4bb33fa7-be3a-4170-94e1-7abfd4ca95cb/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:42:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:42:26,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 04:42:26,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:42:27,011 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-11-20 04:42:27,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 04:42:27,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-20 04:42:27,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825682855] [2019-11-20 04:42:27,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:42:27,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:42:27,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:42:27,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-20 04:42:27,014 INFO L87 Difference]: Start difference. First operand 3077 states and 3865 transitions. Second operand 3 states. [2019-11-20 04:42:29,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:42:29,051 INFO L93 Difference]: Finished difference Result 6750 states and 8572 transitions. [2019-11-20 04:42:29,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:42:29,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 412 [2019-11-20 04:42:29,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:42:29,069 INFO L225 Difference]: With dead ends: 6750 [2019-11-20 04:42:29,069 INFO L226 Difference]: Without dead ends: 3675 [2019-11-20 04:42:29,072 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 411 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-20 04:42:29,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3675 states. [2019-11-20 04:42:29,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3675 to 3675. [2019-11-20 04:42:29,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3675 states. [2019-11-20 04:42:29,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3675 states to 3675 states and 4637 transitions. [2019-11-20 04:42:29,136 INFO L78 Accepts]: Start accepts. Automaton has 3675 states and 4637 transitions. Word has length 412 [2019-11-20 04:42:29,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:42:29,137 INFO L462 AbstractCegarLoop]: Abstraction has 3675 states and 4637 transitions. [2019-11-20 04:42:29,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:42:29,137 INFO L276 IsEmpty]: Start isEmpty. Operand 3675 states and 4637 transitions. [2019-11-20 04:42:29,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2019-11-20 04:42:29,147 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:42:29,148 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-11-20 04:42:29,351 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:42:29,352 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:42:29,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:42:29,352 INFO L82 PathProgramCache]: Analyzing trace with hash 728013481, now seen corresponding path program 1 times [2019-11-20 04:42:29,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:42:29,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910809726] [2019-11-20 04:42:29,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:42:29,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:42:29,977 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2019-11-20 04:42:29,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910809726] [2019-11-20 04:42:29,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179743608] [2019-11-20 04:42:29,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4bb33fa7-be3a-4170-94e1-7abfd4ca95cb/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:42:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:42:30,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 04:42:30,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:42:30,643 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2019-11-20 04:42:30,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 04:42:30,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2019-11-20 04:42:30,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224997225] [2019-11-20 04:42:30,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:42:30,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:42:30,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:42:30,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:42:30,648 INFO L87 Difference]: Start difference. First operand 3675 states and 4637 transitions. Second operand 3 states. [2019-11-20 04:42:32,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:42:32,733 INFO L93 Difference]: Finished difference Result 9146 states and 11374 transitions. [2019-11-20 04:42:32,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:42:32,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 508 [2019-11-20 04:42:32,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:42:32,763 INFO L225 Difference]: With dead ends: 9146 [2019-11-20 04:42:32,763 INFO L226 Difference]: Without dead ends: 5473 [2019-11-20 04:42:32,769 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-11-20 04:42:32,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5473 states. [2019-11-20 04:42:32,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5473 to 5172. [2019-11-20 04:42:32,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5172 states. [2019-11-20 04:42:32,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5172 states to 5172 states and 6291 transitions. [2019-11-20 04:42:32,869 INFO L78 Accepts]: Start accepts. Automaton has 5172 states and 6291 transitions. Word has length 508 [2019-11-20 04:42:32,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:42:32,879 INFO L462 AbstractCegarLoop]: Abstraction has 5172 states and 6291 transitions. [2019-11-20 04:42:32,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:42:32,879 INFO L276 IsEmpty]: Start isEmpty. Operand 5172 states and 6291 transitions. [2019-11-20 04:42:32,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2019-11-20 04:42:32,885 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:42:32,886 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-11-20 04:42:33,089 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:42:33,090 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:42:33,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:42:33,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1513408573, now seen corresponding path program 1 times [2019-11-20 04:42:33,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:42:33,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693295005] [2019-11-20 04:42:33,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:42:33,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:42:33,598 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2019-11-20 04:42:33,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693295005] [2019-11-20 04:42:33,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:42:33,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:42:33,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556339903] [2019-11-20 04:42:33,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:42:33,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:42:33,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:42:33,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:42:33,602 INFO L87 Difference]: Start difference. First operand 5172 states and 6291 transitions. Second operand 3 states. [2019-11-20 04:42:35,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:42:35,557 INFO L93 Difference]: Finished difference Result 13927 states and 17103 transitions. [2019-11-20 04:42:35,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:42:35,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 523 [2019-11-20 04:42:35,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:42:35,589 INFO L225 Difference]: With dead ends: 13927 [2019-11-20 04:42:35,590 INFO L226 Difference]: Without dead ends: 8757 [2019-11-20 04:42:35,595 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-11-20 04:42:35,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8757 states. [2019-11-20 04:42:35,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8757 to 5765. [2019-11-20 04:42:35,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5765 states. [2019-11-20 04:42:35,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5765 states to 5765 states and 7156 transitions. [2019-11-20 04:42:35,698 INFO L78 Accepts]: Start accepts. Automaton has 5765 states and 7156 transitions. Word has length 523 [2019-11-20 04:42:35,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:42:35,699 INFO L462 AbstractCegarLoop]: Abstraction has 5765 states and 7156 transitions. [2019-11-20 04:42:35,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:42:35,699 INFO L276 IsEmpty]: Start isEmpty. Operand 5765 states and 7156 transitions. [2019-11-20 04:42:35,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2019-11-20 04:42:35,705 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:42:35,706 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-11-20 04:42:35,706 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:42:35,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:42:35,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1542699677, now seen corresponding path program 1 times [2019-11-20 04:42:35,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:42:35,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608410799] [2019-11-20 04:42:35,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:42:35,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:42:36,639 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 297 proven. 134 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 04:42:36,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608410799] [2019-11-20 04:42:36,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003595088] [2019-11-20 04:42:36,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4bb33fa7-be3a-4170-94e1-7abfd4ca95cb/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:42:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:42:36,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 654 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 04:42:36,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:42:36,986 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 364 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-20 04:42:36,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 04:42:36,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-11-20 04:42:36,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074559990] [2019-11-20 04:42:36,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:42:36,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:42:36,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:42:36,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-20 04:42:36,989 INFO L87 Difference]: Start difference. First operand 5765 states and 7156 transitions. Second operand 3 states. [2019-11-20 04:42:38,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:42:38,725 INFO L93 Difference]: Finished difference Result 11529 states and 14313 transitions. [2019-11-20 04:42:38,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:42:38,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 546 [2019-11-20 04:42:38,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:42:38,736 INFO L225 Difference]: With dead ends: 11529 [2019-11-20 04:42:38,736 INFO L226 Difference]: Without dead ends: 5766 [2019-11-20 04:42:38,741 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 559 GetRequests, 547 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-20 04:42:38,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5766 states. [2019-11-20 04:42:38,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5766 to 5765. [2019-11-20 04:42:38,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5765 states. [2019-11-20 04:42:38,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5765 states to 5765 states and 6711 transitions. [2019-11-20 04:42:38,822 INFO L78 Accepts]: Start accepts. Automaton has 5765 states and 6711 transitions. Word has length 546 [2019-11-20 04:42:38,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:42:38,823 INFO L462 AbstractCegarLoop]: Abstraction has 5765 states and 6711 transitions. [2019-11-20 04:42:38,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:42:38,824 INFO L276 IsEmpty]: Start isEmpty. Operand 5765 states and 6711 transitions. [2019-11-20 04:42:38,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2019-11-20 04:42:38,830 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:42:38,831 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-11-20 04:42:39,034 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:42:39,037 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:42:39,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:42:39,037 INFO L82 PathProgramCache]: Analyzing trace with hash 737054137, now seen corresponding path program 1 times [2019-11-20 04:42:39,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:42:39,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782356760] [2019-11-20 04:42:39,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:42:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:42:40,197 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 585 proven. 3 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2019-11-20 04:42:40,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782356760] [2019-11-20 04:42:40,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523058564] [2019-11-20 04:42:40,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4bb33fa7-be3a-4170-94e1-7abfd4ca95cb/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:42:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:42:40,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 04:42:40,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:42:40,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:42:40,743 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 549 proven. 39 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2019-11-20 04:42:40,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:42:40,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-11-20 04:42:40,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919400739] [2019-11-20 04:42:40,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 04:42:40,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:42:40,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 04:42:40,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-20 04:42:40,746 INFO L87 Difference]: Start difference. First operand 5765 states and 6711 transitions. Second operand 9 states. [2019-11-20 04:42:46,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:42:46,048 INFO L93 Difference]: Finished difference Result 16467 states and 18955 transitions. [2019-11-20 04:42:46,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 04:42:46,048 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 576 [2019-11-20 04:42:46,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:42:46,060 INFO L225 Difference]: With dead ends: 16467 [2019-11-20 04:42:46,060 INFO L226 Difference]: Without dead ends: 7558 [2019-11-20 04:42:46,068 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 587 GetRequests, 573 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-11-20 04:42:46,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7558 states. [2019-11-20 04:42:46,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7558 to 7258. [2019-11-20 04:42:46,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7258 states. [2019-11-20 04:42:46,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7258 states to 7258 states and 7732 transitions. [2019-11-20 04:42:46,160 INFO L78 Accepts]: Start accepts. Automaton has 7258 states and 7732 transitions. Word has length 576 [2019-11-20 04:42:46,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:42:46,160 INFO L462 AbstractCegarLoop]: Abstraction has 7258 states and 7732 transitions. [2019-11-20 04:42:46,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 04:42:46,161 INFO L276 IsEmpty]: Start isEmpty. Operand 7258 states and 7732 transitions. [2019-11-20 04:42:46,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2019-11-20 04:42:46,166 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:42:46,167 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-11-20 04:42:46,370 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:42:46,370 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:42:46,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:42:46,371 INFO L82 PathProgramCache]: Analyzing trace with hash 766630606, now seen corresponding path program 1 times [2019-11-20 04:42:46,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:42:46,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189643539] [2019-11-20 04:42:46,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:42:46,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:42:46,763 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 396 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-20 04:42:46,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189643539] [2019-11-20 04:42:46,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:42:46,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:42:46,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95064699] [2019-11-20 04:42:46,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:42:46,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:42:46,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:42:46,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:42:46,766 INFO L87 Difference]: Start difference. First operand 7258 states and 7732 transitions. Second operand 3 states. [2019-11-20 04:42:47,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:42:47,891 INFO L93 Difference]: Finished difference Result 17505 states and 18653 transitions. [2019-11-20 04:42:47,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:42:47,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 576 [2019-11-20 04:42:47,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:42:47,909 INFO L225 Difference]: With dead ends: 17505 [2019-11-20 04:42:47,910 INFO L226 Difference]: Without dead ends: 10249 [2019-11-20 04:42:47,917 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-11-20 04:42:47,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10249 states. [2019-11-20 04:42:48,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10249 to 9053. [2019-11-20 04:42:48,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9053 states. [2019-11-20 04:42:48,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9053 states to 9053 states and 9641 transitions. [2019-11-20 04:42:48,059 INFO L78 Accepts]: Start accepts. Automaton has 9053 states and 9641 transitions. Word has length 576 [2019-11-20 04:42:48,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:42:48,060 INFO L462 AbstractCegarLoop]: Abstraction has 9053 states and 9641 transitions. [2019-11-20 04:42:48,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:42:48,060 INFO L276 IsEmpty]: Start isEmpty. Operand 9053 states and 9641 transitions. [2019-11-20 04:42:48,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2019-11-20 04:42:48,068 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:42:48,069 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-11-20 04:42:48,069 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:42:48,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:42:48,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1687499565, now seen corresponding path program 1 times [2019-11-20 04:42:48,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:42:48,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641799088] [2019-11-20 04:42:48,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:42:48,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:42:50,006 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 151 proven. 328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:42:50,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641799088] [2019-11-20 04:42:50,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689308157] [2019-11-20 04:42:50,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4bb33fa7-be3a-4170-94e1-7abfd4ca95cb/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:42:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:42:50,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 04:42:50,156 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:42:50,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:42:50,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:42:50,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:42:50,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:42:50,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:42:50,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:42:50,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:42:50,761 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 244 proven. 47 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-11-20 04:42:50,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:42:50,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4] total 13 [2019-11-20 04:42:50,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926328089] [2019-11-20 04:42:50,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 04:42:50,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:42:50,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 04:42:50,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-11-20 04:42:50,769 INFO L87 Difference]: Start difference. First operand 9053 states and 9641 transitions. Second operand 13 states. [2019-11-20 04:43:02,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:43:02,564 INFO L93 Difference]: Finished difference Result 29822 states and 31778 transitions. [2019-11-20 04:43:02,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-20 04:43:02,565 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 584 [2019-11-20 04:43:02,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:43:02,588 INFO L225 Difference]: With dead ends: 29822 [2019-11-20 04:43:02,588 INFO L226 Difference]: Without dead ends: 19874 [2019-11-20 04:43:02,597 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 596 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=655, Unknown=0, NotChecked=0, Total=812 [2019-11-20 04:43:02,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19874 states. [2019-11-20 04:43:02,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19874 to 16842. [2019-11-20 04:43:02,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16842 states. [2019-11-20 04:43:02,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16842 states to 16842 states and 17643 transitions. [2019-11-20 04:43:02,803 INFO L78 Accepts]: Start accepts. Automaton has 16842 states and 17643 transitions. Word has length 584 [2019-11-20 04:43:02,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:43:02,804 INFO L462 AbstractCegarLoop]: Abstraction has 16842 states and 17643 transitions. [2019-11-20 04:43:02,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 04:43:02,804 INFO L276 IsEmpty]: Start isEmpty. Operand 16842 states and 17643 transitions. [2019-11-20 04:43:02,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 683 [2019-11-20 04:43:02,816 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:43:02,817 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-11-20 04:43:03,020 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:43:03,020 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:43:03,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:43:03,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1622617196, now seen corresponding path program 1 times [2019-11-20 04:43:03,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:43:03,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779608783] [2019-11-20 04:43:03,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:43:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:43:03,562 INFO L134 CoverageAnalysis]: Checked inductivity of 863 backedges. 529 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2019-11-20 04:43:03,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779608783] [2019-11-20 04:43:03,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:43:03,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 04:43:03,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848580399] [2019-11-20 04:43:03,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 04:43:03,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:43:03,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 04:43:03,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:43:03,565 INFO L87 Difference]: Start difference. First operand 16842 states and 17643 transitions. Second operand 5 states. [2019-11-20 04:43:05,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:43:05,207 INFO L93 Difference]: Finished difference Result 29152 states and 30562 transitions. [2019-11-20 04:43:05,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 04:43:05,208 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 682 [2019-11-20 04:43:05,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:43:05,222 INFO L225 Difference]: With dead ends: 29152 [2019-11-20 04:43:05,222 INFO L226 Difference]: Without dead ends: 14108 [2019-11-20 04:43:05,234 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-11-20 04:43:05,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14108 states. [2019-11-20 04:43:05,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14108 to 10512. [2019-11-20 04:43:05,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10512 states. [2019-11-20 04:43:05,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10512 states to 10512 states and 10861 transitions. [2019-11-20 04:43:05,359 INFO L78 Accepts]: Start accepts. Automaton has 10512 states and 10861 transitions. Word has length 682 [2019-11-20 04:43:05,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:43:05,360 INFO L462 AbstractCegarLoop]: Abstraction has 10512 states and 10861 transitions. [2019-11-20 04:43:05,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 04:43:05,360 INFO L276 IsEmpty]: Start isEmpty. Operand 10512 states and 10861 transitions. [2019-11-20 04:43:05,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 753 [2019-11-20 04:43:05,372 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:43:05,373 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-11-20 04:43:05,373 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:43:05,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:43:05,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1427691895, now seen corresponding path program 1 times [2019-11-20 04:43:05,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:43:05,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629840996] [2019-11-20 04:43:05,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:43:05,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:43:06,060 INFO L134 CoverageAnalysis]: Checked inductivity of 913 backedges. 566 proven. 0 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2019-11-20 04:43:06,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629840996] [2019-11-20 04:43:06,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:43:06,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 04:43:06,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69527498] [2019-11-20 04:43:06,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 04:43:06,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:43:06,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 04:43:06,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:43:06,062 INFO L87 Difference]: Start difference. First operand 10512 states and 10861 transitions. Second operand 5 states. [2019-11-20 04:43:07,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:43:07,832 INFO L93 Difference]: Finished difference Result 15315 states and 15856 transitions. [2019-11-20 04:43:07,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 04:43:07,832 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 752 [2019-11-20 04:43:07,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:43:07,851 INFO L225 Difference]: With dead ends: 15315 [2019-11-20 04:43:07,851 INFO L226 Difference]: Without dead ends: 15313 [2019-11-20 04:43:07,854 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-11-20 04:43:07,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15313 states. [2019-11-20 04:43:07,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15313 to 12316. [2019-11-20 04:43:07,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12316 states. [2019-11-20 04:43:07,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12316 states to 12316 states and 12759 transitions. [2019-11-20 04:43:07,997 INFO L78 Accepts]: Start accepts. Automaton has 12316 states and 12759 transitions. Word has length 752 [2019-11-20 04:43:07,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:43:07,998 INFO L462 AbstractCegarLoop]: Abstraction has 12316 states and 12759 transitions. [2019-11-20 04:43:07,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 04:43:07,998 INFO L276 IsEmpty]: Start isEmpty. Operand 12316 states and 12759 transitions. [2019-11-20 04:43:08,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 838 [2019-11-20 04:43:08,016 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:43:08,017 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-11-20 04:43:08,017 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:43:08,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:43:08,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1048499012, now seen corresponding path program 1 times [2019-11-20 04:43:08,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:43:08,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816383531] [2019-11-20 04:43:08,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:43:08,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:43:08,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1029 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 842 trivial. 0 not checked. [2019-11-20 04:43:08,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816383531] [2019-11-20 04:43:08,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:43:08,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:43:08,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483216984] [2019-11-20 04:43:08,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:43:08,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:43:08,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:43:08,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:43:08,608 INFO L87 Difference]: Start difference. First operand 12316 states and 12759 transitions. Second operand 3 states. [2019-11-20 04:43:09,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:43:09,499 INFO L93 Difference]: Finished difference Result 23430 states and 24303 transitions. [2019-11-20 04:43:09,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:43:09,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 837 [2019-11-20 04:43:09,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:43:09,512 INFO L225 Difference]: With dead ends: 23430 [2019-11-20 04:43:09,512 INFO L226 Difference]: Without dead ends: 12912 [2019-11-20 04:43:09,517 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-11-20 04:43:09,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12912 states. [2019-11-20 04:43:09,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12912 to 11114. [2019-11-20 04:43:09,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11114 states. [2019-11-20 04:43:09,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11114 states to 11114 states and 11417 transitions. [2019-11-20 04:43:09,628 INFO L78 Accepts]: Start accepts. Automaton has 11114 states and 11417 transitions. Word has length 837 [2019-11-20 04:43:09,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:43:09,629 INFO L462 AbstractCegarLoop]: Abstraction has 11114 states and 11417 transitions. [2019-11-20 04:43:09,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:43:09,629 INFO L276 IsEmpty]: Start isEmpty. Operand 11114 states and 11417 transitions. [2019-11-20 04:43:09,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 842 [2019-11-20 04:43:09,652 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:43:09,653 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-11-20 04:43:09,653 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:43:09,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:43:09,654 INFO L82 PathProgramCache]: Analyzing trace with hash 859414251, now seen corresponding path program 1 times [2019-11-20 04:43:09,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:43:09,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824368285] [2019-11-20 04:43:09,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:43:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:43:10,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 593 proven. 0 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2019-11-20 04:43:10,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824368285] [2019-11-20 04:43:10,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:43:10,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:43:10,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355420098] [2019-11-20 04:43:10,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:43:10,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:43:10,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:43:10,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:43:10,350 INFO L87 Difference]: Start difference. First operand 11114 states and 11417 transitions. Second operand 4 states. [2019-11-20 04:43:11,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:43:11,662 INFO L93 Difference]: Finished difference Result 21631 states and 22229 transitions. [2019-11-20 04:43:11,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:43:11,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 841 [2019-11-20 04:43:11,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:43:11,673 INFO L225 Difference]: With dead ends: 21631 [2019-11-20 04:43:11,673 INFO L226 Difference]: Without dead ends: 11117 [2019-11-20 04:43:11,678 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-11-20 04:43:11,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11117 states. [2019-11-20 04:43:11,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11117 to 10815. [2019-11-20 04:43:11,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10815 states. [2019-11-20 04:43:11,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10815 states to 10815 states and 11056 transitions. [2019-11-20 04:43:11,765 INFO L78 Accepts]: Start accepts. Automaton has 10815 states and 11056 transitions. Word has length 841 [2019-11-20 04:43:11,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:43:11,766 INFO L462 AbstractCegarLoop]: Abstraction has 10815 states and 11056 transitions. [2019-11-20 04:43:11,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:43:11,766 INFO L276 IsEmpty]: Start isEmpty. Operand 10815 states and 11056 transitions. [2019-11-20 04:43:11,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 971 [2019-11-20 04:43:11,786 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:43:11,786 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-11-20 04:43:11,787 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:43:11,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:43:11,787 INFO L82 PathProgramCache]: Analyzing trace with hash -2128403174, now seen corresponding path program 1 times [2019-11-20 04:43:11,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:43:11,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133751352] [2019-11-20 04:43:11,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:43:11,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:43:12,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 636 proven. 0 refuted. 0 times theorem prover too weak. 699 trivial. 0 not checked. [2019-11-20 04:43:12,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133751352] [2019-11-20 04:43:12,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:43:12,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:43:12,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340335402] [2019-11-20 04:43:12,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:43:12,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:43:12,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:43:12,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:43:12,712 INFO L87 Difference]: Start difference. First operand 10815 states and 11056 transitions. Second operand 3 states. [2019-11-20 04:43:13,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:43:13,597 INFO L93 Difference]: Finished difference Result 25823 states and 26410 transitions. [2019-11-20 04:43:13,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:43:13,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 970 [2019-11-20 04:43:13,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:43:13,609 INFO L225 Difference]: With dead ends: 25823 [2019-11-20 04:43:13,609 INFO L226 Difference]: Without dead ends: 15309 [2019-11-20 04:43:13,615 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-11-20 04:43:13,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15309 states. [2019-11-20 04:43:13,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15309 to 14105. [2019-11-20 04:43:13,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14105 states. [2019-11-20 04:43:13,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14105 states to 14105 states and 14381 transitions. [2019-11-20 04:43:13,733 INFO L78 Accepts]: Start accepts. Automaton has 14105 states and 14381 transitions. Word has length 970 [2019-11-20 04:43:13,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:43:13,734 INFO L462 AbstractCegarLoop]: Abstraction has 14105 states and 14381 transitions. [2019-11-20 04:43:13,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:43:13,735 INFO L276 IsEmpty]: Start isEmpty. Operand 14105 states and 14381 transitions. [2019-11-20 04:43:13,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1045 [2019-11-20 04:43:13,759 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:43:13,760 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-11-20 04:43:13,760 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:43:13,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:43:13,761 INFO L82 PathProgramCache]: Analyzing trace with hash 738593332, now seen corresponding path program 1 times [2019-11-20 04:43:13,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:43:13,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349511664] [2019-11-20 04:43:13,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:43:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:43:14,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1660 backedges. 1069 proven. 0 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2019-11-20 04:43:14,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349511664] [2019-11-20 04:43:14,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:43:14,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:43:14,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134637424] [2019-11-20 04:43:14,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:43:14,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:43:14,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:43:14,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:43:14,489 INFO L87 Difference]: Start difference. First operand 14105 states and 14381 transitions. Second operand 3 states. [2019-11-20 04:43:15,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:43:15,474 INFO L93 Difference]: Finished difference Result 27610 states and 28156 transitions. [2019-11-20 04:43:15,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:43:15,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1044 [2019-11-20 04:43:15,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:43:15,484 INFO L225 Difference]: With dead ends: 27610 [2019-11-20 04:43:15,484 INFO L226 Difference]: Without dead ends: 14105 [2019-11-20 04:43:15,487 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-11-20 04:43:15,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14105 states. [2019-11-20 04:43:15,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14105 to 12002. [2019-11-20 04:43:15,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12002 states. [2019-11-20 04:43:15,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12002 states to 12002 states and 12217 transitions. [2019-11-20 04:43:15,576 INFO L78 Accepts]: Start accepts. Automaton has 12002 states and 12217 transitions. Word has length 1044 [2019-11-20 04:43:15,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:43:15,577 INFO L462 AbstractCegarLoop]: Abstraction has 12002 states and 12217 transitions. [2019-11-20 04:43:15,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:43:15,577 INFO L276 IsEmpty]: Start isEmpty. Operand 12002 states and 12217 transitions. [2019-11-20 04:43:15,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1128 [2019-11-20 04:43:15,593 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:43:15,594 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-11-20 04:43:15,594 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:43:15,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:43:15,594 INFO L82 PathProgramCache]: Analyzing trace with hash -690998195, now seen corresponding path program 1 times [2019-11-20 04:43:15,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:43:15,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645709903] [2019-11-20 04:43:15,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:43:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:43:18,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2394 backedges. 94 proven. 1121 refuted. 0 times theorem prover too weak. 1179 trivial. 0 not checked. [2019-11-20 04:43:18,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645709903] [2019-11-20 04:43:18,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747497058] [2019-11-20 04:43:18,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4bb33fa7-be3a-4170-94e1-7abfd4ca95cb/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:43:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:43:18,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 1298 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 04:43:18,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:43:18,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:43:18,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:43:18,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:43:18,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:43:18,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:43:18,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:43:18,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:43:18,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:43:18,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:43:18,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:43:20,243 INFO L134 CoverageAnalysis]: Checked inductivity of 2394 backedges. 94 proven. 1121 refuted. 0 times theorem prover too weak. 1179 trivial. 0 not checked. [2019-11-20 04:43:20,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:43:20,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-11-20 04:43:20,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613581480] [2019-11-20 04:43:20,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 04:43:20,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:43:20,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 04:43:20,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 04:43:20,246 INFO L87 Difference]: Start difference. First operand 12002 states and 12217 transitions. Second operand 7 states. [2019-11-20 04:43:22,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:43:22,911 INFO L93 Difference]: Finished difference Result 22197 states and 22612 transitions. [2019-11-20 04:43:22,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 04:43:22,913 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1127 [2019-11-20 04:43:22,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:43:22,928 INFO L225 Difference]: With dead ends: 22197 [2019-11-20 04:43:22,928 INFO L226 Difference]: Without dead ends: 22195 [2019-11-20 04:43:22,932 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1133 GetRequests, 1124 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-11-20 04:43:22,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22195 states. [2019-11-20 04:43:23,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22195 to 13796. [2019-11-20 04:43:23,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13796 states. [2019-11-20 04:43:23,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13796 states to 13796 states and 14052 transitions. [2019-11-20 04:43:23,066 INFO L78 Accepts]: Start accepts. Automaton has 13796 states and 14052 transitions. Word has length 1127 [2019-11-20 04:43:23,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:43:23,067 INFO L462 AbstractCegarLoop]: Abstraction has 13796 states and 14052 transitions. [2019-11-20 04:43:23,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 04:43:23,067 INFO L276 IsEmpty]: Start isEmpty. Operand 13796 states and 14052 transitions. [2019-11-20 04:43:23,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1132 [2019-11-20 04:43:23,079 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:43:23,079 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-11-20 04:43:23,280 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:43:23,281 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:43:23,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:43:23,281 INFO L82 PathProgramCache]: Analyzing trace with hash 357917745, now seen corresponding path program 1 times [2019-11-20 04:43:23,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:43:23,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505592919] [2019-11-20 04:43:23,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:43:23,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:43:24,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2126 backedges. 895 proven. 0 refuted. 0 times theorem prover too weak. 1231 trivial. 0 not checked. [2019-11-20 04:43:24,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505592919] [2019-11-20 04:43:24,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:43:24,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 04:43:24,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39767816] [2019-11-20 04:43:24,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 04:43:24,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:43:24,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 04:43:24,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-20 04:43:24,328 INFO L87 Difference]: Start difference. First operand 13796 states and 14052 transitions. Second operand 6 states. [2019-11-20 04:43:26,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:43:26,370 INFO L93 Difference]: Finished difference Result 20694 states and 21079 transitions. [2019-11-20 04:43:26,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 04:43:26,371 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1131 [2019-11-20 04:43:26,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:43:26,384 INFO L225 Difference]: With dead ends: 20694 [2019-11-20 04:43:26,384 INFO L226 Difference]: Without dead ends: 20692 [2019-11-20 04:43:26,388 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-11-20 04:43:26,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20692 states. [2019-11-20 04:43:26,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20692 to 13796. [2019-11-20 04:43:26,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13796 states. [2019-11-20 04:43:26,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13796 states to 13796 states and 14052 transitions. [2019-11-20 04:43:26,519 INFO L78 Accepts]: Start accepts. Automaton has 13796 states and 14052 transitions. Word has length 1131 [2019-11-20 04:43:26,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:43:26,519 INFO L462 AbstractCegarLoop]: Abstraction has 13796 states and 14052 transitions. [2019-11-20 04:43:26,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 04:43:26,519 INFO L276 IsEmpty]: Start isEmpty. Operand 13796 states and 14052 transitions. [2019-11-20 04:43:26,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1361 [2019-11-20 04:43:26,536 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:43:26,537 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-11-20 04:43:26,537 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:43:26,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:43:26,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1870571882, now seen corresponding path program 1 times [2019-11-20 04:43:26,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:43:26,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237183573] [2019-11-20 04:43:26,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:43:26,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:43:30,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3846 backedges. 2755 proven. 514 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2019-11-20 04:43:30,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237183573] [2019-11-20 04:43:30,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590861200] [2019-11-20 04:43:30,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4bb33fa7-be3a-4170-94e1-7abfd4ca95cb/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:43:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:43:30,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 1580 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 04:43:30,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:43:30,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:43:30,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:43:30,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:43:30,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:43:30,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:43:30,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 04:43:32,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3846 backedges. 2752 proven. 2 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2019-11-20 04:43:32,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:43:32,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 5] total 19 [2019-11-20 04:43:32,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600814357] [2019-11-20 04:43:32,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-20 04:43:32,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:43:32,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-20 04:43:32,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-11-20 04:43:32,131 INFO L87 Difference]: Start difference. First operand 13796 states and 14052 transitions. Second operand 19 states. [2019-11-20 04:43:39,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:43:39,630 INFO L93 Difference]: Finished difference Result 26909 states and 27411 transitions. [2019-11-20 04:43:39,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-20 04:43:39,630 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 1360 [2019-11-20 04:43:39,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:43:39,646 INFO L225 Difference]: With dead ends: 26909 [2019-11-20 04:43:39,646 INFO L226 Difference]: Without dead ends: 16404 [2019-11-20 04:43:39,654 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1422 GetRequests, 1377 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=345, Invalid=1295, Unknown=0, NotChecked=0, Total=1640 [2019-11-20 04:43:39,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16404 states. [2019-11-20 04:43:39,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16404 to 14994. [2019-11-20 04:43:39,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14994 states. [2019-11-20 04:43:39,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14994 states to 14994 states and 15237 transitions. [2019-11-20 04:43:39,816 INFO L78 Accepts]: Start accepts. Automaton has 14994 states and 15237 transitions. Word has length 1360 [2019-11-20 04:43:39,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:43:39,817 INFO L462 AbstractCegarLoop]: Abstraction has 14994 states and 15237 transitions. [2019-11-20 04:43:39,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-20 04:43:39,817 INFO L276 IsEmpty]: Start isEmpty. Operand 14994 states and 15237 transitions. [2019-11-20 04:43:39,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1379 [2019-11-20 04:43:39,844 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:43:39,845 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-11-20 04:43:40,048 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:43:40,049 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:43:40,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:43:40,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1545903027, now seen corresponding path program 1 times [2019-11-20 04:43:40,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:43:40,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063498846] [2019-11-20 04:43:40,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:43:40,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:43:41,946 INFO L134 CoverageAnalysis]: Checked inductivity of 3956 backedges. 2708 proven. 0 refuted. 0 times theorem prover too weak. 1248 trivial. 0 not checked. [2019-11-20 04:43:41,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063498846] [2019-11-20 04:43:41,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:43:41,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 04:43:41,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503587550] [2019-11-20 04:43:41,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 04:43:41,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:43:41,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 04:43:41,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:43:41,948 INFO L87 Difference]: Start difference. First operand 14994 states and 15237 transitions. Second operand 5 states. [2019-11-20 04:43:43,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:43:43,512 INFO L93 Difference]: Finished difference Result 29401 states and 29888 transitions. [2019-11-20 04:43:43,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 04:43:43,512 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1378 [2019-11-20 04:43:43,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:43:43,523 INFO L225 Difference]: With dead ends: 29401 [2019-11-20 04:43:43,523 INFO L226 Difference]: Without dead ends: 15007 [2019-11-20 04:43:43,527 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-11-20 04:43:43,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15007 states. [2019-11-20 04:43:43,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15007 to 13497. [2019-11-20 04:43:43,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13497 states. [2019-11-20 04:43:43,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13497 states to 13497 states and 13701 transitions. [2019-11-20 04:43:43,638 INFO L78 Accepts]: Start accepts. Automaton has 13497 states and 13701 transitions. Word has length 1378 [2019-11-20 04:43:43,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:43:43,639 INFO L462 AbstractCegarLoop]: Abstraction has 13497 states and 13701 transitions. [2019-11-20 04:43:43,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 04:43:43,639 INFO L276 IsEmpty]: Start isEmpty. Operand 13497 states and 13701 transitions. [2019-11-20 04:43:43,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1692 [2019-11-20 04:43:43,672 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:43:43,673 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-11-20 04:43:43,673 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:43:43,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:43:43,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1249907196, now seen corresponding path program 1 times [2019-11-20 04:43:43,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:43:43,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222745098] [2019-11-20 04:43:43,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:43:43,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:43:45,497 INFO L134 CoverageAnalysis]: Checked inductivity of 5511 backedges. 3589 proven. 0 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2019-11-20 04:43:45,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222745098] [2019-11-20 04:43:45,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:43:45,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:43:45,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604184184] [2019-11-20 04:43:45,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:43:45,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:43:45,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:43:45,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:43:45,500 INFO L87 Difference]: Start difference. First operand 13497 states and 13701 transitions. Second operand 4 states. [2019-11-20 04:43:46,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:43:46,747 INFO L93 Difference]: Finished difference Result 25496 states and 25886 transitions. [2019-11-20 04:43:46,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:43:46,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1691 [2019-11-20 04:43:46,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:43:46,752 INFO L225 Difference]: With dead ends: 25496 [2019-11-20 04:43:46,752 INFO L226 Difference]: Without dead ends: 5688 [2019-11-20 04:43:46,757 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-11-20 04:43:46,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5688 states. [2019-11-20 04:43:46,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5688 to 4790. [2019-11-20 04:43:46,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4790 states. [2019-11-20 04:43:46,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4790 states to 4790 states and 4817 transitions. [2019-11-20 04:43:46,798 INFO L78 Accepts]: Start accepts. Automaton has 4790 states and 4817 transitions. Word has length 1691 [2019-11-20 04:43:46,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:43:46,798 INFO L462 AbstractCegarLoop]: Abstraction has 4790 states and 4817 transitions. [2019-11-20 04:43:46,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:43:46,798 INFO L276 IsEmpty]: Start isEmpty. Operand 4790 states and 4817 transitions. [2019-11-20 04:43:46,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1790 [2019-11-20 04:43:46,814 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:43:46,815 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-11-20 04:43:46,815 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:43:46,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:43:46,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1413703160, now seen corresponding path program 1 times [2019-11-20 04:43:46,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:43:46,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361012146] [2019-11-20 04:43:46,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:43:46,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:43:48,969 INFO L134 CoverageAnalysis]: Checked inductivity of 6174 backedges. 4041 proven. 0 refuted. 0 times theorem prover too weak. 2133 trivial. 0 not checked. [2019-11-20 04:43:48,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361012146] [2019-11-20 04:43:48,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:43:48,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:43:48,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031307758] [2019-11-20 04:43:48,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:43:48,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:43:48,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:43:48,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:43:48,972 INFO L87 Difference]: Start difference. First operand 4790 states and 4817 transitions. Second operand 3 states. [2019-11-20 04:43:49,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:43:49,549 INFO L93 Difference]: Finished difference Result 7784 states and 7828 transitions. [2019-11-20 04:43:49,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:43:49,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1789 [2019-11-20 04:43:49,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:43:49,553 INFO L225 Difference]: With dead ends: 7784 [2019-11-20 04:43:49,553 INFO L226 Difference]: Without dead ends: 4491 [2019-11-20 04:43:49,555 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-11-20 04:43:49,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4491 states. [2019-11-20 04:43:49,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4491 to 4491. [2019-11-20 04:43:49,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4491 states. [2019-11-20 04:43:49,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4491 states to 4491 states and 4515 transitions. [2019-11-20 04:43:49,585 INFO L78 Accepts]: Start accepts. Automaton has 4491 states and 4515 transitions. Word has length 1789 [2019-11-20 04:43:49,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:43:49,586 INFO L462 AbstractCegarLoop]: Abstraction has 4491 states and 4515 transitions. [2019-11-20 04:43:49,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:43:49,586 INFO L276 IsEmpty]: Start isEmpty. Operand 4491 states and 4515 transitions. [2019-11-20 04:43:49,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1886 [2019-11-20 04:43:49,603 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:43:49,604 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-11-20 04:43:49,604 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:43:49,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:43:49,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1314169253, now seen corresponding path program 1 times [2019-11-20 04:43:49,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:43:49,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552675434] [2019-11-20 04:43:49,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:43:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:43:55,763 INFO L134 CoverageAnalysis]: Checked inductivity of 6447 backedges. 94 proven. 5014 refuted. 0 times theorem prover too weak. 1339 trivial. 0 not checked. [2019-11-20 04:43:55,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552675434] [2019-11-20 04:43:55,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750232940] [2019-11-20 04:43:55,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4bb33fa7-be3a-4170-94e1-7abfd4ca95cb/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-11-20 04:43:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:43:56,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 2130 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 04:43:56,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:43:56,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:43:56,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:43:56,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:43:56,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:43:56,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:43:56,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:43:56,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:43:56,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:43:56,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:43:56,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:43:56,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:43:56,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:43:56,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:43:56,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:43:56,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:43:56,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:43:56,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:43:56,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:43:56,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:43:56,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:43:56,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:43:56,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:43:56,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:43:56,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:43:56,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:43:56,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:43:56,818 WARN L191 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 24 [2019-11-20 04:43:56,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:43:56,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:44:02,513 INFO L134 CoverageAnalysis]: Checked inductivity of 6447 backedges. 3995 proven. 440 refuted. 0 times theorem prover too weak. 2012 trivial. 0 not checked. [2019-11-20 04:44:02,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:44:02,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2019-11-20 04:44:02,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005056541] [2019-11-20 04:44:02,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 04:44:02,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:44:02,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 04:44:02,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-20 04:44:02,516 INFO L87 Difference]: Start difference. First operand 4491 states and 4515 transitions. Second operand 12 states. [2019-11-20 04:44:08,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:44:08,651 INFO L93 Difference]: Finished difference Result 11372 states and 11436 transitions. [2019-11-20 04:44:08,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 04:44:08,652 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 1885 [2019-11-20 04:44:08,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:44:08,653 INFO L225 Difference]: With dead ends: 11372 [2019-11-20 04:44:08,653 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 04:44:08,656 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-11-20 04:44:08,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 04:44:08,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 04:44:08,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 04:44:08,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 04:44:08,657 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1885 [2019-11-20 04:44:08,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:44:08,658 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 04:44:08,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 04:44:08,658 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 04:44:08,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 04:44:08,862 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:44:08,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 04:44:09,992 WARN L191 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 686 DAG size of output: 600 [2019-11-20 04:44:10,726 WARN L191 SmtUtils]: Spent 732.00 ms on a formula simplification. DAG size of input: 686 DAG size of output: 600 [2019-11-20 04:44:11,133 WARN L191 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 528 DAG size of output: 471 [2019-11-20 04:44:15,360 WARN L191 SmtUtils]: Spent 4.22 s on a formula simplification. DAG size of input: 575 DAG size of output: 143 [2019-11-20 04:44:19,555 WARN L191 SmtUtils]: Spent 4.19 s on a formula simplification. DAG size of input: 575 DAG size of output: 143 [2019-11-20 04:44:22,541 WARN L191 SmtUtils]: Spent 2.98 s on a formula simplification. DAG size of input: 456 DAG size of output: 147 [2019-11-20 04:44:22,544 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,544 INFO L444 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,544 INFO L444 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,545 INFO L444 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,545 INFO L444 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-20 04:44:22,545 INFO L444 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,545 INFO L444 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,545 INFO L444 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,545 INFO L444 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,545 INFO L444 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,545 INFO L444 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,545 INFO L444 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-20 04:44:22,545 INFO L444 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,545 INFO L444 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,545 INFO L444 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,545 INFO L444 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-11-20 04:44:22,545 INFO L444 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,545 INFO L444 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,545 INFO L444 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-20 04:44:22,545 INFO L444 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,546 INFO L444 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,546 INFO L444 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,546 INFO L444 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,546 INFO L444 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,546 INFO L444 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,546 INFO L444 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-20 04:44:22,546 INFO L444 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,546 INFO L444 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,546 INFO L444 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,546 INFO L444 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,546 INFO L444 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-11-20 04:44:22,546 INFO L444 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-11-20 04:44:22,546 INFO L444 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,546 INFO L444 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,546 INFO L444 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,546 INFO L444 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,547 INFO L444 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-20 04:44:22,547 INFO L444 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-11-20 04:44:22,547 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,547 INFO L444 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,547 INFO L444 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,547 INFO L444 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,547 INFO L444 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,547 INFO L444 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-11-20 04:44:22,547 INFO L444 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,547 INFO L444 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-11-20 04:44:22,547 INFO L444 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-11-20 04:44:22,547 INFO L444 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-11-20 04:44:22,547 INFO L444 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-20 04:44:22,547 INFO L444 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,547 INFO L444 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,547 INFO L444 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,547 INFO L444 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,548 INFO L444 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,548 INFO L444 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-11-20 04:44:22,548 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,548 INFO L444 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,548 INFO L444 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-20 04:44:22,548 INFO L444 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,548 INFO L444 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-11-20 04:44:22,548 INFO L444 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,548 INFO L444 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,548 INFO L444 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,548 INFO L444 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-20 04:44:22,548 INFO L444 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,548 INFO L444 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-11-20 04:44:22,548 INFO L444 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-11-20 04:44:22,548 INFO L444 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-11-20 04:44:22,548 INFO L444 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-11-20 04:44:22,549 INFO L444 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-11-20 04:44:22,549 INFO L444 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-11-20 04:44:22,549 INFO L444 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,549 INFO L444 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,549 INFO L444 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,549 INFO L444 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,549 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-11-20 04:44:22,549 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-11-20 04:44:22,549 INFO L444 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,549 INFO L444 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-20 04:44:22,549 INFO L444 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,549 INFO L444 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,549 INFO L444 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,549 INFO L444 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,549 INFO L444 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,549 INFO L444 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,549 INFO L444 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-20 04:44:22,550 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 04:44:22,550 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 154) no Hoare annotation was computed. [2019-11-20 04:44:22,550 INFO L444 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,550 INFO L444 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,550 INFO L444 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,550 INFO L444 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,550 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,550 INFO L444 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-11-20 04:44:22,550 INFO L444 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-11-20 04:44:22,550 INFO L444 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,550 INFO L444 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-20 04:44:22,550 INFO L444 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-11-20 04:44:22,550 INFO L444 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-11-20 04:44:22,550 INFO L444 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,550 INFO L444 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-11-20 04:44:22,550 INFO L444 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-11-20 04:44:22,551 INFO L444 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,551 INFO L444 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,551 INFO L444 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,551 INFO L444 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,551 INFO L444 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-20 04:44:22,551 INFO L444 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-11-20 04:44:22,551 INFO L444 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,551 INFO L444 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,551 INFO L444 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,551 INFO L444 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-11-20 04:44:22,551 INFO L444 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-11-20 04:44:22,552 INFO L444 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,552 INFO L444 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-20 04:44:22,552 INFO L444 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,552 INFO L444 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,552 INFO L444 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,552 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,552 INFO L444 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,553 INFO L444 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,553 INFO L444 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-20 04:44:22,553 INFO L444 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,553 INFO L444 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,553 INFO L444 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-11-20 04:44:22,553 INFO L444 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,553 INFO L444 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,553 INFO L444 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,554 INFO L444 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,554 INFO L444 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-20 04:44:22,554 INFO L444 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,554 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,554 INFO L444 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,554 INFO L444 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,554 INFO L444 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,554 INFO L444 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-20 04:44:22,555 INFO L444 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,555 INFO L444 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,555 INFO L444 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,555 INFO L444 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,555 INFO L444 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-11-20 04:44:22,555 INFO L444 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,555 INFO L444 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,555 INFO L444 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,555 INFO L444 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-11-20 04:44:22,555 INFO L444 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-11-20 04:44:22,555 INFO L444 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,555 INFO L444 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,555 INFO L444 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-20 04:44:22,555 INFO L444 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,555 INFO L444 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,555 INFO L444 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,555 INFO L444 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,556 INFO L444 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,556 INFO L444 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-20 04:44:22,556 INFO L444 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,556 INFO L444 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,556 INFO L444 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,556 INFO L444 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,556 INFO L444 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,556 INFO L444 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-11-20 04:44:22,556 INFO L444 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,556 INFO L444 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,556 INFO L444 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-11-20 04:44:22,556 INFO L444 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,556 INFO L444 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-20 04:44:22,557 INFO L444 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-20 04:44:22,557 INFO L444 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,557 INFO L444 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,557 INFO L444 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,558 INFO L444 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,558 INFO L444 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,558 INFO L444 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-11-20 04:44:22,558 INFO L444 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-11-20 04:44:22,558 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,558 INFO L444 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-20 04:44:22,558 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 04:44:22,558 INFO L444 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-20 04:44:22,558 INFO L444 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,558 INFO L444 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,558 INFO L444 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,559 INFO L444 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,559 INFO L444 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,559 INFO L444 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-11-20 04:44:22,559 INFO L444 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-11-20 04:44:22,559 INFO L444 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-11-20 04:44:22,559 INFO L444 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-11-20 04:44:22,559 INFO L444 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,559 INFO L444 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,559 INFO L444 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,559 INFO L444 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-20 04:44:22,559 INFO L444 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-20 04:44:22,559 INFO L444 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,559 INFO L444 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-11-20 04:44:22,559 INFO L444 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,559 INFO L444 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,559 INFO L444 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,559 INFO L444 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,560 INFO L444 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-11-20 04:44:22,560 INFO L444 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-11-20 04:44:22,560 INFO L444 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-20 04:44:22,560 INFO L444 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,560 INFO L444 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-20 04:44:22,560 INFO L444 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,560 INFO L444 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,560 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,560 INFO L444 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,560 INFO L444 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,560 INFO L444 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,560 INFO L444 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,560 INFO L444 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,560 INFO L444 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-20 04:44:22,560 INFO L444 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-20 04:44:22,560 INFO L444 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-11-20 04:44:22,560 INFO L444 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-11-20 04:44:22,561 INFO L444 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,561 INFO L444 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,561 INFO L444 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,561 INFO L444 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,561 INFO L440 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse29 (+ ~a29~0 16)) (.cse33 (+ ~a4~0 86))) (let ((.cse2 (<= .cse33 0)) (.cse16 (+ ~a0~0 44)) (.cse22 (< 0 .cse29)) (.cse8 (< 0 .cse33)) (.cse17 (<= (+ ~a0~0 147) 0))) (let ((.cse21 (+ ~a0~0 98)) (.cse1 (or .cse22 .cse8 .cse17)) (.cse25 (<= 0 (+ ~a0~0 599998))) (.cse13 (<= 0 .cse16)) (.cse30 (and .cse2 (not (= ~a2~0 4)))) (.cse27 (<= ~a2~0 3)) (.cse28 (<= 3 ~a2~0))) (let ((.cse9 (not (= 1 ULTIMATE.start_calculate_output_~input))) (.cse7 (+ ~a29~0 144)) (.cse6 (and (or (and .cse13 .cse27) (and .cse30 .cse27)) .cse28)) (.cse0 (<= ~a29~0 42)) (.cse3 (= 4 ~a2~0)) (.cse10 (<= ~a29~0 43)) (.cse15 (= ~a2~0 1)) (.cse20 (and .cse25 .cse17)) (.cse5 (= 2 ~a2~0)) (.cse26 (<= ~a0~0 599970)) (.cse4 (and .cse1 .cse30)) (.cse11 (= 5 ~a2~0)) (.cse24 (<= .cse21 0)) (.cse23 (<= 0 (+ ~a0~0 146))) (.cse18 (< 43 ~a29~0)) (.cse19 (<= (+ ~a0~0 61) 0))) (or (and .cse0 (or (and .cse1 .cse2) (and (<= 13 ~a0~0) .cse2)) .cse3) (or (and .cse4 .cse5 (not (= 6 ULTIMATE.start_calculate_output_~input))) (and .cse6 (<= .cse7 0) (or .cse8 .cse9))) (and .cse10 .cse4 .cse11) (let ((.cse12 (+ ~a4~0 89)) (.cse14 (+ ~a29~0 127))) (and (<= .cse12 0) (<= 0 .cse12) .cse13 (<= 0 .cse14) .cse15 (<= .cse14 0) (<= .cse16 0))) (and .cse17 .cse18 .cse15 (<= 0 (+ ~a0~0 384412))) (and .cse1 .cse2 .cse19) (and (or (< 0 (+ ~a4~0 42)) .cse9) .cse20 .cse3) (and .cse2 (< 0 .cse21) .cse19) (and .cse22 .cse23 .cse5 .cse24) (and .cse1 .cse25 .cse26 .cse15 .cse10 (< 0 .cse7)) (and .cse26 .cse6) (and .cse25 .cse17 .cse10 .cse27 .cse28) (and .cse24 .cse23 .cse27 .cse28) (and .cse0 .cse20 .cse3) (and .cse26 (<= .cse29 0) .cse30 .cse5) (and .cse10 .cse24 .cse11) (and .cse25 .cse17 .cse11) (and .cse23 (and .cse24 .cse15)) (and .cse20 .cse5) (and .cse26 (and .cse4 .cse11)) (and (and .cse24 .cse23 (<= (+ ~a0~0 38608) (+ ~a4~0 ~a29~0))) .cse11) (and (and .cse24 .cse23 .cse28 (<= ~a2~0 4)) .cse18) (and .cse17 .cse27 .cse28 (exists ((v_~a0~0_829 Int)) (let ((.cse32 (div v_~a0~0_829 5))) (let ((.cse31 (* 10 .cse32))) (and (<= v_~a0~0_829 599970) (<= 0 (+ .cse31 3459790)) (<= (div (+ (* .cse32 10) 3459790) (- 9)) ~a0~0) (<= 0 (+ .cse31 3459800)) (= (mod v_~a0~0_829 5) 0)))))) (and .cse19 .cse30)))))) [2019-11-20 04:44:22,561 INFO L444 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-20 04:44:22,561 INFO L444 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-20 04:44:22,561 INFO L444 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,561 INFO L444 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,562 INFO L444 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,562 INFO L444 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,562 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,562 INFO L444 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,562 INFO L444 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,562 INFO L444 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-11-20 04:44:22,562 INFO L444 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,562 INFO L444 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-11-20 04:44:22,562 INFO L447 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-11-20 04:44:22,562 INFO L444 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,562 INFO L444 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-11-20 04:44:22,562 INFO L444 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-11-20 04:44:22,562 INFO L444 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-20 04:44:22,562 INFO L444 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-20 04:44:22,562 INFO L444 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,562 INFO L444 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,563 INFO L444 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,563 INFO L444 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,563 INFO L444 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,563 INFO L444 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-20 04:44:22,563 INFO L444 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-20 04:44:22,563 INFO L444 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,563 INFO L444 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-11-20 04:44:22,563 INFO L444 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-11-20 04:44:22,563 INFO L444 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,564 INFO L444 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,564 INFO L444 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,564 INFO L444 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,564 INFO L444 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,564 INFO L444 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,565 INFO L440 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse29 (+ ~a29~0 16)) (.cse33 (+ ~a4~0 86))) (let ((.cse4 (<= .cse33 0)) (.cse14 (+ ~a0~0 44)) (.cse26 (< 0 .cse29)) (.cse15 (<= (+ ~a0~0 147) 0))) (let ((.cse3 (or .cse26 (< 0 .cse33) .cse15)) (.cse21 (+ ~a0~0 98)) (.cse30 (+ ~a29~0 144)) (.cse17 (= ~a2~0 1)) (.cse11 (<= 0 .cse14)) (.cse28 (and .cse4 (not (= ~a2~0 4)))) (.cse19 (<= ~a2~0 3)) (.cse20 (<= 3 ~a2~0)) (.cse24 (<= 0 (+ ~a0~0 599998)))) (let ((.cse6 (and .cse24 .cse15)) (.cse5 (= 4 ~a2~0)) (.cse22 (and (or (and .cse11 .cse19) (and .cse28 .cse19)) .cse20)) (.cse7 (= 2 ~a2~0)) (.cse13 (and .cse4 .cse17)) (.cse23 (<= .cse30 0)) (.cse0 (<= .cse21 0)) (.cse1 (<= 0 (+ ~a0~0 146))) (.cse16 (< 43 ~a29~0)) (.cse8 (<= ~a29~0 43)) (.cse25 (<= ~a2~0 4)) (.cse18 (<= (+ ~a0~0 61) 0)) (.cse27 (<= ~a0~0 599970)) (.cse9 (and .cse3 .cse28)) (.cse2 (= 5 ~a2~0))) (or (and (and .cse0 .cse1 (<= (+ ~a0~0 38608) (+ ~a4~0 ~a29~0))) .cse2) (and (<= ~a29~0 42) (or (and .cse3 .cse4) (and (<= 13 ~a0~0) .cse4)) .cse5) (and .cse6 .cse7) (and .cse8 .cse9 .cse2) (let ((.cse10 (+ ~a4~0 89)) (.cse12 (+ ~a29~0 127))) (and (<= .cse10 0) (<= 0 .cse10) .cse11 (<= 0 .cse12) .cse13 (<= .cse12 0) (<= .cse14 0))) (and .cse15 .cse16 .cse17 (<= 0 (+ ~a0~0 384412))) (and .cse3 .cse4 .cse18) (and .cse0 .cse1 .cse19 .cse20) (and .cse4 (< 0 .cse21) .cse18) (or (and .cse22 .cse23) (and .cse9 .cse7 (not (= 6 ULTIMATE.start_calculate_output_~input)))) (and .cse24 .cse15 .cse8 .cse20 .cse25) (and .cse1 (and .cse0 .cse17)) (and .cse8 .cse0 .cse2) (and .cse6 .cse5) (and .cse24 .cse15 .cse2) (and .cse26 (and .cse1 .cse0) .cse7) (and .cse27 .cse22) (and .cse27 .cse28 (<= .cse29 0) .cse7) (and .cse13 .cse23) (and (and .cse0 .cse1 .cse20 .cse25) .cse16) (and .cse27 .cse3 .cse24 .cse17 .cse8 (< 0 .cse30)) (and .cse15 .cse20 .cse25 (exists ((v_~a0~0_829 Int)) (let ((.cse32 (div v_~a0~0_829 5))) (let ((.cse31 (* 10 .cse32))) (and (<= v_~a0~0_829 599970) (<= 0 (+ .cse31 3459790)) (<= (div (+ (* .cse32 10) 3459790) (- 9)) ~a0~0) (<= 0 (+ .cse31 3459800)) (= (mod v_~a0~0_829 5) 0)))))) (and .cse18 .cse28) (and .cse27 (and .cse9 .cse2))))))) [2019-11-20 04:44:22,565 INFO L444 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,565 INFO L444 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-20 04:44:22,565 INFO L444 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-20 04:44:22,565 INFO L444 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,565 INFO L444 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,565 INFO L444 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,565 INFO L444 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,565 INFO L444 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,565 INFO L444 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,566 INFO L444 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-20 04:44:22,566 INFO L444 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-20 04:44:22,566 INFO L444 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,566 INFO L444 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,566 INFO L444 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-11-20 04:44:22,566 INFO L444 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,566 INFO L444 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,566 INFO L444 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,566 INFO L444 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,566 INFO L444 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,566 INFO L444 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,566 INFO L444 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-20 04:44:22,567 INFO L444 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-20 04:44:22,567 INFO L444 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,567 INFO L444 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,567 INFO L444 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,567 INFO L444 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,567 INFO L444 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,567 INFO L444 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,567 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 04:44:22,567 INFO L444 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-20 04:44:22,567 INFO L444 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,567 INFO L444 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-20 04:44:22,567 INFO L444 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,567 INFO L444 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,568 INFO L444 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,568 INFO L444 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,568 INFO L444 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,568 INFO L444 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,568 INFO L444 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,568 INFO L444 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-20 04:44:22,568 INFO L444 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-20 04:44:22,568 INFO L444 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,568 INFO L444 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,568 INFO L444 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,568 INFO L444 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,568 INFO L444 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,568 INFO L444 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,569 INFO L444 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,569 INFO L444 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-20 04:44:22,569 INFO L444 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-20 04:44:22,569 INFO L444 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,569 INFO L444 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,569 INFO L444 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,569 INFO L444 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,569 INFO L444 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,569 INFO L444 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,569 INFO L444 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,569 INFO L444 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-11-20 04:44:22,569 INFO L444 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-11-20 04:44:22,570 INFO L444 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,570 INFO L444 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-20 04:44:22,570 INFO L444 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-20 04:44:22,570 INFO L444 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,570 INFO L444 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,570 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,570 INFO L444 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,570 INFO L444 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,570 INFO L444 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,571 INFO L440 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse29 (+ ~a29~0 16)) (.cse33 (+ ~a4~0 86))) (let ((.cse4 (<= .cse33 0)) (.cse14 (+ ~a0~0 44)) (.cse26 (< 0 .cse29)) (.cse15 (<= (+ ~a0~0 147) 0))) (let ((.cse3 (or .cse26 (< 0 .cse33) .cse15)) (.cse21 (+ ~a0~0 98)) (.cse30 (+ ~a29~0 144)) (.cse17 (= ~a2~0 1)) (.cse11 (<= 0 .cse14)) (.cse28 (and .cse4 (not (= ~a2~0 4)))) (.cse19 (<= ~a2~0 3)) (.cse20 (<= 3 ~a2~0)) (.cse24 (<= 0 (+ ~a0~0 599998)))) (let ((.cse6 (and .cse24 .cse15)) (.cse5 (= 4 ~a2~0)) (.cse22 (and (or (and .cse11 .cse19) (and .cse28 .cse19)) .cse20)) (.cse7 (= 2 ~a2~0)) (.cse13 (and .cse4 .cse17)) (.cse23 (<= .cse30 0)) (.cse0 (<= .cse21 0)) (.cse1 (<= 0 (+ ~a0~0 146))) (.cse16 (< 43 ~a29~0)) (.cse8 (<= ~a29~0 43)) (.cse25 (<= ~a2~0 4)) (.cse18 (<= (+ ~a0~0 61) 0)) (.cse27 (<= ~a0~0 599970)) (.cse9 (and .cse3 .cse28)) (.cse2 (= 5 ~a2~0))) (or (and (and .cse0 .cse1 (<= (+ ~a0~0 38608) (+ ~a4~0 ~a29~0))) .cse2) (and (<= ~a29~0 42) (or (and .cse3 .cse4) (and (<= 13 ~a0~0) .cse4)) .cse5) (and .cse6 .cse7) (and .cse8 .cse9 .cse2) (let ((.cse10 (+ ~a4~0 89)) (.cse12 (+ ~a29~0 127))) (and (<= .cse10 0) (<= 0 .cse10) .cse11 (<= 0 .cse12) .cse13 (<= .cse12 0) (<= .cse14 0))) (and .cse15 .cse16 .cse17 (<= 0 (+ ~a0~0 384412))) (and .cse3 .cse4 .cse18) (and .cse0 .cse1 .cse19 .cse20) (and .cse4 (< 0 .cse21) .cse18) (or (and .cse22 .cse23) (and .cse9 .cse7 (not (= 6 ULTIMATE.start_calculate_output_~input)))) (and .cse24 .cse15 .cse8 .cse20 .cse25) (and .cse1 (and .cse0 .cse17)) (and .cse8 .cse0 .cse2) (and .cse6 .cse5) (and .cse24 .cse15 .cse2) (and .cse26 (and .cse1 .cse0) .cse7) (and .cse27 .cse22) (and .cse27 .cse28 (<= .cse29 0) .cse7) (and .cse13 .cse23) (and (and .cse0 .cse1 .cse20 .cse25) .cse16) (and .cse27 .cse3 .cse24 .cse17 .cse8 (< 0 .cse30)) (and .cse15 .cse20 .cse25 (exists ((v_~a0~0_829 Int)) (let ((.cse32 (div v_~a0~0_829 5))) (let ((.cse31 (* 10 .cse32))) (and (<= v_~a0~0_829 599970) (<= 0 (+ .cse31 3459790)) (<= (div (+ (* .cse32 10) 3459790) (- 9)) ~a0~0) (<= 0 (+ .cse31 3459800)) (= (mod v_~a0~0_829 5) 0)))))) (and .cse18 .cse28) (and .cse27 (and .cse9 .cse2))))))) [2019-11-20 04:44:22,571 INFO L444 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-20 04:44:22,571 INFO L444 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-20 04:44:22,571 INFO L444 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,571 INFO L444 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,571 INFO L444 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,571 INFO L444 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,571 INFO L444 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,571 INFO L444 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,571 INFO L444 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,572 INFO L444 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,572 INFO L444 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-11-20 04:44:22,572 INFO L444 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-20 04:44:22,572 INFO L444 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,572 INFO L444 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-11-20 04:44:22,572 INFO L444 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-11-20 04:44:22,572 INFO L444 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,572 INFO L444 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,572 INFO L444 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,572 INFO L444 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,572 INFO L444 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,572 INFO L444 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-11-20 04:44:22,572 INFO L444 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-20 04:44:22,573 INFO L444 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,573 INFO L444 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,573 INFO L444 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,573 INFO L444 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,573 INFO L444 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-11-20 04:44:22,573 INFO L444 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-11-20 04:44:22,573 INFO L444 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-11-20 04:44:22,573 INFO L444 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,573 INFO L444 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-11-20 04:44:22,573 INFO L444 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-20 04:44:22,573 INFO L444 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,573 INFO L444 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,573 INFO L444 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,573 INFO L444 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,573 INFO L444 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,574 INFO L444 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,574 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,574 INFO L444 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-20 04:44:22,574 INFO L444 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-11-20 04:44:22,574 INFO L444 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,574 INFO L444 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,574 INFO L444 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,574 INFO L444 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-20 04:44:22,574 INFO L444 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,574 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 04:44:22,574 INFO L444 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,574 INFO L444 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-11-20 04:44:22,574 INFO L444 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,574 INFO L444 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,575 INFO L444 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,575 INFO L444 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,575 INFO L444 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,575 INFO L444 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,575 INFO L444 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,575 INFO L444 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-11-20 04:44:22,575 INFO L444 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-11-20 04:44:22,575 INFO L444 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,575 INFO L444 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-20 04:44:22,575 INFO L444 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,575 INFO L444 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,575 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,575 INFO L444 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-20 04:44:22,575 INFO L444 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,575 INFO L444 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,575 INFO L444 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,575 INFO L444 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,576 INFO L444 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-11-20 04:44:22,576 INFO L444 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,576 INFO L444 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,576 INFO L444 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-11-20 04:44:22,576 INFO L444 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-11-20 04:44:22,576 INFO L444 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,576 INFO L444 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,576 INFO L444 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,576 INFO L444 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-20 04:44:22,576 INFO L444 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,576 INFO L444 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,576 INFO L444 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,576 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,576 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,576 INFO L444 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-20 04:44:22,576 INFO L444 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,576 INFO L444 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,577 INFO L444 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-11-20 04:44:22,577 INFO L444 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-11-20 04:44:22,577 INFO L444 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,577 INFO L444 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 04:44:22,577 INFO L444 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-11-20 04:44:22,577 INFO L444 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,577 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-20 04:44:22,577 INFO L444 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,577 INFO L444 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-11-20 04:44:22,577 INFO L444 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-11-20 04:44:22,577 INFO L444 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,577 INFO L444 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,577 INFO L444 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-11-20 04:44:22,577 INFO L444 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-11-20 04:44:22,577 INFO L444 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-11-20 04:44:22,586 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,587 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,588 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,588 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,588 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,601 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,601 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,601 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,602 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,602 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,607 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,608 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,608 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,608 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,608 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,612 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,612 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,612 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,612 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,613 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,617 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,617 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,617 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,617 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,617 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,621 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,621 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,621 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,622 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,622 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 04:44:22 BoogieIcfgContainer [2019-11-20 04:44:22,626 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 04:44:22,626 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 04:44:22,627 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 04:44:22,627 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 04:44:22,627 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:42:08" (3/4) ... [2019-11-20 04:44:22,630 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 04:44:22,664 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-20 04:44:22,667 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 04:44:22,696 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((a0 + 98 <= 0 && 0 <= a0 + 146) && a0 + 38608 <= a4 + a29) && 5 == a2) || ((a29 <= 42 && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0) || (13 <= a0 && a4 + 86 <= 0))) && 4 == a2)) || ((0 <= a0 + 599998 && a0 + 147 <= 0) && 2 == a2)) || ((a29 <= 43 && ((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0 && !(a2 == 4)) && 5 == a2)) || ((((((a4 + 89 <= 0 && 0 <= a4 + 89) && 0 <= a0 + 44) && 0 <= a29 + 127) && a4 + 86 <= 0 && a2 == 1) && a29 + 127 <= 0) && a0 + 44 <= 0)) || (((a0 + 147 <= 0 && 43 < a29) && a2 == 1) && 0 <= a0 + 384412)) || ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0) && a0 + 61 <= 0)) || (((a0 + 98 <= 0 && 0 <= a0 + 146) && a2 <= 3) && 3 <= a2)) || ((a4 + 86 <= 0 && 0 < a0 + 98) && a0 + 61 <= 0)) || ((((0 <= a0 + 44 && a2 <= 3) || ((a4 + 86 <= 0 && !(a2 == 4)) && a2 <= 3)) && 3 <= a2) && a29 + 144 <= 0) || (((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0 && !(a2 == 4)) && 2 == a2) && !(6 == input))) || ((((0 <= a0 + 599998 && a0 + 147 <= 0) && a29 <= 43) && 3 <= a2) && a2 <= 4)) || (0 <= a0 + 146 && a0 + 98 <= 0 && a2 == 1)) || ((a29 <= 43 && a0 + 98 <= 0) && 5 == a2)) || ((0 <= a0 + 599998 && a0 + 147 <= 0) && 4 == a2)) || ((0 <= a0 + 599998 && a0 + 147 <= 0) && 5 == a2)) || ((0 < a29 + 16 && 0 <= a0 + 146 && a0 + 98 <= 0) && 2 == a2)) || (a0 <= 599970 && ((0 <= a0 + 44 && a2 <= 3) || ((a4 + 86 <= 0 && !(a2 == 4)) && a2 <= 3)) && 3 <= a2)) || (((a0 <= 599970 && a4 + 86 <= 0 && !(a2 == 4)) && a29 + 16 <= 0) && 2 == a2)) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0)) || ((((a0 + 98 <= 0 && 0 <= a0 + 146) && 3 <= a2) && a2 <= 4) && 43 < a29)) || (((((a0 <= 599970 && ((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0)) && 0 <= a0 + 599998) && a2 == 1) && a29 <= 43) && 0 < a29 + 144)) || (((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))) || (a0 + 61 <= 0 && a4 + 86 <= 0 && !(a2 == 4))) || (a0 <= 599970 && (((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0 && !(a2 == 4)) && 5 == a2) [2019-11-20 04:44:22,700 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((a0 + 98 <= 0 && 0 <= a0 + 146) && a0 + 38608 <= a4 + a29) && 5 == a2) || ((a29 <= 42 && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0) || (13 <= a0 && a4 + 86 <= 0))) && 4 == a2)) || ((0 <= a0 + 599998 && a0 + 147 <= 0) && 2 == a2)) || ((a29 <= 43 && ((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0 && !(a2 == 4)) && 5 == a2)) || ((((((a4 + 89 <= 0 && 0 <= a4 + 89) && 0 <= a0 + 44) && 0 <= a29 + 127) && a4 + 86 <= 0 && a2 == 1) && a29 + 127 <= 0) && a0 + 44 <= 0)) || (((a0 + 147 <= 0 && 43 < a29) && a2 == 1) && 0 <= a0 + 384412)) || ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0) && a0 + 61 <= 0)) || (((a0 + 98 <= 0 && 0 <= a0 + 146) && a2 <= 3) && 3 <= a2)) || ((a4 + 86 <= 0 && 0 < a0 + 98) && a0 + 61 <= 0)) || ((((0 <= a0 + 44 && a2 <= 3) || ((a4 + 86 <= 0 && !(a2 == 4)) && a2 <= 3)) && 3 <= a2) && a29 + 144 <= 0) || (((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0 && !(a2 == 4)) && 2 == a2) && !(6 == input))) || ((((0 <= a0 + 599998 && a0 + 147 <= 0) && a29 <= 43) && 3 <= a2) && a2 <= 4)) || (0 <= a0 + 146 && a0 + 98 <= 0 && a2 == 1)) || ((a29 <= 43 && a0 + 98 <= 0) && 5 == a2)) || ((0 <= a0 + 599998 && a0 + 147 <= 0) && 4 == a2)) || ((0 <= a0 + 599998 && a0 + 147 <= 0) && 5 == a2)) || ((0 < a29 + 16 && 0 <= a0 + 146 && a0 + 98 <= 0) && 2 == a2)) || (a0 <= 599970 && ((0 <= a0 + 44 && a2 <= 3) || ((a4 + 86 <= 0 && !(a2 == 4)) && a2 <= 3)) && 3 <= a2)) || (((a0 <= 599970 && a4 + 86 <= 0 && !(a2 == 4)) && a29 + 16 <= 0) && 2 == a2)) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0)) || ((((a0 + 98 <= 0 && 0 <= a0 + 146) && 3 <= a2) && a2 <= 4) && 43 < a29)) || (((((a0 <= 599970 && ((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0)) && 0 <= a0 + 599998) && a2 == 1) && a29 <= 43) && 0 < a29 + 144)) || (((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))) || (a0 + 61 <= 0 && a4 + 86 <= 0 && !(a2 == 4))) || (a0 <= 599970 && (((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0 && !(a2 == 4)) && 5 == a2) [2019-11-20 04:44:22,711 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((a29 <= 42 && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0) || (13 <= a0 && a4 + 86 <= 0))) && 4 == a2) || (((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0 && !(a2 == 4)) && 2 == a2) && !(6 == input)) || (((((0 <= a0 + 44 && a2 <= 3) || ((a4 + 86 <= 0 && !(a2 == 4)) && a2 <= 3)) && 3 <= a2) && a29 + 144 <= 0) && (0 < a4 + 86 || !(1 == input)))) || ((a29 <= 43 && ((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0 && !(a2 == 4)) && 5 == a2)) || ((((((a4 + 89 <= 0 && 0 <= a4 + 89) && 0 <= a0 + 44) && 0 <= a29 + 127) && a2 == 1) && a29 + 127 <= 0) && a0 + 44 <= 0)) || (((a0 + 147 <= 0 && 43 < a29) && a2 == 1) && 0 <= a0 + 384412)) || ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0) && a0 + 61 <= 0)) || (((0 < a4 + 42 || !(1 == input)) && 0 <= a0 + 599998 && a0 + 147 <= 0) && 4 == a2)) || ((a4 + 86 <= 0 && 0 < a0 + 98) && a0 + 61 <= 0)) || (((0 < a29 + 16 && 0 <= a0 + 146) && 2 == a2) && a0 + 98 <= 0)) || (((((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && 0 <= a0 + 599998) && a0 <= 599970) && a2 == 1) && a29 <= 43) && 0 < a29 + 144)) || (a0 <= 599970 && ((0 <= a0 + 44 && a2 <= 3) || ((a4 + 86 <= 0 && !(a2 == 4)) && a2 <= 3)) && 3 <= a2)) || ((((0 <= a0 + 599998 && a0 + 147 <= 0) && a29 <= 43) && a2 <= 3) && 3 <= a2)) || (((a0 + 98 <= 0 && 0 <= a0 + 146) && a2 <= 3) && 3 <= a2)) || ((a29 <= 42 && 0 <= a0 + 599998 && a0 + 147 <= 0) && 4 == a2)) || (((a0 <= 599970 && a29 + 16 <= 0) && a4 + 86 <= 0 && !(a2 == 4)) && 2 == a2)) || ((a29 <= 43 && a0 + 98 <= 0) && 5 == a2)) || ((0 <= a0 + 599998 && a0 + 147 <= 0) && 5 == a2)) || (0 <= a0 + 146 && a0 + 98 <= 0 && a2 == 1)) || ((0 <= a0 + 599998 && a0 + 147 <= 0) && 2 == a2)) || (a0 <= 599970 && (((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0 && !(a2 == 4)) && 5 == a2)) || (((a0 + 98 <= 0 && 0 <= a0 + 146) && a0 + 38608 <= a4 + a29) && 5 == a2)) || ((((a0 + 98 <= 0 && 0 <= a0 + 146) && 3 <= a2) && a2 <= 4) && 43 < a29)) || (((a0 + 147 <= 0 && a2 <= 3) && 3 <= a2) && (\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 + 61 <= 0 && a4 + 86 <= 0 && !(a2 == 4)) [2019-11-20 04:44:22,863 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_4bb33fa7-be3a-4170-94e1-7abfd4ca95cb/bin/uautomizer/witness.graphml [2019-11-20 04:44:22,863 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 04:44:22,865 INFO L168 Benchmark]: Toolchain (without parser) took 138658.26 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.1 GB). Free memory was 946.1 MB in the beginning and 3.3 GB in the end (delta: -2.4 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-11-20 04:44:22,865 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 04:44:22,865 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1163.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -134.6 MB). Peak memory consumption was 48.4 MB. Max. memory is 11.5 GB. [2019-11-20 04:44:22,866 INFO L168 Benchmark]: Boogie Procedure Inliner took 160.71 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.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2019-11-20 04:44:22,866 INFO L168 Benchmark]: Boogie Preprocessor took 139.21 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: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. [2019-11-20 04:44:22,866 INFO L168 Benchmark]: RCFGBuilder took 3257.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 945.1 MB in the end (delta: 81.4 MB). Peak memory consumption was 159.6 MB. Max. memory is 11.5 GB. [2019-11-20 04:44:22,867 INFO L168 Benchmark]: TraceAbstraction took 133697.00 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 945.1 MB in the beginning and 3.4 GB in the end (delta: -2.5 GB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. [2019-11-20 04:44:22,867 INFO L168 Benchmark]: Witness Printer took 237.12 ms. Allocated memory is still 5.1 GB. Free memory was 3.3 GB in the beginning and 3.3 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-11-20 04:44:22,869 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1163.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -134.6 MB). Peak memory consumption was 48.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 160.71 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.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 139.21 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: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3257.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 945.1 MB in the end (delta: 81.4 MB). Peak memory consumption was 159.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 133697.00 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 945.1 MB in the beginning and 3.4 GB in the end (delta: -2.5 GB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. * Witness Printer took 237.12 ms. Allocated memory is still 5.1 GB. Free memory was 3.3 GB in the beginning and 3.3 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~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-11-20 04:44:22,877 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,878 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,878 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,878 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,878 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,880 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,881 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,881 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,881 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,881 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((a0 + 98 <= 0 && 0 <= a0 + 146) && a0 + 38608 <= a4 + a29) && 5 == a2) || ((a29 <= 42 && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0) || (13 <= a0 && a4 + 86 <= 0))) && 4 == a2)) || ((0 <= a0 + 599998 && a0 + 147 <= 0) && 2 == a2)) || ((a29 <= 43 && ((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0 && !(a2 == 4)) && 5 == a2)) || ((((((a4 + 89 <= 0 && 0 <= a4 + 89) && 0 <= a0 + 44) && 0 <= a29 + 127) && a4 + 86 <= 0 && a2 == 1) && a29 + 127 <= 0) && a0 + 44 <= 0)) || (((a0 + 147 <= 0 && 43 < a29) && a2 == 1) && 0 <= a0 + 384412)) || ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0) && a0 + 61 <= 0)) || (((a0 + 98 <= 0 && 0 <= a0 + 146) && a2 <= 3) && 3 <= a2)) || ((a4 + 86 <= 0 && 0 < a0 + 98) && a0 + 61 <= 0)) || ((((0 <= a0 + 44 && a2 <= 3) || ((a4 + 86 <= 0 && !(a2 == 4)) && a2 <= 3)) && 3 <= a2) && a29 + 144 <= 0) || (((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0 && !(a2 == 4)) && 2 == a2) && !(6 == input))) || ((((0 <= a0 + 599998 && a0 + 147 <= 0) && a29 <= 43) && 3 <= a2) && a2 <= 4)) || (0 <= a0 + 146 && a0 + 98 <= 0 && a2 == 1)) || ((a29 <= 43 && a0 + 98 <= 0) && 5 == a2)) || ((0 <= a0 + 599998 && a0 + 147 <= 0) && 4 == a2)) || ((0 <= a0 + 599998 && a0 + 147 <= 0) && 5 == a2)) || ((0 < a29 + 16 && 0 <= a0 + 146 && a0 + 98 <= 0) && 2 == a2)) || (a0 <= 599970 && ((0 <= a0 + 44 && a2 <= 3) || ((a4 + 86 <= 0 && !(a2 == 4)) && a2 <= 3)) && 3 <= a2)) || (((a0 <= 599970 && a4 + 86 <= 0 && !(a2 == 4)) && a29 + 16 <= 0) && 2 == a2)) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0)) || ((((a0 + 98 <= 0 && 0 <= a0 + 146) && 3 <= a2) && a2 <= 4) && 43 < a29)) || (((((a0 <= 599970 && ((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0)) && 0 <= a0 + 599998) && a2 == 1) && a29 <= 43) && 0 < a29 + 144)) || (((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))) || (a0 + 61 <= 0 && a4 + 86 <= 0 && !(a2 == 4))) || (a0 <= 599970 && (((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0 && !(a2 == 4)) && 5 == a2) - InvariantResult [Line: 23]: Loop Invariant [2019-11-20 04:44:22,883 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,884 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,884 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,884 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,884 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,886 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,886 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,886 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,886 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,887 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((a0 + 98 <= 0 && 0 <= a0 + 146) && a0 + 38608 <= a4 + a29) && 5 == a2) || ((a29 <= 42 && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0) || (13 <= a0 && a4 + 86 <= 0))) && 4 == a2)) || ((0 <= a0 + 599998 && a0 + 147 <= 0) && 2 == a2)) || ((a29 <= 43 && ((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0 && !(a2 == 4)) && 5 == a2)) || ((((((a4 + 89 <= 0 && 0 <= a4 + 89) && 0 <= a0 + 44) && 0 <= a29 + 127) && a4 + 86 <= 0 && a2 == 1) && a29 + 127 <= 0) && a0 + 44 <= 0)) || (((a0 + 147 <= 0 && 43 < a29) && a2 == 1) && 0 <= a0 + 384412)) || ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0) && a0 + 61 <= 0)) || (((a0 + 98 <= 0 && 0 <= a0 + 146) && a2 <= 3) && 3 <= a2)) || ((a4 + 86 <= 0 && 0 < a0 + 98) && a0 + 61 <= 0)) || ((((0 <= a0 + 44 && a2 <= 3) || ((a4 + 86 <= 0 && !(a2 == 4)) && a2 <= 3)) && 3 <= a2) && a29 + 144 <= 0) || (((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0 && !(a2 == 4)) && 2 == a2) && !(6 == input))) || ((((0 <= a0 + 599998 && a0 + 147 <= 0) && a29 <= 43) && 3 <= a2) && a2 <= 4)) || (0 <= a0 + 146 && a0 + 98 <= 0 && a2 == 1)) || ((a29 <= 43 && a0 + 98 <= 0) && 5 == a2)) || ((0 <= a0 + 599998 && a0 + 147 <= 0) && 4 == a2)) || ((0 <= a0 + 599998 && a0 + 147 <= 0) && 5 == a2)) || ((0 < a29 + 16 && 0 <= a0 + 146 && a0 + 98 <= 0) && 2 == a2)) || (a0 <= 599970 && ((0 <= a0 + 44 && a2 <= 3) || ((a4 + 86 <= 0 && !(a2 == 4)) && a2 <= 3)) && 3 <= a2)) || (((a0 <= 599970 && a4 + 86 <= 0 && !(a2 == 4)) && a29 + 16 <= 0) && 2 == a2)) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0)) || ((((a0 + 98 <= 0 && 0 <= a0 + 146) && 3 <= a2) && a2 <= 4) && 43 < a29)) || (((((a0 <= 599970 && ((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0)) && 0 <= a0 + 599998) && a2 == 1) && a29 <= 43) && 0 < a29 + 144)) || (((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))) || (a0 + 61 <= 0 && a4 + 86 <= 0 && !(a2 == 4))) || (a0 <= 599970 && (((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0 && !(a2 == 4)) && 5 == a2) - InvariantResult [Line: 1658]: Loop Invariant [2019-11-20 04:44:22,888 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,888 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,889 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,889 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,889 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,890 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,891 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,891 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,891 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 04:44:22,891 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((a29 <= 42 && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0) || (13 <= a0 && a4 + 86 <= 0))) && 4 == a2) || (((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0 && !(a2 == 4)) && 2 == a2) && !(6 == input)) || (((((0 <= a0 + 44 && a2 <= 3) || ((a4 + 86 <= 0 && !(a2 == 4)) && a2 <= 3)) && 3 <= a2) && a29 + 144 <= 0) && (0 < a4 + 86 || !(1 == input)))) || ((a29 <= 43 && ((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0 && !(a2 == 4)) && 5 == a2)) || ((((((a4 + 89 <= 0 && 0 <= a4 + 89) && 0 <= a0 + 44) && 0 <= a29 + 127) && a2 == 1) && a29 + 127 <= 0) && a0 + 44 <= 0)) || (((a0 + 147 <= 0 && 43 < a29) && a2 == 1) && 0 <= a0 + 384412)) || ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0) && a0 + 61 <= 0)) || (((0 < a4 + 42 || !(1 == input)) && 0 <= a0 + 599998 && a0 + 147 <= 0) && 4 == a2)) || ((a4 + 86 <= 0 && 0 < a0 + 98) && a0 + 61 <= 0)) || (((0 < a29 + 16 && 0 <= a0 + 146) && 2 == a2) && a0 + 98 <= 0)) || (((((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && 0 <= a0 + 599998) && a0 <= 599970) && a2 == 1) && a29 <= 43) && 0 < a29 + 144)) || (a0 <= 599970 && ((0 <= a0 + 44 && a2 <= 3) || ((a4 + 86 <= 0 && !(a2 == 4)) && a2 <= 3)) && 3 <= a2)) || ((((0 <= a0 + 599998 && a0 + 147 <= 0) && a29 <= 43) && a2 <= 3) && 3 <= a2)) || (((a0 + 98 <= 0 && 0 <= a0 + 146) && a2 <= 3) && 3 <= a2)) || ((a29 <= 42 && 0 <= a0 + 599998 && a0 + 147 <= 0) && 4 == a2)) || (((a0 <= 599970 && a29 + 16 <= 0) && a4 + 86 <= 0 && !(a2 == 4)) && 2 == a2)) || ((a29 <= 43 && a0 + 98 <= 0) && 5 == a2)) || ((0 <= a0 + 599998 && a0 + 147 <= 0) && 5 == a2)) || (0 <= a0 + 146 && a0 + 98 <= 0 && a2 == 1)) || ((0 <= a0 + 599998 && a0 + 147 <= 0) && 2 == a2)) || (a0 <= 599970 && (((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) && a4 + 86 <= 0 && !(a2 == 4)) && 5 == a2)) || (((a0 + 98 <= 0 && 0 <= a0 + 146) && a0 + 38608 <= a4 + a29) && 5 == a2)) || ((((a0 + 98 <= 0 && 0 <= a0 + 146) && 3 <= a2) && a2 <= 4) && 43 < a29)) || (((a0 + 147 <= 0 && a2 <= 3) && 3 <= a2) && (\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 + 61 <= 0 && a4 + 86 <= 0 && !(a2 == 4)) - 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: 133.5s, OverallIterations: 24, TraceHistogramMax: 10, AutomataDifference: 69.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 13.6s, HoareTripleCheckerStatistics: 4778 SDtfs, 26407 SDslu, 1817 SDs, 0 SdLazy, 62557 SolverSat, 5141 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 54.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7636 GetRequests, 7448 SyntacticMatches, 33 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 3.6s 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: 2.3s AutomataMinimizationTime, 24 MinimizatonAttempts, 40142 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 202 NumberOfFragments, 1883 HoareAnnotationTreeSize, 4 FomulaSimplifications, 520325 FormulaSimplificationTreeSizeReduction, 2.2s HoareSimplificationTime, 4 FomulaSimplificationsInter, 797169 FormulaSimplificationTreeSizeReductionInter, 11.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 19.6s 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...