./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label03.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_19660fea-466e-4056-9093-0d6e19c7d671/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_19660fea-466e-4056-9093-0d6e19c7d671/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_19660fea-466e-4056-9093-0d6e19c7d671/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_19660fea-466e-4056-9093-0d6e19c7d671/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label03.c -s /tmp/vcloud-vcloud-master/worker/run_dir_19660fea-466e-4056-9093-0d6e19c7d671/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_19660fea-466e-4056-9093-0d6e19c7d671/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 a91f469417fecfcde25fa5a52b02f071d3462166 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 20:04:26,008 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:04:26,009 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:04:26,023 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:04:26,023 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:04:26,025 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:04:26,026 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:04:26,035 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:04:26,039 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:04:26,043 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:04:26,044 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:04:26,046 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:04:26,046 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:04:26,048 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:04:26,049 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:04:26,050 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:04:26,050 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:04:26,051 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:04:26,053 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:04:26,056 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:04:26,059 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:04:26,061 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:04:26,063 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:04:26,064 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:04:26,067 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:04:26,067 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:04:26,067 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:04:26,068 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:04:26,069 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:04:26,069 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:04:26,070 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:04:26,070 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:04:26,071 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:04:26,071 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:04:26,072 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:04:26,073 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:04:26,073 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:04:26,073 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:04:26,074 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:04:26,074 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:04:26,075 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:04:26,076 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_19660fea-466e-4056-9093-0d6e19c7d671/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:04:26,099 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:04:26,099 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:04:26,100 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:04:26,100 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:04:26,101 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:04:26,101 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:04:26,101 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:04:26,101 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:04:26,101 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:04:26,102 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:04:26,102 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:04:26,102 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:04:26,102 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:04:26,102 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:04:26,103 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:04:26,103 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:04:26,103 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:04:26,103 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:04:26,104 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:04:26,104 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:04:26,104 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:04:26,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:04:26,104 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:04:26,105 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:04:26,105 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:04:26,105 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:04:26,106 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:04:26,106 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:04:26,107 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_19660fea-466e-4056-9093-0d6e19c7d671/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 -> a91f469417fecfcde25fa5a52b02f071d3462166 [2019-11-15 20:04:26,143 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:04:26,159 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:04:26,164 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:04:26,166 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:04:26,166 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:04:26,167 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_19660fea-466e-4056-9093-0d6e19c7d671/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem01_label03.c [2019-11-15 20:04:26,215 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_19660fea-466e-4056-9093-0d6e19c7d671/bin/uautomizer/data/5748f5e87/f0a5fdb9a1fc4f64b741283f93ba118d/FLAG1944d17c3 [2019-11-15 20:04:26,694 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:04:26,694 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_19660fea-466e-4056-9093-0d6e19c7d671/sv-benchmarks/c/eca-rers2012/Problem01_label03.c [2019-11-15 20:04:26,705 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_19660fea-466e-4056-9093-0d6e19c7d671/bin/uautomizer/data/5748f5e87/f0a5fdb9a1fc4f64b741283f93ba118d/FLAG1944d17c3 [2019-11-15 20:04:26,723 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_19660fea-466e-4056-9093-0d6e19c7d671/bin/uautomizer/data/5748f5e87/f0a5fdb9a1fc4f64b741283f93ba118d [2019-11-15 20:04:26,725 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:04:26,726 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:04:26,727 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:04:26,727 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:04:26,731 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:04:26,731 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:04:26" (1/1) ... [2019-11-15 20:04:26,733 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e2ced30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:04:26, skipping insertion in model container [2019-11-15 20:04:26,733 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:04:26" (1/1) ... [2019-11-15 20:04:26,740 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:04:26,793 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:04:27,187 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:04:27,192 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:04:27,342 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:04:27,359 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:04:27,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:04:27 WrapperNode [2019-11-15 20:04:27,360 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:04:27,360 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:04:27,361 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:04:27,361 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:04:27,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:04:27" (1/1) ... [2019-11-15 20:04:27,389 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:04:27" (1/1) ... [2019-11-15 20:04:27,451 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:04:27,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:04:27,452 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:04:27,453 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:04:27,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:04:27" (1/1) ... [2019-11-15 20:04:27,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:04:27" (1/1) ... [2019-11-15 20:04:27,475 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:04:27" (1/1) ... [2019-11-15 20:04:27,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:04:27" (1/1) ... [2019-11-15 20:04:27,501 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:04:27" (1/1) ... [2019-11-15 20:04:27,518 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:04:27" (1/1) ... [2019-11-15 20:04:27,532 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:04:27" (1/1) ... [2019-11-15 20:04:27,538 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:04:27,539 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:04:27,539 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:04:27,539 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:04:27,546 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:04:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_19660fea-466e-4056-9093-0d6e19c7d671/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 20:04:27,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:04:27,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:04:28,727 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:04:28,727 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 20:04:28,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:04:28 BoogieIcfgContainer [2019-11-15 20:04:28,728 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:04:28,729 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:04:28,730 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:04:28,733 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:04:28,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:04:26" (1/3) ... [2019-11-15 20:04:28,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@445f2822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:04:28, skipping insertion in model container [2019-11-15 20:04:28,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:04:27" (2/3) ... [2019-11-15 20:04:28,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@445f2822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:04:28, skipping insertion in model container [2019-11-15 20:04:28,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:04:28" (3/3) ... [2019-11-15 20:04:28,740 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label03.c [2019-11-15 20:04:28,748 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:04:28,756 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 20:04:28,765 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 20:04:28,804 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:04:28,805 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:04:28,805 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:04:28,805 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:04:28,805 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:04:28,805 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:04:28,805 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:04:28,807 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:04:28,830 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-15 20:04:28,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-15 20:04:28,847 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:04:28,847 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:04:28,849 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:04:28,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:04:28,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1437018794, now seen corresponding path program 1 times [2019-11-15 20:04:28,862 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:04:28,862 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764915673] [2019-11-15 20:04:28,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:28,863 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:28,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:04:29,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:30,052 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 20:04:30,053 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764915673] [2019-11-15 20:04:30,054 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:04:30,054 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 20:04:30,054 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204880109] [2019-11-15 20:04:30,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 20:04:30,061 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:04:30,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 20:04:30,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:04:30,075 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 10 states. [2019-11-15 20:04:31,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:04:31,367 INFO L93 Difference]: Finished difference Result 493 states and 846 transitions. [2019-11-15 20:04:31,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 20:04:31,369 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 129 [2019-11-15 20:04:31,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:04:31,381 INFO L225 Difference]: With dead ends: 493 [2019-11-15 20:04:31,382 INFO L226 Difference]: Without dead ends: 193 [2019-11-15 20:04:31,386 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2019-11-15 20:04:31,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-11-15 20:04:31,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-11-15 20:04:31,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-11-15 20:04:31,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 264 transitions. [2019-11-15 20:04:31,440 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 264 transitions. Word has length 129 [2019-11-15 20:04:31,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:04:31,441 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 264 transitions. [2019-11-15 20:04:31,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 20:04:31,441 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 264 transitions. [2019-11-15 20:04:31,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-15 20:04:31,443 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:04:31,444 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:04:31,444 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:04:31,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:04:31,444 INFO L82 PathProgramCache]: Analyzing trace with hash 72009246, now seen corresponding path program 1 times [2019-11-15 20:04:31,445 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:04:31,445 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341467072] [2019-11-15 20:04:31,445 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:31,445 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:31,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:04:31,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:31,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:04:31,624 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341467072] [2019-11-15 20:04:31,624 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:04:31,624 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:04:31,625 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499358197] [2019-11-15 20:04:31,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:04:31,628 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:04:31,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:04:31,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:04:31,628 INFO L87 Difference]: Start difference. First operand 193 states and 264 transitions. Second operand 3 states. [2019-11-15 20:04:32,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:04:32,112 INFO L93 Difference]: Finished difference Result 457 states and 661 transitions. [2019-11-15 20:04:32,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:04:32,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-11-15 20:04:32,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:04:32,116 INFO L225 Difference]: With dead ends: 457 [2019-11-15 20:04:32,116 INFO L226 Difference]: Without dead ends: 324 [2019-11-15 20:04:32,118 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 20:04:32,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-11-15 20:04:32,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2019-11-15 20:04:32,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-11-15 20:04:32,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 443 transitions. [2019-11-15 20:04:32,141 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 443 transitions. Word has length 133 [2019-11-15 20:04:32,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:04:32,142 INFO L462 AbstractCegarLoop]: Abstraction has 324 states and 443 transitions. [2019-11-15 20:04:32,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:04:32,143 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 443 transitions. [2019-11-15 20:04:32,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-15 20:04:32,146 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:04:32,146 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:04:32,146 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:04:32,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:04:32,147 INFO L82 PathProgramCache]: Analyzing trace with hash -620681437, now seen corresponding path program 1 times [2019-11-15 20:04:32,147 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:04:32,147 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754178907] [2019-11-15 20:04:32,147 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:32,147 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:32,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:04:32,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:32,359 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:04:32,360 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754178907] [2019-11-15 20:04:32,360 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:04:32,360 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:04:32,360 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318773951] [2019-11-15 20:04:32,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:04:32,361 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:04:32,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:04:32,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:04:32,362 INFO L87 Difference]: Start difference. First operand 324 states and 443 transitions. Second operand 4 states. [2019-11-15 20:04:33,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:04:33,109 INFO L93 Difference]: Finished difference Result 814 states and 1161 transitions. [2019-11-15 20:04:33,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:04:33,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-11-15 20:04:33,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:04:33,113 INFO L225 Difference]: With dead ends: 814 [2019-11-15 20:04:33,113 INFO L226 Difference]: Without dead ends: 455 [2019-11-15 20:04:33,114 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 20:04:33,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-11-15 20:04:33,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2019-11-15 20:04:33,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-11-15 20:04:33,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 534 transitions. [2019-11-15 20:04:33,135 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 534 transitions. Word has length 136 [2019-11-15 20:04:33,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:04:33,136 INFO L462 AbstractCegarLoop]: Abstraction has 455 states and 534 transitions. [2019-11-15 20:04:33,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:04:33,136 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 534 transitions. [2019-11-15 20:04:33,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-15 20:04:33,141 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:04:33,141 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:04:33,142 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:04:33,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:04:33,142 INFO L82 PathProgramCache]: Analyzing trace with hash -647170395, now seen corresponding path program 1 times [2019-11-15 20:04:33,142 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:04:33,143 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597012688] [2019-11-15 20:04:33,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:33,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:33,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:04:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:33,246 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 20:04:33,246 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597012688] [2019-11-15 20:04:33,246 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:04:33,247 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:04:33,247 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867951826] [2019-11-15 20:04:33,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:04:33,248 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:04:33,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:04:33,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:04:33,248 INFO L87 Difference]: Start difference. First operand 455 states and 534 transitions. Second operand 3 states. [2019-11-15 20:04:33,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:04:33,606 INFO L93 Difference]: Finished difference Result 981 states and 1165 transitions. [2019-11-15 20:04:33,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:04:33,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-11-15 20:04:33,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:04:33,610 INFO L225 Difference]: With dead ends: 981 [2019-11-15 20:04:33,610 INFO L226 Difference]: Without dead ends: 586 [2019-11-15 20:04:33,611 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 20:04:33,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-11-15 20:04:33,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2019-11-15 20:04:33,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-11-15 20:04:33,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 677 transitions. [2019-11-15 20:04:33,631 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 677 transitions. Word has length 144 [2019-11-15 20:04:33,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:04:33,631 INFO L462 AbstractCegarLoop]: Abstraction has 586 states and 677 transitions. [2019-11-15 20:04:33,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:04:33,632 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 677 transitions. [2019-11-15 20:04:33,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-15 20:04:33,635 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:04:33,636 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:04:33,636 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:04:33,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:04:33,636 INFO L82 PathProgramCache]: Analyzing trace with hash -236489853, now seen corresponding path program 1 times [2019-11-15 20:04:33,637 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:04:33,637 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518813493] [2019-11-15 20:04:33,637 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:33,637 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:33,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:04:33,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:33,689 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 20:04:33,690 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518813493] [2019-11-15 20:04:33,690 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:04:33,690 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:04:33,691 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240781594] [2019-11-15 20:04:33,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:04:33,691 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:04:33,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:04:33,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:04:33,692 INFO L87 Difference]: Start difference. First operand 586 states and 677 transitions. Second operand 4 states. [2019-11-15 20:04:34,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:04:34,416 INFO L93 Difference]: Finished difference Result 2029 states and 2386 transitions. [2019-11-15 20:04:34,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:04:34,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-11-15 20:04:34,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:04:34,425 INFO L225 Difference]: With dead ends: 2029 [2019-11-15 20:04:34,425 INFO L226 Difference]: Without dead ends: 1503 [2019-11-15 20:04:34,426 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 20:04:34,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2019-11-15 20:04:34,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1241. [2019-11-15 20:04:34,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1241 states. [2019-11-15 20:04:34,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1461 transitions. [2019-11-15 20:04:34,462 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 1461 transitions. Word has length 153 [2019-11-15 20:04:34,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:04:34,462 INFO L462 AbstractCegarLoop]: Abstraction has 1241 states and 1461 transitions. [2019-11-15 20:04:34,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:04:34,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1461 transitions. [2019-11-15 20:04:34,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-15 20:04:34,467 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:04:34,468 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:04:34,468 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:04:34,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:04:34,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1280194508, now seen corresponding path program 1 times [2019-11-15 20:04:34,469 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:04:34,469 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966684354] [2019-11-15 20:04:34,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:34,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:34,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:04:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:34,577 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 20:04:34,577 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966684354] [2019-11-15 20:04:34,577 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:04:34,577 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:04:34,578 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615238155] [2019-11-15 20:04:34,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:04:34,578 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:04:34,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:04:34,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:04:34,579 INFO L87 Difference]: Start difference. First operand 1241 states and 1461 transitions. Second operand 5 states. [2019-11-15 20:04:35,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:04:35,606 INFO L93 Difference]: Finished difference Result 2946 states and 3473 transitions. [2019-11-15 20:04:35,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:04:35,606 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2019-11-15 20:04:35,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:04:35,616 INFO L225 Difference]: With dead ends: 2946 [2019-11-15 20:04:35,617 INFO L226 Difference]: Without dead ends: 1765 [2019-11-15 20:04:35,619 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 20:04:35,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2019-11-15 20:04:35,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1634. [2019-11-15 20:04:35,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1634 states. [2019-11-15 20:04:35,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 1905 transitions. [2019-11-15 20:04:35,664 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 1905 transitions. Word has length 159 [2019-11-15 20:04:35,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:04:35,665 INFO L462 AbstractCegarLoop]: Abstraction has 1634 states and 1905 transitions. [2019-11-15 20:04:35,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:04:35,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 1905 transitions. [2019-11-15 20:04:35,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-15 20:04:35,671 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:04:35,671 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:04:35,671 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:04:35,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:04:35,679 INFO L82 PathProgramCache]: Analyzing trace with hash -73226021, now seen corresponding path program 1 times [2019-11-15 20:04:35,679 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:04:35,680 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328573853] [2019-11-15 20:04:35,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:35,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:35,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:04:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:35,787 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-15 20:04:35,788 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328573853] [2019-11-15 20:04:35,788 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:04:35,788 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:04:35,788 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100127843] [2019-11-15 20:04:35,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:04:35,789 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:04:35,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:04:35,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:04:35,790 INFO L87 Difference]: Start difference. First operand 1634 states and 1905 transitions. Second operand 3 states. [2019-11-15 20:04:36,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:04:36,274 INFO L93 Difference]: Finished difference Result 3732 states and 4372 transitions. [2019-11-15 20:04:36,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:04:36,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-11-15 20:04:36,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:04:36,286 INFO L225 Difference]: With dead ends: 3732 [2019-11-15 20:04:36,286 INFO L226 Difference]: Without dead ends: 2158 [2019-11-15 20:04:36,288 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 20:04:36,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2158 states. [2019-11-15 20:04:36,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2158 to 2027. [2019-11-15 20:04:36,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2027 states. [2019-11-15 20:04:36,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 2321 transitions. [2019-11-15 20:04:36,333 INFO L78 Accepts]: Start accepts. Automaton has 2027 states and 2321 transitions. Word has length 193 [2019-11-15 20:04:36,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:04:36,333 INFO L462 AbstractCegarLoop]: Abstraction has 2027 states and 2321 transitions. [2019-11-15 20:04:36,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:04:36,333 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 2321 transitions. [2019-11-15 20:04:36,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-11-15 20:04:36,339 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:04:36,339 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:04:36,340 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:04:36,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:04:36,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1876676455, now seen corresponding path program 1 times [2019-11-15 20:04:36,340 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:04:36,340 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037622254] [2019-11-15 20:04:36,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:36,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:36,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:04:36,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:36,553 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 139 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 20:04:36,553 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037622254] [2019-11-15 20:04:36,554 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206798977] [2019-11-15 20:04:36,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_19660fea-466e-4056-9093-0d6e19c7d671/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 20:04:36,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:36,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:04:36,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:04:36,808 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-15 20:04:36,809 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:04:36,809 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-15 20:04:36,810 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147408103] [2019-11-15 20:04:36,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:04:36,811 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:04:36,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:04:36,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:04:36,812 INFO L87 Difference]: Start difference. First operand 2027 states and 2321 transitions. Second operand 3 states. [2019-11-15 20:04:37,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:04:37,310 INFO L93 Difference]: Finished difference Result 4911 states and 5667 transitions. [2019-11-15 20:04:37,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:04:37,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 222 [2019-11-15 20:04:37,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:04:37,324 INFO L225 Difference]: With dead ends: 4911 [2019-11-15 20:04:37,324 INFO L226 Difference]: Without dead ends: 2944 [2019-11-15 20:04:37,327 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:04:37,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2019-11-15 20:04:37,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 2813. [2019-11-15 20:04:37,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2813 states. [2019-11-15 20:04:37,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2813 states to 2813 states and 3196 transitions. [2019-11-15 20:04:37,389 INFO L78 Accepts]: Start accepts. Automaton has 2813 states and 3196 transitions. Word has length 222 [2019-11-15 20:04:37,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:04:37,390 INFO L462 AbstractCegarLoop]: Abstraction has 2813 states and 3196 transitions. [2019-11-15 20:04:37,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:04:37,390 INFO L276 IsEmpty]: Start isEmpty. Operand 2813 states and 3196 transitions. [2019-11-15 20:04:37,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-11-15 20:04:37,397 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:04:37,397 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:04:37,601 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:04:37,602 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:04:37,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:04:37,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1376312779, now seen corresponding path program 1 times [2019-11-15 20:04:37,602 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:04:37,603 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368516526] [2019-11-15 20:04:37,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:37,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:37,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:04:37,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:37,987 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 140 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:04:37,987 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368516526] [2019-11-15 20:04:37,988 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115124228] [2019-11-15 20:04:37,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_19660fea-466e-4056-9093-0d6e19c7d671/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 20:04:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:38,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:04:38,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:04:38,175 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 20:04:38,175 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:04:38,176 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2019-11-15 20:04:38,176 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665878480] [2019-11-15 20:04:38,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:04:38,176 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:04:38,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:04:38,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:04:38,177 INFO L87 Difference]: Start difference. First operand 2813 states and 3196 transitions. Second operand 3 states. [2019-11-15 20:04:38,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:04:38,539 INFO L93 Difference]: Finished difference Result 5959 states and 6757 transitions. [2019-11-15 20:04:38,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:04:38,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2019-11-15 20:04:38,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:04:38,556 INFO L225 Difference]: With dead ends: 5959 [2019-11-15 20:04:38,557 INFO L226 Difference]: Without dead ends: 3206 [2019-11-15 20:04:38,560 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:04:38,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3206 states. [2019-11-15 20:04:38,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3206 to 2551. [2019-11-15 20:04:38,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2551 states. [2019-11-15 20:04:38,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2551 states to 2551 states and 2897 transitions. [2019-11-15 20:04:38,614 INFO L78 Accepts]: Start accepts. Automaton has 2551 states and 2897 transitions. Word has length 225 [2019-11-15 20:04:38,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:04:38,614 INFO L462 AbstractCegarLoop]: Abstraction has 2551 states and 2897 transitions. [2019-11-15 20:04:38,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:04:38,615 INFO L276 IsEmpty]: Start isEmpty. Operand 2551 states and 2897 transitions. [2019-11-15 20:04:38,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-11-15 20:04:38,621 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:04:38,621 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-11-15 20:04:38,824 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:04:38,824 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:04:38,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:04:38,825 INFO L82 PathProgramCache]: Analyzing trace with hash -605874139, now seen corresponding path program 1 times [2019-11-15 20:04:38,825 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:04:38,826 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67184347] [2019-11-15 20:04:38,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:38,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:38,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:04:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:38,992 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 157 proven. 27 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-15 20:04:38,995 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67184347] [2019-11-15 20:04:38,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761036601] [2019-11-15 20:04:38,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_19660fea-466e-4056-9093-0d6e19c7d671/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 20:04:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:39,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:04:39,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:04:39,166 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-11-15 20:04:39,166 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:04:39,166 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-15 20:04:39,166 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907503913] [2019-11-15 20:04:39,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:04:39,167 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:04:39,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:04:39,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:04:39,168 INFO L87 Difference]: Start difference. First operand 2551 states and 2897 transitions. Second operand 3 states. [2019-11-15 20:04:39,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:04:39,539 INFO L93 Difference]: Finished difference Result 4385 states and 4987 transitions. [2019-11-15 20:04:39,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:04:39,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 231 [2019-11-15 20:04:39,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:04:39,540 INFO L225 Difference]: With dead ends: 4385 [2019-11-15 20:04:39,540 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 20:04:39,544 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 231 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:04:39,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 20:04:39,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 20:04:39,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 20:04:39,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 20:04:39,544 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 231 [2019-11-15 20:04:39,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:04:39,545 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:04:39,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:04:39,545 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:04:39,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 20:04:39,748 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:04:39,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 20:04:39,896 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-11-15 20:04:39,984 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-15 20:04:39,984 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-15 20:04:39,984 INFO L443 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,984 INFO L443 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,984 INFO L443 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,984 INFO L443 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,984 INFO L443 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,984 INFO L443 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,984 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-15 20:04:39,984 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-15 20:04:39,984 INFO L443 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-15 20:04:39,984 INFO L443 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-15 20:04:39,985 INFO L443 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-15 20:04:39,985 INFO L443 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-15 20:04:39,985 INFO L443 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-15 20:04:39,985 INFO L443 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-15 20:04:39,985 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-15 20:04:39,985 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 563) no Hoare annotation was computed. [2019-11-15 20:04:39,985 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-15 20:04:39,985 INFO L443 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,985 INFO L443 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,985 INFO L443 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,985 INFO L443 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,985 INFO L443 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,985 INFO L443 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,986 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-15 20:04:39,986 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-15 20:04:39,986 INFO L443 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-15 20:04:39,986 INFO L443 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-15 20:04:39,986 INFO L443 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-15 20:04:39,986 INFO L443 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-15 20:04:39,986 INFO L443 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-15 20:04:39,986 INFO L443 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-15 20:04:39,986 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-15 20:04:39,986 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-15 20:04:39,986 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-15 20:04:39,986 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-15 20:04:39,986 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-15 20:04:39,986 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-15 20:04:39,986 INFO L443 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-15 20:04:39,987 INFO L443 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,987 INFO L443 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,987 INFO L443 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,987 INFO L443 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,987 INFO L443 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,987 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-15 20:04:39,987 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-15 20:04:39,987 INFO L443 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-15 20:04:39,987 INFO L443 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-15 20:04:39,987 INFO L443 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-15 20:04:39,987 INFO L443 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-15 20:04:39,988 INFO L443 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-15 20:04:39,988 INFO L443 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-15 20:04:39,988 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-15 20:04:39,988 INFO L439 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse4 (not (= ~a16~0 6))) (.cse0 (= ~a21~0 1)) (.cse1 (= ~a20~0 1)) (.cse3 (not (= ~a7~0 1))) (.cse2 (<= 14 ~a8~0)) (.cse5 (<= ~a20~0 0))) (or (and (= ~a16~0 4) (= ~a8~0 13) (= ~a17~0 1) (= ~a12~0 8) .cse0 .cse1) (and .cse2 .cse0 .cse1 (= ~a16~0 5)) (<= ~a21~0 0) (and .cse3 .cse4 .cse5) (and .cse2 .cse4 .cse5) (and .cse3 .cse0 .cse1) (and .cse3 .cse2 .cse5))) [2019-11-15 20:04:39,988 INFO L443 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,989 INFO L443 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,989 INFO L443 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,989 INFO L443 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,989 INFO L443 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,989 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-15 20:04:39,989 INFO L443 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-15 20:04:39,989 INFO L443 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-15 20:04:39,990 INFO L443 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-15 20:04:39,990 INFO L443 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-15 20:04:39,990 INFO L443 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-15 20:04:39,990 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-15 20:04:39,990 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-15 20:04:39,990 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-15 20:04:39,991 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-15 20:04:39,991 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-15 20:04:39,991 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-15 20:04:39,991 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-15 20:04:39,991 INFO L446 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-15 20:04:39,991 INFO L443 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,991 INFO L443 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,991 INFO L443 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,992 INFO L443 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,992 INFO L443 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,992 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-15 20:04:39,992 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-15 20:04:39,992 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-15 20:04:39,992 INFO L443 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-15 20:04:39,992 INFO L443 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-15 20:04:39,992 INFO L443 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-15 20:04:39,992 INFO L443 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-15 20:04:39,992 INFO L443 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-15 20:04:39,992 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-15 20:04:39,992 INFO L443 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,992 INFO L443 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,993 INFO L443 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,993 INFO L443 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,993 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-15 20:04:39,993 INFO L443 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,993 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-15 20:04:39,993 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-15 20:04:39,993 INFO L443 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-15 20:04:39,993 INFO L443 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-15 20:04:39,993 INFO L443 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-15 20:04:39,993 INFO L443 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-15 20:04:39,993 INFO L443 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-15 20:04:39,993 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 20:04:39,994 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-15 20:04:39,994 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-15 20:04:39,994 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-15 20:04:39,994 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-15 20:04:39,994 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-15 20:04:39,994 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-15 20:04:39,994 INFO L443 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,994 INFO L439 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse4 (not (= ~a16~0 6))) (.cse0 (= ~a21~0 1)) (.cse1 (= ~a20~0 1)) (.cse3 (not (= ~a7~0 1))) (.cse2 (<= 14 ~a8~0)) (.cse5 (<= ~a20~0 0))) (or (and (= ~a16~0 4) (= ~a8~0 13) (= ~a17~0 1) (= ~a12~0 8) .cse0 .cse1) (and .cse2 .cse0 .cse1 (= ~a16~0 5)) (<= ~a21~0 0) (and .cse3 .cse4 .cse5) (and .cse2 .cse4 .cse5) (and .cse3 .cse0 .cse1) (and .cse3 .cse2 .cse5))) [2019-11-15 20:04:39,995 INFO L443 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,995 INFO L443 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,995 INFO L443 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,995 INFO L443 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,995 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-15 20:04:39,995 INFO L443 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-15 20:04:39,995 INFO L443 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-15 20:04:39,996 INFO L443 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-15 20:04:39,996 INFO L443 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-15 20:04:39,996 INFO L443 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-15 20:04:39,996 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-15 20:04:39,996 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-15 20:04:39,996 INFO L443 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,996 INFO L443 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,996 INFO L443 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,997 INFO L443 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,997 INFO L443 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,997 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-15 20:04:39,997 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 20:04:39,997 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-15 20:04:39,997 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-15 20:04:39,997 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-15 20:04:39,997 INFO L443 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-15 20:04:39,997 INFO L443 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-15 20:04:39,998 INFO L443 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-15 20:04:39,998 INFO L443 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-15 20:04:39,998 INFO L443 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-15 20:04:39,998 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-15 20:04:39,998 INFO L443 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-15 20:04:39,998 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-15 20:04:39,998 INFO L443 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,998 INFO L443 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,999 INFO L443 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,999 INFO L443 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,999 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-15 20:04:39,999 INFO L443 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,999 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:39,999 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-15 20:04:39,999 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-15 20:04:40,000 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 20:04:40,000 INFO L443 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-15 20:04:40,000 INFO L443 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-15 20:04:40,000 INFO L443 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-15 20:04:40,000 INFO L443 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-15 20:04:40,000 INFO L443 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-15 20:04:40,000 INFO L443 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-15 20:04:40,000 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-15 20:04:40,001 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-15 20:04:40,001 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-15 20:04:40,001 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-15 20:04:40,001 INFO L443 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:40,001 INFO L443 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:40,001 INFO L443 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:40,001 INFO L443 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:40,001 INFO L443 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:40,002 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-15 20:04:40,002 INFO L443 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:40,002 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-15 20:04:40,002 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-15 20:04:40,002 INFO L443 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-15 20:04:40,002 INFO L443 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-15 20:04:40,002 INFO L443 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-15 20:04:40,002 INFO L443 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-15 20:04:40,002 INFO L443 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-15 20:04:40,002 INFO L443 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-15 20:04:40,002 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-15 20:04:40,002 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-15 20:04:40,002 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-15 20:04:40,002 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 20:04:40,003 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-15 20:04:40,003 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-15 20:04:40,003 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-15 20:04:40,003 INFO L443 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:40,003 INFO L443 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:40,003 INFO L443 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:40,003 INFO L443 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:40,003 INFO L443 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:40,004 INFO L443 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:04:40,004 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-15 20:04:40,004 INFO L443 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-15 20:04:40,004 INFO L443 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-15 20:04:40,004 INFO L443 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-15 20:04:40,004 INFO L443 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-15 20:04:40,004 INFO L443 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-15 20:04:40,004 INFO L443 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-15 20:04:40,005 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-15 20:04:40,005 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-15 20:04:40,005 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-15 20:04:40,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:04:40 BoogieIcfgContainer [2019-11-15 20:04:40,022 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:04:40,022 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:04:40,022 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:04:40,022 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:04:40,023 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:04:28" (3/4) ... [2019-11-15 20:04:40,026 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 20:04:40,045 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 20:04:40,047 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 20:04:40,181 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_19660fea-466e-4056-9093-0d6e19c7d671/bin/uautomizer/witness.graphml [2019-11-15 20:04:40,182 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:04:40,183 INFO L168 Benchmark]: Toolchain (without parser) took 13456.66 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 407.4 MB). Free memory was 940.8 MB in the beginning and 911.0 MB in the end (delta: 29.8 MB). Peak memory consumption was 437.2 MB. Max. memory is 11.5 GB. [2019-11-15 20:04:40,183 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:04:40,184 INFO L168 Benchmark]: CACSL2BoogieTranslator took 632.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -162.4 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:04:40,184 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.60 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:04:40,185 INFO L168 Benchmark]: Boogie Preprocessor took 86.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:04:40,185 INFO L168 Benchmark]: RCFGBuilder took 1189.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 981.9 MB in the end (delta: 110.6 MB). Peak memory consumption was 110.6 MB. Max. memory is 11.5 GB. [2019-11-15 20:04:40,185 INFO L168 Benchmark]: TraceAbstraction took 11292.44 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 275.8 MB). Free memory was 981.9 MB in the beginning and 936.9 MB in the end (delta: 45.0 MB). Peak memory consumption was 320.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:04:40,186 INFO L168 Benchmark]: Witness Printer took 159.72 ms. Allocated memory is still 1.4 GB. Free memory was 936.9 MB in the beginning and 911.0 MB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-11-15 20:04:40,188 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 632.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -162.4 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 91.60 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 86.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1189.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 981.9 MB in the end (delta: 110.6 MB). Peak memory consumption was 110.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11292.44 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 275.8 MB). Free memory was 981.9 MB in the beginning and 936.9 MB in the end (delta: 45.0 MB). Peak memory consumption was 320.7 MB. Max. memory is 11.5 GB. * Witness Printer took 159.72 ms. Allocated memory is still 1.4 GB. Free memory was 936.9 MB in the beginning and 911.0 MB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 563]: 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: 30]: Loop Invariant Derived loop invariant: ((((((((((a16 == 4 && a8 == 13) && a17 == 1) && a12 == 8) && a21 == 1) && a20 == 1) || (((14 <= a8 && a21 == 1) && a20 == 1) && a16 == 5)) || a21 <= 0) || ((!(a7 == 1) && !(a16 == 6)) && a20 <= 0)) || ((14 <= a8 && !(a16 == 6)) && a20 <= 0)) || ((!(a7 == 1) && a21 == 1) && a20 == 1)) || ((!(a7 == 1) && 14 <= a8) && a20 <= 0) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((a16 == 4 && a8 == 13) && a17 == 1) && a12 == 8) && a21 == 1) && a20 == 1) || (((14 <= a8 && a21 == 1) && a20 == 1) && a16 == 5)) || a21 <= 0) || ((!(a7 == 1) && !(a16 == 6)) && a20 <= 0)) || ((14 <= a8 && !(a16 == 6)) && a20 <= 0)) || ((!(a7 == 1) && a21 == 1) && a20 == 1)) || ((!(a7 == 1) && 14 <= a8) && a20 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 11.2s, OverallIterations: 10, TraceHistogramMax: 5, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 844 SDtfs, 1553 SDslu, 95 SDs, 0 SdLazy, 4356 SolverSat, 617 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 734 GetRequests, 690 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2813occurred 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.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 1310 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 36 NumberOfFragments, 163 HoareAnnotationTreeSize, 3 FomulaSimplifications, 901 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 26 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 2403 NumberOfCodeBlocks, 2403 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2390 ConstructedInterpolants, 0 QuantifiedInterpolants, 1876072 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1171 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 1262/1357 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...