./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/nested6.i --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_fb248350-62bf-45ac-bfb8-6788fd21df13/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fb248350-62bf-45ac-bfb8-6788fd21df13/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fb248350-62bf-45ac-bfb8-6788fd21df13/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fb248350-62bf-45ac-bfb8-6788fd21df13/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/nested6.i -s /tmp/vcloud-vcloud-master/worker/run_dir_fb248350-62bf-45ac-bfb8-6788fd21df13/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fb248350-62bf-45ac-bfb8-6788fd21df13/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 934ee9c856a834ce808d29dea79c6912619f897f ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:18:03,218 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:18:03,220 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:18:03,239 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:18:03,239 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:18:03,241 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:18:03,243 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:18:03,258 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:18:03,260 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:18:03,261 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:18:03,262 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:18:03,263 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:18:03,264 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:18:03,265 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:18:03,266 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:18:03,267 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:18:03,269 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:18:03,270 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:18:03,272 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:18:03,274 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:18:03,276 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:18:03,277 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:18:03,279 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:18:03,280 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:18:03,283 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:18:03,283 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:18:03,284 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:18:03,285 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:18:03,285 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:18:03,287 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:18:03,287 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:18:03,288 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:18:03,289 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:18:03,290 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:18:03,291 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:18:03,291 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:18:03,292 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:18:03,292 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:18:03,293 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:18:03,294 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:18:03,295 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:18:03,296 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fb248350-62bf-45ac-bfb8-6788fd21df13/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:18:03,314 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:18:03,314 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:18:03,315 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:18:03,316 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:18:03,316 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:18:03,316 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:18:03,317 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:18:03,317 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:18:03,317 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:18:03,318 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:18:03,318 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:18:03,318 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:18:03,318 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:18:03,319 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:18:03,319 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:18:03,319 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:18:03,320 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:18:03,320 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:18:03,320 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:18:03,320 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:18:03,325 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:18:03,325 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:18:03,326 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:18:03,326 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:18:03,326 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:18:03,327 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:18:03,327 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:18:03,327 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:18:03,327 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_fb248350-62bf-45ac-bfb8-6788fd21df13/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 -> 934ee9c856a834ce808d29dea79c6912619f897f [2019-11-15 23:18:03,359 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:18:03,371 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:18:03,375 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:18:03,377 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:18:03,377 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:18:03,378 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fb248350-62bf-45ac-bfb8-6788fd21df13/bin/uautomizer/../../sv-benchmarks/c/loop-invgen/nested6.i [2019-11-15 23:18:03,458 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fb248350-62bf-45ac-bfb8-6788fd21df13/bin/uautomizer/data/f0dbbeea3/ec73d03928814d7db05c0ebfde255ee0/FLAG3a7322d3e [2019-11-15 23:18:03,911 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:18:03,913 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fb248350-62bf-45ac-bfb8-6788fd21df13/sv-benchmarks/c/loop-invgen/nested6.i [2019-11-15 23:18:03,921 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fb248350-62bf-45ac-bfb8-6788fd21df13/bin/uautomizer/data/f0dbbeea3/ec73d03928814d7db05c0ebfde255ee0/FLAG3a7322d3e [2019-11-15 23:18:04,309 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fb248350-62bf-45ac-bfb8-6788fd21df13/bin/uautomizer/data/f0dbbeea3/ec73d03928814d7db05c0ebfde255ee0 [2019-11-15 23:18:04,311 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:18:04,313 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:18:04,314 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:18:04,314 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:18:04,318 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:18:04,319 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:18:04" (1/1) ... [2019-11-15 23:18:04,322 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cd041c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:18:04, skipping insertion in model container [2019-11-15 23:18:04,323 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:18:04" (1/1) ... [2019-11-15 23:18:04,332 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:18:04,360 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:18:04,717 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:18:04,725 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:18:04,745 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:18:04,759 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:18:04,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:18:04 WrapperNode [2019-11-15 23:18:04,760 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:18:04,761 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:18:04,762 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:18:04,762 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:18:04,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:18:04" (1/1) ... [2019-11-15 23:18:04,779 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:18:04" (1/1) ... [2019-11-15 23:18:04,807 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:18:04,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:18:04,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:18:04,810 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:18:04,820 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:18:04" (1/1) ... [2019-11-15 23:18:04,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:18:04" (1/1) ... [2019-11-15 23:18:04,822 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:18:04" (1/1) ... [2019-11-15 23:18:04,823 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:18:04" (1/1) ... [2019-11-15 23:18:04,835 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:18:04" (1/1) ... [2019-11-15 23:18:04,843 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:18:04" (1/1) ... [2019-11-15 23:18:04,850 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:18:04" (1/1) ... [2019-11-15 23:18:04,853 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:18:04,856 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:18:04,856 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:18:04,856 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:18:04,857 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:18:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fb248350-62bf-45ac-bfb8-6788fd21df13/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:18:04,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:18:04,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:18:05,171 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:18:05,171 INFO L284 CfgBuilder]: Removed 13 assume(true) statements. [2019-11-15 23:18:05,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:18:05 BoogieIcfgContainer [2019-11-15 23:18:05,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:18:05,173 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:18:05,174 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:18:05,178 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:18:05,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:18:04" (1/3) ... [2019-11-15 23:18:05,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f6eb7ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:18:05, skipping insertion in model container [2019-11-15 23:18:05,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:18:04" (2/3) ... [2019-11-15 23:18:05,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f6eb7ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:18:05, skipping insertion in model container [2019-11-15 23:18:05,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:18:05" (3/3) ... [2019-11-15 23:18:05,183 INFO L109 eAbstractionObserver]: Analyzing ICFG nested6.i [2019-11-15 23:18:05,193 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:18:05,200 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 23:18:05,216 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 23:18:05,267 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:18:05,267 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:18:05,267 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:18:05,268 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:18:05,268 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:18:05,268 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:18:05,268 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:18:05,268 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:18:05,283 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-11-15 23:18:05,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-15 23:18:05,289 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:18:05,290 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:18:05,291 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:18:05,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:18:05,297 INFO L82 PathProgramCache]: Analyzing trace with hash -346948471, now seen corresponding path program 1 times [2019-11-15 23:18:05,304 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:18:05,305 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990977251] [2019-11-15 23:18:05,305 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:05,305 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:05,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:18:05,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:05,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:18:05,476 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990977251] [2019-11-15 23:18:05,477 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:18:05,477 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:18:05,477 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770379484] [2019-11-15 23:18:05,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:18:05,492 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:18:05,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:18:05,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:18:05,511 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 4 states. [2019-11-15 23:18:05,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:18:05,650 INFO L93 Difference]: Finished difference Result 58 states and 83 transitions. [2019-11-15 23:18:05,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:18:05,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-15 23:18:05,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:18:05,660 INFO L225 Difference]: With dead ends: 58 [2019-11-15 23:18:05,661 INFO L226 Difference]: Without dead ends: 25 [2019-11-15 23:18:05,663 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:18:05,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-15 23:18:05,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2019-11-15 23:18:05,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-15 23:18:05,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-11-15 23:18:05,701 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 9 [2019-11-15 23:18:05,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:18:05,701 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-11-15 23:18:05,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:18:05,702 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2019-11-15 23:18:05,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 23:18:05,704 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:18:05,705 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:18:05,706 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:18:05,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:18:05,706 INFO L82 PathProgramCache]: Analyzing trace with hash 2128734748, now seen corresponding path program 1 times [2019-11-15 23:18:05,706 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:18:05,707 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25126340] [2019-11-15 23:18:05,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:05,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:05,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:18:05,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:05,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:18:05,772 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25126340] [2019-11-15 23:18:05,772 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:18:05,773 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:18:05,773 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107269519] [2019-11-15 23:18:05,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:18:05,775 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:18:05,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:18:05,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:18:05,776 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 5 states. [2019-11-15 23:18:06,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:18:06,008 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2019-11-15 23:18:06,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:18:06,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-15 23:18:06,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:18:06,011 INFO L225 Difference]: With dead ends: 37 [2019-11-15 23:18:06,011 INFO L226 Difference]: Without dead ends: 35 [2019-11-15 23:18:06,012 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:18:06,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-15 23:18:06,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 17. [2019-11-15 23:18:06,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-15 23:18:06,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-11-15 23:18:06,018 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 10 [2019-11-15 23:18:06,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:18:06,018 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-15 23:18:06,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:18:06,019 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2019-11-15 23:18:06,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 23:18:06,019 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:18:06,019 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:18:06,020 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:18:06,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:18:06,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1590125452, now seen corresponding path program 1 times [2019-11-15 23:18:06,020 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:18:06,022 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758609465] [2019-11-15 23:18:06,023 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:06,024 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:06,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:18:06,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:06,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:18:06,104 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758609465] [2019-11-15 23:18:06,105 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:18:06,105 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:18:06,105 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342290904] [2019-11-15 23:18:06,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:18:06,106 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:18:06,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:18:06,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:18:06,107 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 4 states. [2019-11-15 23:18:06,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:18:06,214 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2019-11-15 23:18:06,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:18:06,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-15 23:18:06,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:18:06,216 INFO L225 Difference]: With dead ends: 37 [2019-11-15 23:18:06,217 INFO L226 Difference]: Without dead ends: 35 [2019-11-15 23:18:06,217 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:18:06,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-15 23:18:06,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2019-11-15 23:18:06,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-15 23:18:06,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2019-11-15 23:18:06,227 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 11 [2019-11-15 23:18:06,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:18:06,227 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2019-11-15 23:18:06,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:18:06,228 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2019-11-15 23:18:06,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 23:18:06,229 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:18:06,229 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:18:06,229 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:18:06,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:18:06,230 INFO L82 PathProgramCache]: Analyzing trace with hash -520059879, now seen corresponding path program 1 times [2019-11-15 23:18:06,230 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:18:06,230 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693964780] [2019-11-15 23:18:06,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:06,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:06,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:18:06,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:06,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:18:06,290 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693964780] [2019-11-15 23:18:06,290 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:18:06,290 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:18:06,290 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954740075] [2019-11-15 23:18:06,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:18:06,291 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:18:06,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:18:06,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:18:06,291 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand 6 states. [2019-11-15 23:18:06,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:18:06,549 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2019-11-15 23:18:06,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:18:06,550 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-15 23:18:06,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:18:06,553 INFO L225 Difference]: With dead ends: 62 [2019-11-15 23:18:06,553 INFO L226 Difference]: Without dead ends: 60 [2019-11-15 23:18:06,554 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:18:06,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-15 23:18:06,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 28. [2019-11-15 23:18:06,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-15 23:18:06,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-11-15 23:18:06,564 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 15 [2019-11-15 23:18:06,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:18:06,565 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-15 23:18:06,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:18:06,565 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2019-11-15 23:18:06,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 23:18:06,566 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:18:06,566 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:18:06,566 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:18:06,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:18:06,567 INFO L82 PathProgramCache]: Analyzing trace with hash 744235909, now seen corresponding path program 1 times [2019-11-15 23:18:06,567 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:18:06,567 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567540454] [2019-11-15 23:18:06,567 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:06,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:06,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:18:06,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:06,699 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:18:06,699 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567540454] [2019-11-15 23:18:06,700 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608189166] [2019-11-15 23:18:06,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fb248350-62bf-45ac-bfb8-6788fd21df13/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:18:06,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:06,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:18:06,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:18:06,879 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:18:06,879 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:18:06,879 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 10 [2019-11-15 23:18:06,880 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535157872] [2019-11-15 23:18:06,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:18:06,880 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:18:06,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:18:06,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:18:06,881 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 5 states. [2019-11-15 23:18:07,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:18:07,100 INFO L93 Difference]: Finished difference Result 88 states and 113 transitions. [2019-11-15 23:18:07,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:18:07,100 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-15 23:18:07,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:18:07,102 INFO L225 Difference]: With dead ends: 88 [2019-11-15 23:18:07,102 INFO L226 Difference]: Without dead ends: 64 [2019-11-15 23:18:07,103 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:18:07,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-15 23:18:07,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 32. [2019-11-15 23:18:07,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-15 23:18:07,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2019-11-15 23:18:07,113 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 18 [2019-11-15 23:18:07,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:18:07,114 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2019-11-15 23:18:07,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:18:07,114 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2019-11-15 23:18:07,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 23:18:07,115 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:18:07,115 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:18:07,316 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:18:07,316 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:18:07,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:18:07,317 INFO L82 PathProgramCache]: Analyzing trace with hash -834677719, now seen corresponding path program 1 times [2019-11-15 23:18:07,317 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:18:07,317 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731820079] [2019-11-15 23:18:07,317 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:07,317 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:07,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:18:07,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:07,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:18:07,407 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731820079] [2019-11-15 23:18:07,407 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214047539] [2019-11-15 23:18:07,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fb248350-62bf-45ac-bfb8-6788fd21df13/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:18:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:07,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:18:07,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:18:07,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:18:07,483 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:18:07,483 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-11-15 23:18:07,483 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241334837] [2019-11-15 23:18:07,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:18:07,484 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:18:07,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:18:07,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:18:07,485 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand 8 states. [2019-11-15 23:18:07,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:18:07,797 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2019-11-15 23:18:07,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 23:18:07,798 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-11-15 23:18:07,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:18:07,799 INFO L225 Difference]: With dead ends: 65 [2019-11-15 23:18:07,799 INFO L226 Difference]: Without dead ends: 41 [2019-11-15 23:18:07,800 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-11-15 23:18:07,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-15 23:18:07,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2019-11-15 23:18:07,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-15 23:18:07,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2019-11-15 23:18:07,820 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 18 [2019-11-15 23:18:07,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:18:07,821 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2019-11-15 23:18:07,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:18:07,821 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2019-11-15 23:18:07,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 23:18:07,823 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:18:07,823 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:18:08,026 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:18:08,027 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:18:08,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:18:08,027 INFO L82 PathProgramCache]: Analyzing trace with hash -417195659, now seen corresponding path program 1 times [2019-11-15 23:18:08,028 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:18:08,028 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056809900] [2019-11-15 23:18:08,028 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:08,028 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:08,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:18:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:08,123 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:18:08,123 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056809900] [2019-11-15 23:18:08,123 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964422131] [2019-11-15 23:18:08,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fb248350-62bf-45ac-bfb8-6788fd21df13/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:18:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:08,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:18:08,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:18:08,278 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:18:08,278 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:18:08,278 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-11-15 23:18:08,278 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739753940] [2019-11-15 23:18:08,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 23:18:08,279 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:18:08,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 23:18:08,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:18:08,280 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand 13 states. [2019-11-15 23:18:08,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:18:08,906 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2019-11-15 23:18:08,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-15 23:18:08,907 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2019-11-15 23:18:08,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:18:08,908 INFO L225 Difference]: With dead ends: 96 [2019-11-15 23:18:08,908 INFO L226 Difference]: Without dead ends: 73 [2019-11-15 23:18:08,909 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=191, Invalid=621, Unknown=0, NotChecked=0, Total=812 [2019-11-15 23:18:08,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-15 23:18:08,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 38. [2019-11-15 23:18:08,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-15 23:18:08,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2019-11-15 23:18:08,921 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 21 [2019-11-15 23:18:08,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:18:08,922 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2019-11-15 23:18:08,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 23:18:08,922 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2019-11-15 23:18:08,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 23:18:08,923 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:18:08,923 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:18:09,138 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:18:09,138 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:18:09,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:18:09,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1996109287, now seen corresponding path program 2 times [2019-11-15 23:18:09,138 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:18:09,139 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932144020] [2019-11-15 23:18:09,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:09,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:09,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:18:09,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:09,268 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:18:09,268 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932144020] [2019-11-15 23:18:09,268 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459485476] [2019-11-15 23:18:09,269 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fb248350-62bf-45ac-bfb8-6788fd21df13/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:18:09,317 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:18:09,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:18:09,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 23:18:09,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:18:09,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:18:09,357 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:18:09,357 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:18:09,357 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2019-11-15 23:18:09,357 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430592641] [2019-11-15 23:18:09,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:18:09,358 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:18:09,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:18:09,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:18:09,359 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 5 states. [2019-11-15 23:18:09,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:18:09,469 INFO L93 Difference]: Finished difference Result 62 states and 77 transitions. [2019-11-15 23:18:09,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:18:09,471 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-15 23:18:09,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:18:09,472 INFO L225 Difference]: With dead ends: 62 [2019-11-15 23:18:09,473 INFO L226 Difference]: Without dead ends: 60 [2019-11-15 23:18:09,473 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:18:09,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-15 23:18:09,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 40. [2019-11-15 23:18:09,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-15 23:18:09,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2019-11-15 23:18:09,493 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 21 [2019-11-15 23:18:09,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:18:09,493 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-11-15 23:18:09,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:18:09,494 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2019-11-15 23:18:09,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 23:18:09,495 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:18:09,499 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:18:09,702 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:18:09,702 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:18:09,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:18:09,702 INFO L82 PathProgramCache]: Analyzing trace with hash 98780674, now seen corresponding path program 1 times [2019-11-15 23:18:09,703 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:18:09,703 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064171043] [2019-11-15 23:18:09,703 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:09,703 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:09,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:18:09,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:09,820 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:18:09,820 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064171043] [2019-11-15 23:18:09,821 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004042522] [2019-11-15 23:18:09,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fb248350-62bf-45ac-bfb8-6788fd21df13/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:18:09,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:09,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:18:09,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:18:09,926 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 23:18:09,926 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:18:09,927 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2019-11-15 23:18:09,927 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144145828] [2019-11-15 23:18:09,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:18:09,927 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:18:09,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:18:09,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:18:09,928 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 4 states. [2019-11-15 23:18:09,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:18:09,985 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2019-11-15 23:18:09,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:18:09,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-15 23:18:09,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:18:09,987 INFO L225 Difference]: With dead ends: 57 [2019-11-15 23:18:09,987 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 23:18:09,988 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:18:09,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 23:18:09,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 23:18:09,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 23:18:09,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:18:09,989 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2019-11-15 23:18:09,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:18:09,989 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:18:09,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:18:09,989 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:18:09,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 23:18:10,190 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:18:10,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 23:18:10,814 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 26 [2019-11-15 23:18:11,033 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 31 [2019-11-15 23:18:13,363 WARN L191 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 60 DAG size of output: 30 [2019-11-15 23:18:13,366 INFO L443 ceAbstractionStarter]: For program point L19-2(lines 19 31) no Hoare annotation was computed. [2019-11-15 23:18:13,367 INFO L439 ceAbstractionStarter]: At program point L19-3(lines 19 31) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~n~0)) (.cse2 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse4 (<= ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~j~0)) (.cse1 (<= ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~k~0))) (or (and (<= ULTIMATE.start_main_~i~0 0) (and .cse0 .cse1)) (let ((.cse3 (div (+ (- ULTIMATE.start_main_~n~0) 1) (- 2)))) (and .cse2 (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~i~0) (<= .cse3 0) .cse4 (<= (+ .cse3 1) ULTIMATE.start_main_~i~0) .cse1)) (and .cse0 .cse2 .cse4 .cse1))) [2019-11-15 23:18:13,367 INFO L443 ceAbstractionStarter]: For program point L15(lines 15 18) no Hoare annotation was computed. [2019-11-15 23:18:13,367 INFO L443 ceAbstractionStarter]: For program point L15-1(lines 15 18) no Hoare annotation was computed. [2019-11-15 23:18:13,367 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-15 23:18:13,367 INFO L446 ceAbstractionStarter]: At program point L32(lines 10 34) the Hoare annotation is: true [2019-11-15 23:18:13,367 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 23:18:13,367 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 23:18:13,368 INFO L439 ceAbstractionStarter]: At program point L20-2(lines 20 30) the Hoare annotation is: (let ((.cse3 (* 2 ULTIMATE.start_main_~i~0))) (let ((.cse1 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse2 (and (<= .cse3 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~k~0))) (.cse0 (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~n~0))) (or (and .cse0 (and .cse1 .cse2)) (and (<= ULTIMATE.start_main_~i~0 0) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~k~0 (+ .cse3 1)) .cse1 .cse2) (let ((.cse4 (div (- ULTIMATE.start_main_~j~0) (- 2)))) (and (<= (+ .cse4 1) ULTIMATE.start_main_~n~0) .cse2 .cse0 (<= .cse4 0) (<= ULTIMATE.start_main_~j~0 .cse3)))))) [2019-11-15 23:18:13,368 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-11-15 23:18:13,368 INFO L439 ceAbstractionStarter]: At program point L4-2(lines 1 34) the Hoare annotation is: (let ((.cse0 (* 2 ULTIMATE.start_main_~i~0))) (and (<= .cse0 ULTIMATE.start_main_~k~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= .cse0 ULTIMATE.start_main_~j~0) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0) (< ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~n~0))) [2019-11-15 23:18:13,368 INFO L443 ceAbstractionStarter]: For program point L4-3(lines 4 6) no Hoare annotation was computed. [2019-11-15 23:18:13,368 INFO L446 ceAbstractionStarter]: At program point L33(lines 10 34) the Hoare annotation is: true [2019-11-15 23:18:13,368 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 23:18:13,369 INFO L439 ceAbstractionStarter]: At program point L4-5(lines 3 8) the Hoare annotation is: (and (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~n~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= (* 2 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~j~0) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0) (<= ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~k~0)) [2019-11-15 23:18:13,369 INFO L443 ceAbstractionStarter]: For program point L4-6(lines 4 6) no Hoare annotation was computed. [2019-11-15 23:18:13,369 INFO L439 ceAbstractionStarter]: At program point L4-8(lines 1 34) the Hoare annotation is: (let ((.cse1 (* 2 ULTIMATE.start_main_~i~0))) (let ((.cse0 (and (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (and (<= .cse1 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~k~0))))) (or (and (<= ULTIMATE.start_main_~i~0 0) (and .cse0 (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~j~0 1))) (<= ULTIMATE.start_main_~j~0 .cse1)) (and (and .cse0 (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~n~0)) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))))) [2019-11-15 23:18:13,369 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 29) no Hoare annotation was computed. [2019-11-15 23:18:13,369 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-15 23:18:13,369 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-11-15 23:18:13,369 INFO L443 ceAbstractionStarter]: For program point L5-1(line 5) no Hoare annotation was computed. [2019-11-15 23:18:13,370 INFO L443 ceAbstractionStarter]: For program point L5-2(line 5) no Hoare annotation was computed. [2019-11-15 23:18:13,370 INFO L439 ceAbstractionStarter]: At program point L22-2(lines 22 24) the Hoare annotation is: (let ((.cse1 (* 2 ULTIMATE.start_main_~i~0))) (let ((.cse0 (<= .cse1 ULTIMATE.start_main_~k~0))) (or (and (and .cse0 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= .cse1 ULTIMATE.start_main_~j~0)) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~n~0) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0)) (and (exists ((ULTIMATE.start_main_~j~0 Int)) (let ((.cse2 (div (- ULTIMATE.start_main_~j~0) (- 2)))) (and (<= (+ .cse2 1) ULTIMATE.start_main_~n~0) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0) (<= .cse2 0)))) (and (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0) .cse0) (<= ULTIMATE.start_main_~j~0 .cse1))))) [2019-11-15 23:18:13,370 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-15 23:18:13,371 INFO L443 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2019-11-15 23:18:13,394 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] [2019-11-15 23:18:13,395 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] [2019-11-15 23:18:13,395 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] [2019-11-15 23:18:13,398 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] [2019-11-15 23:18:13,411 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] [2019-11-15 23:18:13,412 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] [2019-11-15 23:18:13,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:18:13 BoogieIcfgContainer [2019-11-15 23:18:13,415 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:18:13,415 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:18:13,415 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:18:13,416 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:18:13,416 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:18:05" (3/4) ... [2019-11-15 23:18:13,420 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 23:18:13,434 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-11-15 23:18:13,435 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 23:18:13,474 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((2 * i <= k && !(0 == cond)) && 2 * i <= j) && k <= n) && j < n) || (((\exists ULTIMATE.start_main_~j~0 : int :: (-ULTIMATE.start_main_~j~0 / -2 + 1 <= n && k <= ULTIMATE.start_main_~j~0) && -ULTIMATE.start_main_~j~0 / -2 <= 0) && k <= j && 2 * i <= k) && j <= 2 * i) [2019-11-15 23:18:13,511 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_fb248350-62bf-45ac-bfb8-6788fd21df13/bin/uautomizer/witness.graphml [2019-11-15 23:18:13,512 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:18:13,513 INFO L168 Benchmark]: Toolchain (without parser) took 9200.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 944.7 MB in the beginning and 908.0 MB in the end (delta: 36.8 MB). Peak memory consumption was 204.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:18:13,514 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:18:13,515 INFO L168 Benchmark]: CACSL2BoogieTranslator took 447.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -217.6 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:18:13,515 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:18:13,516 INFO L168 Benchmark]: Boogie Preprocessor took 46.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:18:13,516 INFO L168 Benchmark]: RCFGBuilder took 316.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:18:13,517 INFO L168 Benchmark]: TraceAbstraction took 8241.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 914.8 MB in the end (delta: 223.8 MB). Peak memory consumption was 223.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:18:13,517 INFO L168 Benchmark]: Witness Printer took 96.74 ms. Allocated memory is still 1.2 GB. Free memory was 914.8 MB in the beginning and 908.0 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:18:13,519 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 447.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -217.6 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 316.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8241.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 914.8 MB in the end (delta: 223.8 MB). Peak memory consumption was 223.8 MB. Max. memory is 11.5 GB. * Witness Printer took 96.74 ms. Allocated memory is still 1.2 GB. Free memory was 914.8 MB in the beginning and 908.0 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((k <= n && !(0 == cond)) && 2 * i <= j) && j < n) && n <= k - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: ((i <= 0 && k <= n && n <= k) || (((((!(0 == cond) && k <= i) && (-n + 1) / -2 <= 0) && n <= j) && (-n + 1) / -2 + 1 <= i) && n <= k)) || (((k <= n && !(0 == cond)) && n <= j) && n <= k) - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((i <= 0 && (!(0 == cond) && 2 * i <= j && n <= k) && k <= j + 1) && j <= 2 * i) || (((!(0 == cond) && 2 * i <= j && n <= k) && k <= n) && j < n) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((2 * i <= k && !(0 == cond)) && 2 * i <= j) && j < n) && k < n - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((k <= n && !(0 == cond) && 2 * i <= j && n <= k) || ((((i <= 0 && k <= j) && k <= 2 * i + 1) && !(0 == cond)) && 2 * i <= j && n <= k)) || ((((-j / -2 + 1 <= n && 2 * i <= j && n <= k) && k <= n) && -j / -2 <= 0) && j <= 2 * i) - InvariantResult [Line: 22]: Loop Invariant [2019-11-15 23:18:13,532 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] [2019-11-15 23:18:13,532 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] [2019-11-15 23:18:13,533 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] [2019-11-15 23:18:13,533 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] [2019-11-15 23:18:13,533 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] [2019-11-15 23:18:13,534 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] Derived loop invariant: ((((2 * i <= k && !(0 == cond)) && 2 * i <= j) && k <= n) && j < n) || (((\exists ULTIMATE.start_main_~j~0 : int :: (-ULTIMATE.start_main_~j~0 / -2 + 1 <= n && k <= ULTIMATE.start_main_~j~0) && -ULTIMATE.start_main_~j~0 / -2 <= 0) && k <= j && 2 * i <= k) && j <= 2 * i) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 3 error locations. Result: SAFE, OverallTime: 8.1s, OverallIterations: 9, TraceHistogramMax: 3, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.1s, HoareTripleCheckerStatistics: 169 SDtfs, 266 SDslu, 249 SDs, 0 SdLazy, 579 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 203 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 159 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 33 NumberOfFragments, 289 HoareAnnotationTreeSize, 8 FomulaSimplifications, 24769 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 8 FomulaSimplificationsInter, 5148 FormulaSimplificationTreeSizeReductionInter, 2.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 249 NumberOfCodeBlocks, 249 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 235 ConstructedInterpolants, 1 QuantifiedInterpolants, 14081 SizeOfPredicates, 18 NumberOfNonLiveVariables, 287 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 38/72 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...