./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label17.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_85e48a02-752d-4972-8df2-713138b96eec/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_85e48a02-752d-4972-8df2-713138b96eec/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_85e48a02-752d-4972-8df2-713138b96eec/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_85e48a02-752d-4972-8df2-713138b96eec/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label17.c -s /tmp/vcloud-vcloud-master/worker/run_dir_85e48a02-752d-4972-8df2-713138b96eec/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_85e48a02-752d-4972-8df2-713138b96eec/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 e99e2996098b5fdfddd3653a0ac7eff3fdd9a9c5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:13:42,972 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:13:42,974 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:13:42,986 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:13:42,986 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:13:42,987 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:13:42,989 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:13:42,991 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:13:42,994 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:13:42,995 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:13:42,996 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:13:42,997 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:13:42,998 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:13:42,999 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:13:43,000 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:13:43,001 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:13:43,002 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:13:43,003 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:13:43,005 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:13:43,008 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:13:43,010 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:13:43,011 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:13:43,013 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:13:43,014 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:13:43,017 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:13:43,018 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:13:43,018 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:13:43,019 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:13:43,020 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:13:43,021 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:13:43,021 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:13:43,022 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:13:43,023 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:13:43,024 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:13:43,025 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:13:43,026 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:13:43,026 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:13:43,027 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:13:43,027 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:13:43,028 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:13:43,029 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:13:43,030 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_85e48a02-752d-4972-8df2-713138b96eec/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:13:43,046 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:13:43,046 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:13:43,048 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:13:43,048 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:13:43,048 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:13:43,049 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:13:43,049 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:13:43,049 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:13:43,049 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:13:43,050 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:13:43,050 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:13:43,050 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:13:43,050 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:13:43,051 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:13:43,051 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:13:43,051 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:13:43,051 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:13:43,052 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:13:43,052 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:13:43,052 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:13:43,052 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:13:43,053 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:13:43,053 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:13:43,053 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:13:43,054 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:13:43,054 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:13:43,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:13:43,054 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:13:43,055 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_85e48a02-752d-4972-8df2-713138b96eec/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 -> e99e2996098b5fdfddd3653a0ac7eff3fdd9a9c5 [2019-11-15 22:13:43,085 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:13:43,098 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:13:43,102 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:13:43,103 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:13:43,103 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:13:43,104 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_85e48a02-752d-4972-8df2-713138b96eec/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem11_label17.c [2019-11-15 22:13:43,164 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_85e48a02-752d-4972-8df2-713138b96eec/bin/uautomizer/data/3e7d39f88/f604f24bc1e64d0ea7f4a27d20ff83db/FLAGb78b741a8 [2019-11-15 22:13:43,810 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:13:43,812 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_85e48a02-752d-4972-8df2-713138b96eec/sv-benchmarks/c/eca-rers2012/Problem11_label17.c [2019-11-15 22:13:43,828 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_85e48a02-752d-4972-8df2-713138b96eec/bin/uautomizer/data/3e7d39f88/f604f24bc1e64d0ea7f4a27d20ff83db/FLAGb78b741a8 [2019-11-15 22:13:43,903 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_85e48a02-752d-4972-8df2-713138b96eec/bin/uautomizer/data/3e7d39f88/f604f24bc1e64d0ea7f4a27d20ff83db [2019-11-15 22:13:43,906 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:13:43,907 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:13:43,908 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:13:43,908 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:13:43,913 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:13:43,914 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:13:43" (1/1) ... [2019-11-15 22:13:43,918 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c87769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:43, skipping insertion in model container [2019-11-15 22:13:43,919 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:13:43" (1/1) ... [2019-11-15 22:13:43,929 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:13:44,004 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:13:44,688 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:13:44,693 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:13:44,954 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:13:44,974 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:13:44,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:44 WrapperNode [2019-11-15 22:13:44,975 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:13:44,976 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:13:44,977 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:13:44,977 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:13:44,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:44" (1/1) ... [2019-11-15 22:13:45,018 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:44" (1/1) ... [2019-11-15 22:13:45,149 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:13:45,150 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:13:45,151 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:13:45,151 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:13:45,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:44" (1/1) ... [2019-11-15 22:13:45,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:44" (1/1) ... [2019-11-15 22:13:45,177 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:44" (1/1) ... [2019-11-15 22:13:45,177 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:44" (1/1) ... [2019-11-15 22:13:45,243 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:44" (1/1) ... [2019-11-15 22:13:45,272 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:44" (1/1) ... [2019-11-15 22:13:45,298 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:44" (1/1) ... [2019-11-15 22:13:45,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:13:45,318 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:13:45,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:13:45,318 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:13:45,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_85e48a02-752d-4972-8df2-713138b96eec/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:13:45,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:13:45,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:13:47,585 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:13:47,586 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 22:13:47,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:13:47 BoogieIcfgContainer [2019-11-15 22:13:47,588 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:13:47,589 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:13:47,589 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:13:47,592 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:13:47,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:13:43" (1/3) ... [2019-11-15 22:13:47,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c2c1e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:13:47, skipping insertion in model container [2019-11-15 22:13:47,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:44" (2/3) ... [2019-11-15 22:13:47,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c2c1e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:13:47, skipping insertion in model container [2019-11-15 22:13:47,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:13:47" (3/3) ... [2019-11-15 22:13:47,597 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label17.c [2019-11-15 22:13:47,608 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:13:47,617 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:13:47,629 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:13:47,660 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:13:47,660 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:13:47,660 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:13:47,661 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:13:47,661 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:13:47,661 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:13:47,661 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:13:47,662 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:13:47,686 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-11-15 22:13:47,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-15 22:13:47,695 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:13:47,696 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:13:47,698 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:13:47,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:47,705 INFO L82 PathProgramCache]: Analyzing trace with hash 323974986, now seen corresponding path program 1 times [2019-11-15 22:13:47,715 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:47,715 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115790454] [2019-11-15 22:13:47,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:47,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:47,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:47,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:48,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:13:48,129 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115790454] [2019-11-15 22:13:48,130 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:13:48,130 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:13:48,131 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924401611] [2019-11-15 22:13:48,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:13:48,136 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:13:48,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:13:48,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:13:48,153 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2019-11-15 22:13:50,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:13:50,828 INFO L93 Difference]: Finished difference Result 970 states and 1743 transitions. [2019-11-15 22:13:50,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:13:50,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-11-15 22:13:50,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:13:50,850 INFO L225 Difference]: With dead ends: 970 [2019-11-15 22:13:50,850 INFO L226 Difference]: Without dead ends: 604 [2019-11-15 22:13:50,854 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:13:50,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-11-15 22:13:50,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 598. [2019-11-15 22:13:50,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-11-15 22:13:50,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 886 transitions. [2019-11-15 22:13:50,929 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 886 transitions. Word has length 38 [2019-11-15 22:13:50,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:13:50,929 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 886 transitions. [2019-11-15 22:13:50,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:13:50,930 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 886 transitions. [2019-11-15 22:13:50,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-15 22:13:50,935 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:13:50,935 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:13:50,935 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:13:50,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:50,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1240351716, now seen corresponding path program 1 times [2019-11-15 22:13:50,936 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:50,936 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495587453] [2019-11-15 22:13:50,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:50,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:50,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:50,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:51,138 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:13:51,139 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495587453] [2019-11-15 22:13:51,139 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:13:51,139 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:13:51,140 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100538921] [2019-11-15 22:13:51,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:13:51,143 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:13:51,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:13:51,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:13:51,144 INFO L87 Difference]: Start difference. First operand 598 states and 886 transitions. Second operand 4 states. [2019-11-15 22:13:52,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:13:52,949 INFO L93 Difference]: Finished difference Result 2323 states and 3458 transitions. [2019-11-15 22:13:52,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:13:52,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-11-15 22:13:52,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:13:52,963 INFO L225 Difference]: With dead ends: 2323 [2019-11-15 22:13:52,963 INFO L226 Difference]: Without dead ends: 1727 [2019-11-15 22:13:52,966 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:13:52,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2019-11-15 22:13:53,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 1525. [2019-11-15 22:13:53,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1525 states. [2019-11-15 22:13:53,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 2143 transitions. [2019-11-15 22:13:53,050 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 2143 transitions. Word has length 107 [2019-11-15 22:13:53,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:13:53,054 INFO L462 AbstractCegarLoop]: Abstraction has 1525 states and 2143 transitions. [2019-11-15 22:13:53,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:13:53,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 2143 transitions. [2019-11-15 22:13:53,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-11-15 22:13:53,083 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:13:53,083 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 22:13:53,084 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:13:53,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:53,084 INFO L82 PathProgramCache]: Analyzing trace with hash 353029378, now seen corresponding path program 1 times [2019-11-15 22:13:53,084 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:53,084 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221124139] [2019-11-15 22:13:53,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:53,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:53,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:53,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:53,410 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-15 22:13:53,411 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221124139] [2019-11-15 22:13:53,411 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:13:53,411 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:13:53,412 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890385173] [2019-11-15 22:13:53,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:13:53,413 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:13:53,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:13:53,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:13:53,413 INFO L87 Difference]: Start difference. First operand 1525 states and 2143 transitions. Second operand 3 states. [2019-11-15 22:13:54,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:13:54,512 INFO L93 Difference]: Finished difference Result 4521 states and 6358 transitions. [2019-11-15 22:13:54,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:13:54,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 251 [2019-11-15 22:13:54,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:13:54,535 INFO L225 Difference]: With dead ends: 4521 [2019-11-15 22:13:54,535 INFO L226 Difference]: Without dead ends: 2998 [2019-11-15 22:13:54,539 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:13:54,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2998 states. [2019-11-15 22:13:54,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2998 to 2813. [2019-11-15 22:13:54,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2813 states. [2019-11-15 22:13:54,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2813 states to 2813 states and 3635 transitions. [2019-11-15 22:13:54,630 INFO L78 Accepts]: Start accepts. Automaton has 2813 states and 3635 transitions. Word has length 251 [2019-11-15 22:13:54,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:13:54,632 INFO L462 AbstractCegarLoop]: Abstraction has 2813 states and 3635 transitions. [2019-11-15 22:13:54,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:13:54,632 INFO L276 IsEmpty]: Start isEmpty. Operand 2813 states and 3635 transitions. [2019-11-15 22:13:54,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-11-15 22:13:54,640 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:13:54,641 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 22:13:54,641 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:13:54,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:54,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1768574987, now seen corresponding path program 1 times [2019-11-15 22:13:54,642 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:54,642 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460475031] [2019-11-15 22:13:54,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:54,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:54,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:55,134 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-15 22:13:55,135 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460475031] [2019-11-15 22:13:55,135 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:13:55,136 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:13:55,136 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546767498] [2019-11-15 22:13:55,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:13:55,137 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:13:55,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:13:55,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:13:55,138 INFO L87 Difference]: Start difference. First operand 2813 states and 3635 transitions. Second operand 5 states. [2019-11-15 22:13:57,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:13:57,391 INFO L93 Difference]: Finished difference Result 7659 states and 9655 transitions. [2019-11-15 22:13:57,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:13:57,391 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 269 [2019-11-15 22:13:57,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:13:57,413 INFO L225 Difference]: With dead ends: 7659 [2019-11-15 22:13:57,414 INFO L226 Difference]: Without dead ends: 4480 [2019-11-15 22:13:57,418 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:13:57,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4480 states. [2019-11-15 22:13:57,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4480 to 3735. [2019-11-15 22:13:57,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3735 states. [2019-11-15 22:13:57,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3735 states to 3735 states and 4673 transitions. [2019-11-15 22:13:57,505 INFO L78 Accepts]: Start accepts. Automaton has 3735 states and 4673 transitions. Word has length 269 [2019-11-15 22:13:57,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:13:57,506 INFO L462 AbstractCegarLoop]: Abstraction has 3735 states and 4673 transitions. [2019-11-15 22:13:57,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:13:57,506 INFO L276 IsEmpty]: Start isEmpty. Operand 3735 states and 4673 transitions. [2019-11-15 22:13:57,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-11-15 22:13:57,517 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:13:57,517 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 22:13:57,518 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:13:57,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:57,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1032835470, now seen corresponding path program 1 times [2019-11-15 22:13:57,519 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:57,519 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219364017] [2019-11-15 22:13:57,519 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:57,519 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:57,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:57,977 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:13:57,977 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219364017] [2019-11-15 22:13:57,977 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:13:57,978 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:13:57,978 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566724488] [2019-11-15 22:13:57,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:13:57,979 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:13:57,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:13:57,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:13:57,981 INFO L87 Difference]: Start difference. First operand 3735 states and 4673 transitions. Second operand 5 states. [2019-11-15 22:14:00,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:14:00,236 INFO L93 Difference]: Finished difference Result 9871 states and 12422 transitions. [2019-11-15 22:14:00,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:14:00,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 343 [2019-11-15 22:14:00,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:14:00,268 INFO L225 Difference]: With dead ends: 9871 [2019-11-15 22:14:00,268 INFO L226 Difference]: Without dead ends: 5954 [2019-11-15 22:14:00,273 INFO L600 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-15 22:14:00,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5954 states. [2019-11-15 22:14:00,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5954 to 3919. [2019-11-15 22:14:00,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3919 states. [2019-11-15 22:14:00,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3919 states to 3919 states and 4810 transitions. [2019-11-15 22:14:00,370 INFO L78 Accepts]: Start accepts. Automaton has 3919 states and 4810 transitions. Word has length 343 [2019-11-15 22:14:00,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:14:00,371 INFO L462 AbstractCegarLoop]: Abstraction has 3919 states and 4810 transitions. [2019-11-15 22:14:00,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:14:00,372 INFO L276 IsEmpty]: Start isEmpty. Operand 3919 states and 4810 transitions. [2019-11-15 22:14:00,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2019-11-15 22:14:00,389 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:14:00,390 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:14:00,390 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:14:00,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:00,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1847556996, now seen corresponding path program 1 times [2019-11-15 22:14:00,391 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:00,391 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69867146] [2019-11-15 22:14:00,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:00,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:00,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:00,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:01,020 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 419 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-15 22:14:01,020 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69867146] [2019-11-15 22:14:01,020 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358714005] [2019-11-15 22:14:01,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_85e48a02-752d-4972-8df2-713138b96eec/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:14:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:01,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:14:01,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:14:01,659 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 422 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-15 22:14:01,660 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:14:01,660 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-15 22:14:01,660 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928922751] [2019-11-15 22:14:01,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:14:01,661 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:14:01,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:14:01,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:14:01,662 INFO L87 Difference]: Start difference. First operand 3919 states and 4810 transitions. Second operand 4 states. [2019-11-15 22:14:03,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:14:03,319 INFO L93 Difference]: Finished difference Result 7838 states and 9622 transitions. [2019-11-15 22:14:03,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:14:03,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 448 [2019-11-15 22:14:03,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:14:03,351 INFO L225 Difference]: With dead ends: 7838 [2019-11-15 22:14:03,351 INFO L226 Difference]: Without dead ends: 3921 [2019-11-15 22:14:03,357 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 446 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:14:03,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3921 states. [2019-11-15 22:14:03,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3921 to 3735. [2019-11-15 22:14:03,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3735 states. [2019-11-15 22:14:03,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3735 states to 3735 states and 4596 transitions. [2019-11-15 22:14:03,438 INFO L78 Accepts]: Start accepts. Automaton has 3735 states and 4596 transitions. Word has length 448 [2019-11-15 22:14:03,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:14:03,439 INFO L462 AbstractCegarLoop]: Abstraction has 3735 states and 4596 transitions. [2019-11-15 22:14:03,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:14:03,441 INFO L276 IsEmpty]: Start isEmpty. Operand 3735 states and 4596 transitions. [2019-11-15 22:14:03,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2019-11-15 22:14:03,459 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:14:03,460 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 22:14:03,666 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:14:03,666 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:14:03,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:03,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1412155735, now seen corresponding path program 1 times [2019-11-15 22:14:03,667 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:03,667 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548649227] [2019-11-15 22:14:03,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:03,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:03,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:03,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:04,103 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-11-15 22:14:04,103 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548649227] [2019-11-15 22:14:04,103 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:14:04,104 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:14:04,104 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732957539] [2019-11-15 22:14:04,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:14:04,105 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:14:04,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:14:04,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:14:04,106 INFO L87 Difference]: Start difference. First operand 3735 states and 4596 transitions. Second operand 3 states. [2019-11-15 22:14:05,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:14:05,440 INFO L93 Difference]: Finished difference Result 9134 states and 11240 transitions. [2019-11-15 22:14:05,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:14:05,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 460 [2019-11-15 22:14:05,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:14:05,466 INFO L225 Difference]: With dead ends: 9134 [2019-11-15 22:14:05,466 INFO L226 Difference]: Without dead ends: 5401 [2019-11-15 22:14:05,473 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:14:05,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5401 states. [2019-11-15 22:14:05,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5401 to 5023. [2019-11-15 22:14:05,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5023 states. [2019-11-15 22:14:05,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5023 states to 5023 states and 6021 transitions. [2019-11-15 22:14:05,580 INFO L78 Accepts]: Start accepts. Automaton has 5023 states and 6021 transitions. Word has length 460 [2019-11-15 22:14:05,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:14:05,581 INFO L462 AbstractCegarLoop]: Abstraction has 5023 states and 6021 transitions. [2019-11-15 22:14:05,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:14:05,581 INFO L276 IsEmpty]: Start isEmpty. Operand 5023 states and 6021 transitions. [2019-11-15 22:14:05,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2019-11-15 22:14:05,601 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:14:05,602 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:14:05,602 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:14:05,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:05,603 INFO L82 PathProgramCache]: Analyzing trace with hash 663959433, now seen corresponding path program 1 times [2019-11-15 22:14:05,603 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:05,604 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115551398] [2019-11-15 22:14:05,604 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:05,604 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:05,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:05,959 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 333 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-15 22:14:05,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115551398] [2019-11-15 22:14:05,960 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:14:05,960 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:14:05,961 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985522437] [2019-11-15 22:14:05,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:14:05,962 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:14:05,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:14:05,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:14:05,963 INFO L87 Difference]: Start difference. First operand 5023 states and 6021 transitions. Second operand 3 states. [2019-11-15 22:14:07,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:14:07,223 INFO L93 Difference]: Finished difference Result 11699 states and 14062 transitions. [2019-11-15 22:14:07,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:14:07,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 467 [2019-11-15 22:14:07,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:14:07,254 INFO L225 Difference]: With dead ends: 11699 [2019-11-15 22:14:07,255 INFO L226 Difference]: Without dead ends: 5941 [2019-11-15 22:14:07,260 INFO L600 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-15 22:14:07,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5941 states. [2019-11-15 22:14:07,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5941 to 5573. [2019-11-15 22:14:07,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5573 states. [2019-11-15 22:14:07,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5573 states to 5573 states and 6559 transitions. [2019-11-15 22:14:07,360 INFO L78 Accepts]: Start accepts. Automaton has 5573 states and 6559 transitions. Word has length 467 [2019-11-15 22:14:07,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:14:07,361 INFO L462 AbstractCegarLoop]: Abstraction has 5573 states and 6559 transitions. [2019-11-15 22:14:07,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:14:07,362 INFO L276 IsEmpty]: Start isEmpty. Operand 5573 states and 6559 transitions. [2019-11-15 22:14:07,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2019-11-15 22:14:07,382 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:14:07,383 INFO L380 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:14:07,383 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:14:07,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:07,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1130789147, now seen corresponding path program 1 times [2019-11-15 22:14:07,384 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:07,384 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780508062] [2019-11-15 22:14:07,385 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:07,385 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:07,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:07,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:07,847 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-11-15 22:14:07,848 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780508062] [2019-11-15 22:14:07,848 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:14:07,848 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:14:07,849 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761456152] [2019-11-15 22:14:07,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:14:07,850 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:14:07,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:14:07,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:14:07,850 INFO L87 Difference]: Start difference. First operand 5573 states and 6559 transitions. Second operand 4 states. [2019-11-15 22:14:09,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:14:09,534 INFO L93 Difference]: Finished difference Result 12258 states and 14457 transitions. [2019-11-15 22:14:09,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:14:09,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 497 [2019-11-15 22:14:09,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:14:09,563 INFO L225 Difference]: With dead ends: 12258 [2019-11-15 22:14:09,563 INFO L226 Difference]: Without dead ends: 6687 [2019-11-15 22:14:09,569 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:14:09,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6687 states. [2019-11-15 22:14:09,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6687 to 6303. [2019-11-15 22:14:09,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6303 states. [2019-11-15 22:14:09,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6303 states to 6303 states and 7226 transitions. [2019-11-15 22:14:09,674 INFO L78 Accepts]: Start accepts. Automaton has 6303 states and 7226 transitions. Word has length 497 [2019-11-15 22:14:09,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:14:09,675 INFO L462 AbstractCegarLoop]: Abstraction has 6303 states and 7226 transitions. [2019-11-15 22:14:09,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:14:09,676 INFO L276 IsEmpty]: Start isEmpty. Operand 6303 states and 7226 transitions. [2019-11-15 22:14:09,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2019-11-15 22:14:09,689 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:14:09,689 INFO L380 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:14:09,690 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:14:09,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:09,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1206597789, now seen corresponding path program 1 times [2019-11-15 22:14:09,691 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:09,691 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396291900] [2019-11-15 22:14:09,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:09,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:09,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:09,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:10,683 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 387 proven. 366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:14:10,683 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396291900] [2019-11-15 22:14:10,683 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785008935] [2019-11-15 22:14:10,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_85e48a02-752d-4972-8df2-713138b96eec/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:14:10,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:10,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 22:14:10,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:14:10,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:14:10,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:14:10,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:14:12,266 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 237 proven. 420 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-15 22:14:12,267 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:14:12,267 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 13 [2019-11-15 22:14:12,268 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652171185] [2019-11-15 22:14:12,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 22:14:12,269 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:14:12,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 22:14:12,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:14:12,270 INFO L87 Difference]: Start difference. First operand 6303 states and 7226 transitions. Second operand 13 states. [2019-11-15 22:14:22,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:14:22,109 INFO L93 Difference]: Finished difference Result 18144 states and 20852 transitions. [2019-11-15 22:14:22,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-15 22:14:22,110 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 514 [2019-11-15 22:14:22,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:14:22,110 INFO L225 Difference]: With dead ends: 18144 [2019-11-15 22:14:22,110 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 22:14:22,121 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 560 GetRequests, 530 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=319, Invalid=673, Unknown=0, NotChecked=0, Total=992 [2019-11-15 22:14:22,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 22:14:22,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 22:14:22,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 22:14:22,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 22:14:22,122 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 514 [2019-11-15 22:14:22,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:14:22,122 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:14:22,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 22:14:22,122 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:14:22,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 22:14:22,323 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:14:22,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 22:14:22,442 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 105 [2019-11-15 22:14:22,863 WARN L191 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 39 [2019-11-15 22:14:23,162 WARN L191 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 39 [2019-11-15 22:14:23,164 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-11-15 22:14:23,165 INFO L443 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-11-15 22:14:23,165 INFO L443 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-11-15 22:14:23,165 INFO L446 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2019-11-15 22:14:23,165 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,165 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,165 INFO L443 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,165 INFO L443 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,165 INFO L443 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,165 INFO L443 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,165 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,165 INFO L443 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-15 22:14:23,166 INFO L443 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-11-15 22:14:23,166 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-11-15 22:14:23,166 INFO L443 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,166 INFO L443 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,166 INFO L443 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,166 INFO L443 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,166 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,166 INFO L443 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,166 INFO L443 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,166 INFO L443 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,166 INFO L443 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,166 INFO L443 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-11-15 22:14:23,166 INFO L443 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-11-15 22:14:23,166 INFO L443 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-11-15 22:14:23,167 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,167 INFO L439 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse2 (= ~a25~0 11)) (.cse0 (exists ((v_~a29~0_500 Int)) (and (< 277 v_~a29~0_500) (<= ~a29~0 (+ (mod v_~a29~0_500 299861) 300139)) (<= 0 v_~a29~0_500)))) (.cse4 (= ~a25~0 9)) (.cse3 (<= ~a29~0 599928)) (.cse1 (= 1 ~a4~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse2) (and .cse4 .cse0 .cse1) (and .cse0 (= 10 ~a25~0) .cse1) (and .cse4 .cse3 (<= (+ ~a23~0 43) 0)) (<= ~a29~0 277) (and .cse3 (<= 13 ~a25~0) .cse1))) [2019-11-15 22:14:23,167 INFO L443 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,167 INFO L443 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,167 INFO L443 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,167 INFO L443 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,167 INFO L443 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,167 INFO L443 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,167 INFO L443 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,167 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,168 INFO L443 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-11-15 22:14:23,168 INFO L443 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-11-15 22:14:23,168 INFO L443 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-11-15 22:14:23,168 INFO L443 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-11-15 22:14:23,168 INFO L443 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-11-15 22:14:23,168 INFO L443 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-11-15 22:14:23,168 INFO L443 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-11-15 22:14:23,168 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,168 INFO L443 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,168 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,168 INFO L443 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,168 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,169 INFO L443 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,169 INFO L443 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,169 INFO L443 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,169 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,169 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,169 INFO L443 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-11-15 22:14:23,169 INFO L443 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-11-15 22:14:23,169 INFO L443 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-11-15 22:14:23,169 INFO L443 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-11-15 22:14:23,169 INFO L443 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,169 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,169 INFO L443 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,169 INFO L443 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,170 INFO L443 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,170 INFO L443 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-11-15 22:14:23,170 INFO L443 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2019-11-15 22:14:23,170 INFO L443 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-11-15 22:14:23,170 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,170 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,170 INFO L443 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,170 INFO L443 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,170 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-11-15 22:14:23,170 INFO L443 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-11-15 22:14:23,170 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,170 INFO L443 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,171 INFO L443 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,171 INFO L443 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,171 INFO L443 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,171 INFO L443 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,171 INFO L443 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-11-15 22:14:23,171 INFO L443 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-11-15 22:14:23,171 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,171 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,171 INFO L443 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-11-15 22:14:23,171 INFO L443 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-11-15 22:14:23,171 INFO L443 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-11-15 22:14:23,171 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,171 INFO L443 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,171 INFO L443 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,174 INFO L443 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,174 INFO L443 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,174 INFO L443 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,174 INFO L443 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,174 INFO L443 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-11-15 22:14:23,174 INFO L443 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-11-15 22:14:23,174 INFO L443 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-11-15 22:14:23,175 INFO L443 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-11-15 22:14:23,175 INFO L443 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-11-15 22:14:23,175 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-11-15 22:14:23,175 INFO L443 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-11-15 22:14:23,175 INFO L443 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,175 INFO L443 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,175 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 22:14:23,175 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-11-15 22:14:23,176 INFO L443 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-11-15 22:14:23,176 INFO L443 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,176 INFO L443 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,176 INFO L443 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,176 INFO L443 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,176 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,177 INFO L443 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-11-15 22:14:23,177 INFO L443 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-11-15 22:14:23,177 INFO L443 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-11-15 22:14:23,177 INFO L443 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,177 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,177 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,177 INFO L443 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,178 INFO L443 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,178 INFO L443 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,178 INFO L443 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-11-15 22:14:23,178 INFO L443 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-11-15 22:14:23,178 INFO L443 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2019-11-15 22:14:23,178 INFO L443 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,178 INFO L443 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,179 INFO L443 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,179 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,179 INFO L443 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,179 INFO L443 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,179 INFO L443 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,179 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 22:14:23,179 INFO L443 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,179 INFO L443 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2019-11-15 22:14:23,180 INFO L443 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-11-15 22:14:23,180 INFO L443 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2019-11-15 22:14:23,180 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,180 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,180 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,180 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,180 INFO L443 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,181 INFO L443 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,181 INFO L443 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,181 INFO L443 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,181 INFO L443 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,181 INFO L443 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,181 INFO L443 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,181 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-11-15 22:14:23,182 INFO L443 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-11-15 22:14:23,182 INFO L443 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-11-15 22:14:23,182 INFO L443 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-11-15 22:14:23,182 INFO L443 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-11-15 22:14:23,182 INFO L443 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,182 INFO L443 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,182 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,183 INFO L443 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,183 INFO L443 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,183 INFO L443 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,183 INFO L443 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,183 INFO L443 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-11-15 22:14:23,183 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-11-15 22:14:23,183 INFO L443 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2019-11-15 22:14:23,184 INFO L443 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,184 INFO L443 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,184 INFO L443 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,184 INFO L443 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-11-15 22:14:23,184 INFO L443 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-11-15 22:14:23,184 INFO L443 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,184 INFO L443 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,184 INFO L443 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,185 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,185 INFO L443 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,185 INFO L443 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-11-15 22:14:23,185 INFO L443 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-11-15 22:14:23,185 INFO L443 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,185 INFO L443 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,185 INFO L443 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-11-15 22:14:23,186 INFO L443 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-11-15 22:14:23,186 INFO L443 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,186 INFO L443 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,186 INFO L443 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,186 INFO L443 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,186 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,186 INFO L443 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,187 INFO L443 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-11-15 22:14:23,187 INFO L443 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-11-15 22:14:23,187 INFO L443 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-11-15 22:14:23,187 INFO L443 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-11-15 22:14:23,187 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,187 INFO L443 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,187 INFO L443 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,188 INFO L443 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,188 INFO L443 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,188 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,188 INFO L443 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,188 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,188 INFO L443 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-11-15 22:14:23,188 INFO L443 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-11-15 22:14:23,189 INFO L443 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-11-15 22:14:23,189 INFO L443 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-11-15 22:14:23,189 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-11-15 22:14:23,189 INFO L443 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-11-15 22:14:23,189 INFO L443 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,189 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,189 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,190 INFO L443 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,190 INFO L443 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,190 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,190 INFO L443 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,190 INFO L443 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-11-15 22:14:23,190 INFO L443 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-11-15 22:14:23,190 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 22:14:23,190 INFO L443 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,191 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,191 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,191 INFO L443 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,191 INFO L443 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,191 INFO L443 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,191 INFO L443 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-11-15 22:14:23,191 INFO L443 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-11-15 22:14:23,192 INFO L443 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,192 INFO L443 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,192 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,192 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,192 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,192 INFO L443 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,192 INFO L443 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,193 INFO L443 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-11-15 22:14:23,193 INFO L443 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,193 INFO L443 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,193 INFO L443 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,193 INFO L443 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-11-15 22:14:23,193 INFO L443 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-11-15 22:14:23,193 INFO L443 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-11-15 22:14:23,193 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,194 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-11-15 22:14:23,194 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,194 INFO L443 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-11-15 22:14:23,194 INFO L443 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,194 INFO L443 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,194 INFO L443 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,194 INFO L443 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,195 INFO L443 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,195 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,195 INFO L443 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-11-15 22:14:23,195 INFO L443 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-11-15 22:14:23,195 INFO L443 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-11-15 22:14:23,195 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 120) no Hoare annotation was computed. [2019-11-15 22:14:23,195 INFO L443 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,196 INFO L443 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,196 INFO L443 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,196 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 22:14:23,196 INFO L443 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,196 INFO L443 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,196 INFO L443 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,196 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,197 INFO L443 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,197 INFO L443 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,197 INFO L443 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,197 INFO L443 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-11-15 22:14:23,197 INFO L443 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-11-15 22:14:23,197 INFO L443 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-11-15 22:14:23,198 INFO L443 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,198 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-11-15 22:14:23,198 INFO L443 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-11-15 22:14:23,198 INFO L443 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,198 INFO L443 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,198 INFO L443 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,198 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,199 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,199 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,199 INFO L443 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-11-15 22:14:23,199 INFO L443 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-15 22:14:23,199 INFO L443 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-11-15 22:14:23,199 INFO L443 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,199 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,200 INFO L443 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,200 INFO L439 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse2 (= ~a25~0 11)) (.cse0 (exists ((v_~a29~0_500 Int)) (and (< 277 v_~a29~0_500) (<= ~a29~0 (+ (mod v_~a29~0_500 299861) 300139)) (<= 0 v_~a29~0_500)))) (.cse4 (= ~a25~0 9)) (.cse3 (<= ~a29~0 599928)) (.cse1 (= 1 ~a4~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse2) (and .cse4 .cse0 .cse1) (and .cse0 (= 10 ~a25~0) .cse1) (and .cse4 .cse3 (<= (+ ~a23~0 43) 0)) (<= ~a29~0 277) (and .cse3 (<= 13 ~a25~0) .cse1))) [2019-11-15 22:14:23,200 INFO L443 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,200 INFO L443 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-11-15 22:14:23,200 INFO L443 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-11-15 22:14:23,200 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,201 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,201 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-11-15 22:14:23,201 INFO L443 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,201 INFO L443 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,201 INFO L443 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:14:23,210 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,211 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,211 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,212 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,212 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,212 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,213 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,213 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,213 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,225 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,226 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,226 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,226 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,226 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,227 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,227 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,227 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,227 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,228 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,229 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,229 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,231 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,232 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,232 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,232 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,232 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,233 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,241 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,241 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,242 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,242 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,242 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,242 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,243 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,243 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,243 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:14:23 BoogieIcfgContainer [2019-11-15 22:14:23,247 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:14:23,247 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:14:23,247 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:14:23,248 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:14:23,248 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:13:47" (3/4) ... [2019-11-15 22:14:23,252 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 22:14:23,284 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 22:14:23,286 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 22:14:23,335 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500) && 1 == a4) && a25 == 11) || (a29 <= 599928 && a25 == 11)) || ((a25 == 9 && (\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500)) && 1 == a4)) || (((\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500) && 10 == a25) && 1 == a4)) || ((a25 == 9 && a29 <= 599928) && a23 + 43 <= 0)) || a29 <= 277) || ((a29 <= 599928 && 13 <= a25) && 1 == a4) [2019-11-15 22:14:23,341 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500) && 1 == a4) && a25 == 11) || (a29 <= 599928 && a25 == 11)) || ((a25 == 9 && (\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500)) && 1 == a4)) || (((\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500) && 10 == a25) && 1 == a4)) || ((a25 == 9 && a29 <= 599928) && a23 + 43 <= 0)) || a29 <= 277) || ((a29 <= 599928 && 13 <= a25) && 1 == a4) [2019-11-15 22:14:23,583 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_85e48a02-752d-4972-8df2-713138b96eec/bin/uautomizer/witness.graphml [2019-11-15 22:14:23,583 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:14:23,585 INFO L168 Benchmark]: Toolchain (without parser) took 39677.86 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.0 GB). Free memory was 939.4 MB in the beginning and 1.3 GB in the end (delta: -323.7 MB). Peak memory consumption was 715.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:14:23,586 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:14:23,586 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1067.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -144.1 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:14:23,587 INFO L168 Benchmark]: Boogie Procedure Inliner took 173.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:14:23,587 INFO L168 Benchmark]: Boogie Preprocessor took 166.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:14:23,587 INFO L168 Benchmark]: RCFGBuilder took 2270.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 883.0 MB in the end (delta: 173.7 MB). Peak memory consumption was 173.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:14:23,588 INFO L168 Benchmark]: TraceAbstraction took 35657.97 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 906.0 MB). Free memory was 883.0 MB in the beginning and 1.3 GB in the end (delta: -411.1 MB). Peak memory consumption was 494.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:14:23,588 INFO L168 Benchmark]: Witness Printer took 335.88 ms. Allocated memory is still 2.1 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:14:23,591 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.22 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 1067.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -144.1 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 173.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 166.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2270.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 883.0 MB in the end (delta: 173.7 MB). Peak memory consumption was 173.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 35657.97 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 906.0 MB). Free memory was 883.0 MB in the beginning and 1.3 GB in the end (delta: -411.1 MB). Peak memory consumption was 494.9 MB. Max. memory is 11.5 GB. * Witness Printer took 335.88 ms. Allocated memory is still 2.1 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 120]: 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: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant [2019-11-15 22:14:23,604 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,604 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,605 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,605 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,605 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,605 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,606 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,606 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,606 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,608 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,608 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,609 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,609 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,609 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,610 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,610 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,610 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,610 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] Derived loop invariant: ((((((((\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500) && 1 == a4) && a25 == 11) || (a29 <= 599928 && a25 == 11)) || ((a25 == 9 && (\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500)) && 1 == a4)) || (((\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500) && 10 == a25) && 1 == a4)) || ((a25 == 9 && a29 <= 599928) && a23 + 43 <= 0)) || a29 <= 277) || ((a29 <= 599928 && 13 <= a25) && 1 == a4) - InvariantResult [Line: 22]: Loop Invariant [2019-11-15 22:14:23,612 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,612 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,613 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,613 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,613 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,614 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,614 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,614 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,614 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,615 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,615 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,616 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,616 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,616 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,617 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,617 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,617 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 22:14:23,617 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] Derived loop invariant: ((((((((\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500) && 1 == a4) && a25 == 11) || (a29 <= 599928 && a25 == 11)) || ((a25 == 9 && (\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500)) && 1 == a4)) || (((\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500) && 10 == a25) && 1 == a4)) || ((a25 == 9 && a29 <= 599928) && a23 + 43 <= 0)) || a29 <= 277) || ((a29 <= 599928 && 13 <= a25) && 1 == a4) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Result: SAFE, OverallTime: 35.5s, OverallIterations: 10, TraceHistogramMax: 5, AutomataDifference: 26.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, HoareTripleCheckerStatistics: 1341 SDtfs, 6540 SDslu, 529 SDs, 0 SdLazy, 15284 SolverSat, 3157 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1040 GetRequests, 988 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6303occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 10 MinimizatonAttempts, 4489 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 148 NumberOfFragments, 199 HoareAnnotationTreeSize, 3 FomulaSimplifications, 8156 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1436 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 4356 NumberOfCodeBlocks, 4356 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 4344 ConstructedInterpolants, 198 QuantifiedInterpolants, 6098752 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1235 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 3849/4638 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...