./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label40.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7f9b01c5-5073-4fd8-8cbb-c833b5068db1/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7f9b01c5-5073-4fd8-8cbb-c833b5068db1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7f9b01c5-5073-4fd8-8cbb-c833b5068db1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7f9b01c5-5073-4fd8-8cbb-c833b5068db1/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label40.c -s /tmp/vcloud-vcloud-master/worker/run_dir_7f9b01c5-5073-4fd8-8cbb-c833b5068db1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7f9b01c5-5073-4fd8-8cbb-c833b5068db1/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 d2268b9dd6959c9e4f82beab56974646f066475d ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 03:31:38,497 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 03:31:38,498 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 03:31:38,509 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 03:31:38,509 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 03:31:38,510 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 03:31:38,511 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 03:31:38,513 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 03:31:38,515 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 03:31:38,516 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 03:31:38,517 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 03:31:38,518 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 03:31:38,518 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 03:31:38,519 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 03:31:38,520 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 03:31:38,521 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 03:31:38,521 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 03:31:38,522 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 03:31:38,524 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 03:31:38,526 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 03:31:38,527 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 03:31:38,528 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 03:31:38,529 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 03:31:38,530 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 03:31:38,533 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 03:31:38,533 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 03:31:38,533 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 03:31:38,534 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 03:31:38,534 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 03:31:38,535 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 03:31:38,535 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 03:31:38,536 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 03:31:38,536 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 03:31:38,537 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 03:31:38,538 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 03:31:38,538 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 03:31:38,539 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 03:31:38,539 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 03:31:38,539 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 03:31:38,540 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 03:31:38,540 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 03:31:38,541 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7f9b01c5-5073-4fd8-8cbb-c833b5068db1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 03:31:38,553 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 03:31:38,554 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 03:31:38,554 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 03:31:38,555 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 03:31:38,555 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 03:31:38,555 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 03:31:38,555 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 03:31:38,555 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 03:31:38,556 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 03:31:38,556 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 03:31:38,556 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 03:31:38,556 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 03:31:38,556 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 03:31:38,556 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 03:31:38,557 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 03:31:38,557 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 03:31:38,557 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 03:31:38,557 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 03:31:38,557 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 03:31:38,558 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 03:31:38,558 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 03:31:38,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 03:31:38,558 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 03:31:38,558 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 03:31:38,559 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 03:31:38,559 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 03:31:38,559 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 03:31:38,559 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 03:31:38,559 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_7f9b01c5-5073-4fd8-8cbb-c833b5068db1/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 -> d2268b9dd6959c9e4f82beab56974646f066475d [2019-11-20 03:31:38,731 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 03:31:38,741 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 03:31:38,748 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 03:31:38,750 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 03:31:38,756 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 03:31:38,756 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7f9b01c5-5073-4fd8-8cbb-c833b5068db1/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem01_label40.c [2019-11-20 03:31:38,815 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7f9b01c5-5073-4fd8-8cbb-c833b5068db1/bin/uautomizer/data/5bb41217d/27ac2ffd459d4199ad071f3d6cb91b2d/FLAG60b66c5e8 [2019-11-20 03:31:39,338 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 03:31:39,338 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7f9b01c5-5073-4fd8-8cbb-c833b5068db1/sv-benchmarks/c/eca-rers2012/Problem01_label40.c [2019-11-20 03:31:39,357 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7f9b01c5-5073-4fd8-8cbb-c833b5068db1/bin/uautomizer/data/5bb41217d/27ac2ffd459d4199ad071f3d6cb91b2d/FLAG60b66c5e8 [2019-11-20 03:31:39,643 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7f9b01c5-5073-4fd8-8cbb-c833b5068db1/bin/uautomizer/data/5bb41217d/27ac2ffd459d4199ad071f3d6cb91b2d [2019-11-20 03:31:39,645 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 03:31:39,646 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 03:31:39,649 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 03:31:39,649 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 03:31:39,654 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 03:31:39,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:31:39" (1/1) ... [2019-11-20 03:31:39,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@127d3ab5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:31:39, skipping insertion in model container [2019-11-20 03:31:39,657 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:31:39" (1/1) ... [2019-11-20 03:31:39,664 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 03:31:39,703 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 03:31:40,137 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:31:40,141 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 03:31:40,268 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:31:40,283 INFO L192 MainTranslator]: Completed translation [2019-11-20 03:31:40,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:31:40 WrapperNode [2019-11-20 03:31:40,284 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 03:31:40,285 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 03:31:40,285 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 03:31:40,285 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 03:31:40,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:31:40" (1/1) ... [2019-11-20 03:31:40,313 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:31:40" (1/1) ... [2019-11-20 03:31:40,384 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 03:31:40,385 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 03:31:40,385 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 03:31:40,386 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 03:31:40,397 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:31:40" (1/1) ... [2019-11-20 03:31:40,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:31:40" (1/1) ... [2019-11-20 03:31:40,402 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:31:40" (1/1) ... [2019-11-20 03:31:40,403 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:31:40" (1/1) ... [2019-11-20 03:31:40,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:31:40" (1/1) ... [2019-11-20 03:31:40,442 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:31:40" (1/1) ... [2019-11-20 03:31:40,464 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:31:40" (1/1) ... [2019-11-20 03:31:40,479 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 03:31:40,480 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 03:31:40,480 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 03:31:40,480 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 03:31:40,481 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:31:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f9b01c5-5073-4fd8-8cbb-c833b5068db1/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 03:31:40,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 03:31:40,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 03:31:42,085 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 03:31:42,085 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 03:31:42,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:31:42 BoogieIcfgContainer [2019-11-20 03:31:42,086 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 03:31:42,087 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 03:31:42,087 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 03:31:42,090 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 03:31:42,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:31:39" (1/3) ... [2019-11-20 03:31:42,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a2e86c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:31:42, skipping insertion in model container [2019-11-20 03:31:42,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:31:40" (2/3) ... [2019-11-20 03:31:42,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a2e86c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:31:42, skipping insertion in model container [2019-11-20 03:31:42,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:31:42" (3/3) ... [2019-11-20 03:31:42,097 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label40.c [2019-11-20 03:31:42,106 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 03:31:42,114 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 03:31:42,124 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 03:31:42,148 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 03:31:42,148 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 03:31:42,148 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 03:31:42,149 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 03:31:42,149 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 03:31:42,149 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 03:31:42,149 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 03:31:42,149 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 03:31:42,168 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-20 03:31:42,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 03:31:42,178 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:31:42,179 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:31:42,179 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:31:42,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:31:42,184 INFO L82 PathProgramCache]: Analyzing trace with hash 304749070, now seen corresponding path program 1 times [2019-11-20 03:31:42,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:31:42,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263402862] [2019-11-20 03:31:42,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:31:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:31:42,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:31:42,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263402862] [2019-11-20 03:31:42,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:31:42,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:31:42,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485250728] [2019-11-20 03:31:42,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:31:42,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:31:42,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:31:42,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:31:42,547 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-11-20 03:31:44,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:31:44,003 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-11-20 03:31:44,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:31:44,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-20 03:31:44,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:31:44,037 INFO L225 Difference]: With dead ends: 662 [2019-11-20 03:31:44,037 INFO L226 Difference]: Without dead ends: 397 [2019-11-20 03:31:44,042 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:31:44,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-20 03:31:44,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 266. [2019-11-20 03:31:44,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-20 03:31:44,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2019-11-20 03:31:44,124 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 87 [2019-11-20 03:31:44,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:31:44,125 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2019-11-20 03:31:44,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:31:44,125 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2019-11-20 03:31:44,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-20 03:31:44,129 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:31:44,130 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 03:31:44,130 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:31:44,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:31:44,131 INFO L82 PathProgramCache]: Analyzing trace with hash -2087983333, now seen corresponding path program 1 times [2019-11-20 03:31:44,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:31:44,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162019123] [2019-11-20 03:31:44,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:31:44,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:31:44,211 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:31:44,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162019123] [2019-11-20 03:31:44,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:31:44,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:31:44,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455874210] [2019-11-20 03:31:44,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:31:44,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:31:44,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:31:44,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:31:44,221 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2019-11-20 03:31:45,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:31:45,073 INFO L93 Difference]: Finished difference Result 1054 states and 1512 transitions. [2019-11-20 03:31:45,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:31:45,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-11-20 03:31:45,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:31:45,078 INFO L225 Difference]: With dead ends: 1054 [2019-11-20 03:31:45,078 INFO L226 Difference]: Without dead ends: 790 [2019-11-20 03:31:45,081 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:31:45,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-20 03:31:45,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-11-20 03:31:45,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-20 03:31:45,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1066 transitions. [2019-11-20 03:31:45,111 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1066 transitions. Word has length 93 [2019-11-20 03:31:45,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:31:45,111 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1066 transitions. [2019-11-20 03:31:45,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:31:45,112 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1066 transitions. [2019-11-20 03:31:45,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-20 03:31:45,117 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:31:45,117 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:31:45,118 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:31:45,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:31:45,118 INFO L82 PathProgramCache]: Analyzing trace with hash 743115340, now seen corresponding path program 1 times [2019-11-20 03:31:45,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:31:45,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186343566] [2019-11-20 03:31:45,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:31:45,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:31:45,182 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 03:31:45,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186343566] [2019-11-20 03:31:45,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:31:45,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:31:45,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315539211] [2019-11-20 03:31:45,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:31:45,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:31:45,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:31:45,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:31:45,185 INFO L87 Difference]: Start difference. First operand 790 states and 1066 transitions. Second operand 3 states. [2019-11-20 03:31:45,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:31:45,768 INFO L93 Difference]: Finished difference Result 1840 states and 2519 transitions. [2019-11-20 03:31:45,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:31:45,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-11-20 03:31:45,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:31:45,775 INFO L225 Difference]: With dead ends: 1840 [2019-11-20 03:31:45,775 INFO L226 Difference]: Without dead ends: 1052 [2019-11-20 03:31:45,778 INFO L630 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-20 03:31:45,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-11-20 03:31:45,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 921. [2019-11-20 03:31:45,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2019-11-20 03:31:45,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1246 transitions. [2019-11-20 03:31:45,814 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1246 transitions. Word has length 113 [2019-11-20 03:31:45,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:31:45,816 INFO L462 AbstractCegarLoop]: Abstraction has 921 states and 1246 transitions. [2019-11-20 03:31:45,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:31:45,816 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1246 transitions. [2019-11-20 03:31:45,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-20 03:31:45,832 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:31:45,835 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 03:31:45,836 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:31:45,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:31:45,836 INFO L82 PathProgramCache]: Analyzing trace with hash -629030967, now seen corresponding path program 1 times [2019-11-20 03:31:45,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:31:45,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833261635] [2019-11-20 03:31:45,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:31:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:31:45,986 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-20 03:31:45,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833261635] [2019-11-20 03:31:45,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:31:45,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:31:45,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954295587] [2019-11-20 03:31:45,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:31:45,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:31:45,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:31:45,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:31:45,991 INFO L87 Difference]: Start difference. First operand 921 states and 1246 transitions. Second operand 3 states. [2019-11-20 03:31:46,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:31:46,533 INFO L93 Difference]: Finished difference Result 2233 states and 2997 transitions. [2019-11-20 03:31:46,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:31:46,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-11-20 03:31:46,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:31:46,542 INFO L225 Difference]: With dead ends: 2233 [2019-11-20 03:31:46,542 INFO L226 Difference]: Without dead ends: 1314 [2019-11-20 03:31:46,546 INFO L630 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-20 03:31:46,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2019-11-20 03:31:46,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1183. [2019-11-20 03:31:46,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-11-20 03:31:46,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1508 transitions. [2019-11-20 03:31:46,588 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1508 transitions. Word has length 149 [2019-11-20 03:31:46,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:31:46,589 INFO L462 AbstractCegarLoop]: Abstraction has 1183 states and 1508 transitions. [2019-11-20 03:31:46,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:31:46,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1508 transitions. [2019-11-20 03:31:46,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-20 03:31:46,594 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:31:46,595 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-11-20 03:31:46,595 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:31:46,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:31:46,596 INFO L82 PathProgramCache]: Analyzing trace with hash 709799897, now seen corresponding path program 1 times [2019-11-20 03:31:46,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:31:46,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743917813] [2019-11-20 03:31:46,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:31:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:31:46,756 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-11-20 03:31:46,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743917813] [2019-11-20 03:31:46,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:31:46,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:31:46,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961800581] [2019-11-20 03:31:46,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:31:46,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:31:46,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:31:46,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:31:46,759 INFO L87 Difference]: Start difference. First operand 1183 states and 1508 transitions. Second operand 3 states. [2019-11-20 03:31:47,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:31:47,308 INFO L93 Difference]: Finished difference Result 3150 states and 4004 transitions. [2019-11-20 03:31:47,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:31:47,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-11-20 03:31:47,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:31:47,320 INFO L225 Difference]: With dead ends: 3150 [2019-11-20 03:31:47,320 INFO L226 Difference]: Without dead ends: 1969 [2019-11-20 03:31:47,322 INFO L630 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-20 03:31:47,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-20 03:31:47,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1576. [2019-11-20 03:31:47,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-20 03:31:47,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1990 transitions. [2019-11-20 03:31:47,371 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1990 transitions. Word has length 168 [2019-11-20 03:31:47,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:31:47,371 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 1990 transitions. [2019-11-20 03:31:47,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:31:47,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1990 transitions. [2019-11-20 03:31:47,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-20 03:31:47,376 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:31:47,376 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-20 03:31:47,376 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:31:47,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:31:47,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1199428114, now seen corresponding path program 1 times [2019-11-20 03:31:47,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:31:47,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325449685] [2019-11-20 03:31:47,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:31:47,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:31:47,468 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-20 03:31:47,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325449685] [2019-11-20 03:31:47,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:31:47,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:31:47,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610817267] [2019-11-20 03:31:47,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:31:47,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:31:47,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:31:47,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:31:47,472 INFO L87 Difference]: Start difference. First operand 1576 states and 1990 transitions. Second operand 3 states. [2019-11-20 03:31:47,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:31:47,911 INFO L93 Difference]: Finished difference Result 3412 states and 4294 transitions. [2019-11-20 03:31:47,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:31:47,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-11-20 03:31:47,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:31:47,922 INFO L225 Difference]: With dead ends: 3412 [2019-11-20 03:31:47,923 INFO L226 Difference]: Without dead ends: 1838 [2019-11-20 03:31:47,925 INFO L630 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-20 03:31:47,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-11-20 03:31:47,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2019-11-20 03:31:47,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-20 03:31:47,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2270 transitions. [2019-11-20 03:31:47,967 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2270 transitions. Word has length 171 [2019-11-20 03:31:47,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:31:47,969 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2270 transitions. [2019-11-20 03:31:47,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:31:47,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2270 transitions. [2019-11-20 03:31:47,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-20 03:31:47,974 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:31:47,974 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-20 03:31:47,975 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:31:47,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:31:47,979 INFO L82 PathProgramCache]: Analyzing trace with hash 388122842, now seen corresponding path program 1 times [2019-11-20 03:31:47,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:31:47,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705644909] [2019-11-20 03:31:47,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:31:48,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:31:48,199 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-20 03:31:48,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705644909] [2019-11-20 03:31:48,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:31:48,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 03:31:48,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846458383] [2019-11-20 03:31:48,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 03:31:48,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:31:48,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 03:31:48,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-20 03:31:48,202 INFO L87 Difference]: Start difference. First operand 1838 states and 2270 transitions. Second operand 8 states. [2019-11-20 03:31:49,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:31:49,252 INFO L93 Difference]: Finished difference Result 3841 states and 4711 transitions. [2019-11-20 03:31:49,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 03:31:49,253 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 175 [2019-11-20 03:31:49,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:31:49,262 INFO L225 Difference]: With dead ends: 3841 [2019-11-20 03:31:49,263 INFO L226 Difference]: Without dead ends: 2005 [2019-11-20 03:31:49,265 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-20 03:31:49,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2019-11-20 03:31:49,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1838. [2019-11-20 03:31:49,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-20 03:31:49,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2258 transitions. [2019-11-20 03:31:49,308 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2258 transitions. Word has length 175 [2019-11-20 03:31:49,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:31:49,308 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2258 transitions. [2019-11-20 03:31:49,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 03:31:49,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2258 transitions. [2019-11-20 03:31:49,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-11-20 03:31:49,314 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:31:49,314 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-11-20 03:31:49,315 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:31:49,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:31:49,315 INFO L82 PathProgramCache]: Analyzing trace with hash -2034265206, now seen corresponding path program 1 times [2019-11-20 03:31:49,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:31:49,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281421234] [2019-11-20 03:31:49,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:31:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:31:49,497 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-20 03:31:49,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281421234] [2019-11-20 03:31:49,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:31:49,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:31:49,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859354056] [2019-11-20 03:31:49,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:31:49,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:31:49,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:31:49,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:31:49,499 INFO L87 Difference]: Start difference. First operand 1838 states and 2258 transitions. Second operand 4 states. [2019-11-20 03:31:50,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:31:50,305 INFO L93 Difference]: Finished difference Result 3936 states and 4836 transitions. [2019-11-20 03:31:50,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:31:50,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2019-11-20 03:31:50,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:31:50,316 INFO L225 Difference]: With dead ends: 3936 [2019-11-20 03:31:50,316 INFO L226 Difference]: Without dead ends: 2100 [2019-11-20 03:31:50,319 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:31:50,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-11-20 03:31:50,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1969. [2019-11-20 03:31:50,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-20 03:31:50,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2323 transitions. [2019-11-20 03:31:50,365 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2323 transitions. Word has length 208 [2019-11-20 03:31:50,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:31:50,365 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2323 transitions. [2019-11-20 03:31:50,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:31:50,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2323 transitions. [2019-11-20 03:31:50,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-11-20 03:31:50,372 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:31:50,373 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 03:31:50,373 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:31:50,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:31:50,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1088708010, now seen corresponding path program 1 times [2019-11-20 03:31:50,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:31:50,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147907331] [2019-11-20 03:31:50,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:31:50,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:31:50,529 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-20 03:31:50,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147907331] [2019-11-20 03:31:50,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:31:50,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:31:50,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303843444] [2019-11-20 03:31:50,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:31:50,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:31:50,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:31:50,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:31:50,532 INFO L87 Difference]: Start difference. First operand 1969 states and 2323 transitions. Second operand 4 states. [2019-11-20 03:31:51,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:31:51,275 INFO L93 Difference]: Finished difference Result 4460 states and 5222 transitions. [2019-11-20 03:31:51,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:31:51,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 234 [2019-11-20 03:31:51,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:31:51,291 INFO L225 Difference]: With dead ends: 4460 [2019-11-20 03:31:51,291 INFO L226 Difference]: Without dead ends: 2493 [2019-11-20 03:31:51,294 INFO L630 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-20 03:31:51,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2019-11-20 03:31:51,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 1969. [2019-11-20 03:31:51,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-20 03:31:51,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2311 transitions. [2019-11-20 03:31:51,343 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2311 transitions. Word has length 234 [2019-11-20 03:31:51,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:31:51,343 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2311 transitions. [2019-11-20 03:31:51,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:31:51,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2311 transitions. [2019-11-20 03:31:51,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-11-20 03:31:51,351 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:31:51,351 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-11-20 03:31:51,351 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:31:51,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:31:51,352 INFO L82 PathProgramCache]: Analyzing trace with hash 217822603, now seen corresponding path program 1 times [2019-11-20 03:31:51,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:31:51,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952551151] [2019-11-20 03:31:51,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:31:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:31:51,607 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-11-20 03:31:51,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952551151] [2019-11-20 03:31:51,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:31:51,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 03:31:51,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128674473] [2019-11-20 03:31:51,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 03:31:51,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:31:51,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 03:31:51,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 03:31:51,610 INFO L87 Difference]: Start difference. First operand 1969 states and 2311 transitions. Second operand 6 states. [2019-11-20 03:31:52,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:31:52,426 INFO L93 Difference]: Finished difference Result 4105 states and 4795 transitions. [2019-11-20 03:31:52,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 03:31:52,431 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 255 [2019-11-20 03:31:52,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:31:52,441 INFO L225 Difference]: With dead ends: 4105 [2019-11-20 03:31:52,441 INFO L226 Difference]: Without dead ends: 2138 [2019-11-20 03:31:52,443 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 03:31:52,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2019-11-20 03:31:52,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 1838. [2019-11-20 03:31:52,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-20 03:31:52,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2102 transitions. [2019-11-20 03:31:52,481 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2102 transitions. Word has length 255 [2019-11-20 03:31:52,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:31:52,481 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2102 transitions. [2019-11-20 03:31:52,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 03:31:52,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2102 transitions. [2019-11-20 03:31:52,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-11-20 03:31:52,487 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:31:52,488 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-11-20 03:31:52,488 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:31:52,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:31:52,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1273151060, now seen corresponding path program 1 times [2019-11-20 03:31:52,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:31:52,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973269047] [2019-11-20 03:31:52,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:31:52,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:31:53,569 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 351 proven. 8 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-11-20 03:31:53,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973269047] [2019-11-20 03:31:53,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720163284] [2019-11-20 03:31:53,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f9b01c5-5073-4fd8-8cbb-c833b5068db1/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:31:53,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:31:53,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 03:31:53,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:31:53,839 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-11-20 03:31:53,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 03:31:53,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2019-11-20 03:31:53,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474996388] [2019-11-20 03:31:53,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:31:53,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:31:53,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:31:53,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-11-20 03:31:53,842 INFO L87 Difference]: Start difference. First operand 1838 states and 2102 transitions. Second operand 3 states. [2019-11-20 03:31:54,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:31:54,317 INFO L93 Difference]: Finished difference Result 4196 states and 4779 transitions. [2019-11-20 03:31:54,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:31:54,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 277 [2019-11-20 03:31:54,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:31:54,318 INFO L225 Difference]: With dead ends: 4196 [2019-11-20 03:31:54,318 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 03:31:54,322 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 281 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-11-20 03:31:54,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 03:31:54,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 03:31:54,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 03:31:54,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 03:31:54,323 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 277 [2019-11-20 03:31:54,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:31:54,323 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 03:31:54,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:31:54,323 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 03:31:54,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 03:31:54,528 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:31:54,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 03:31:54,640 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 89 [2019-11-20 03:31:55,161 WARN L191 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 33 [2019-11-20 03:31:55,638 WARN L191 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 33 [2019-11-20 03:31:55,641 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-20 03:31:55,641 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-20 03:31:55,641 INFO L444 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,641 INFO L444 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,641 INFO L444 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,641 INFO L444 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,642 INFO L444 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,642 INFO L444 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,642 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-20 03:31:55,642 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-20 03:31:55,642 INFO L444 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-20 03:31:55,642 INFO L444 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-20 03:31:55,642 INFO L444 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-20 03:31:55,642 INFO L444 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-20 03:31:55,642 INFO L444 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-20 03:31:55,642 INFO L444 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-20 03:31:55,642 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-20 03:31:55,642 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-20 03:31:55,643 INFO L444 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,643 INFO L444 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,643 INFO L444 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,643 INFO L444 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,643 INFO L444 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,643 INFO L444 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,643 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-20 03:31:55,643 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-20 03:31:55,643 INFO L444 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-20 03:31:55,643 INFO L444 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-20 03:31:55,643 INFO L444 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-20 03:31:55,643 INFO L444 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-20 03:31:55,643 INFO L444 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-20 03:31:55,643 INFO L444 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-20 03:31:55,644 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-20 03:31:55,644 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-20 03:31:55,644 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-20 03:31:55,644 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-20 03:31:55,644 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-20 03:31:55,644 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-20 03:31:55,644 INFO L444 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-20 03:31:55,644 INFO L444 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,644 INFO L444 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,644 INFO L444 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,644 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,644 INFO L444 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,644 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-20 03:31:55,645 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-20 03:31:55,645 INFO L444 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-20 03:31:55,645 INFO L444 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-20 03:31:55,645 INFO L444 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-20 03:31:55,645 INFO L444 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-20 03:31:55,645 INFO L444 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-20 03:31:55,645 INFO L444 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-20 03:31:55,645 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-20 03:31:55,645 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse6 (= ~a16~0 6)) (.cse5 (= ~a21~0 1))) (let ((.cse2 (and (not .cse6) .cse5)) (.cse3 (= ~a16~0 4)) (.cse0 (= 1 ~a7~0)) (.cse4 (not (= ~a8~0 13))) (.cse1 (= ~a17~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and .cse3 .cse2) (and .cse4 .cse5 (= 5 ~a16~0)) (and .cse0 .cse3 (<= ~a17~0 0)) (and .cse0 .cse6) (and .cse4 .cse5 .cse6) (and .cse1 .cse5 (= ~a20~0 1))))) [2019-11-20 03:31:55,646 INFO L444 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,646 INFO L444 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,646 INFO L444 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,646 INFO L444 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,646 INFO L444 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,646 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-20 03:31:55,646 INFO L444 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-20 03:31:55,646 INFO L444 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-20 03:31:55,646 INFO L444 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-20 03:31:55,646 INFO L444 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-20 03:31:55,646 INFO L444 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-20 03:31:55,646 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-20 03:31:55,647 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-20 03:31:55,647 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-20 03:31:55,647 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-20 03:31:55,647 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-20 03:31:55,647 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-20 03:31:55,647 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-20 03:31:55,647 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-20 03:31:55,647 INFO L444 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,647 INFO L444 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,647 INFO L444 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,647 INFO L444 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,647 INFO L444 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,647 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-20 03:31:55,648 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-20 03:31:55,648 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-20 03:31:55,648 INFO L444 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-20 03:31:55,648 INFO L444 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-20 03:31:55,648 INFO L444 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-20 03:31:55,648 INFO L444 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-20 03:31:55,648 INFO L444 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-20 03:31:55,648 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-20 03:31:55,648 INFO L444 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,650 INFO L444 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,650 INFO L444 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,650 INFO L444 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,650 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-20 03:31:55,650 INFO L444 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,651 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-20 03:31:55,651 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-20 03:31:55,651 INFO L444 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-20 03:31:55,651 INFO L444 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-20 03:31:55,651 INFO L444 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-20 03:31:55,651 INFO L444 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-20 03:31:55,651 INFO L444 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-20 03:31:55,651 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 03:31:55,652 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-20 03:31:55,652 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-20 03:31:55,652 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-20 03:31:55,652 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-20 03:31:55,652 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-20 03:31:55,652 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-20 03:31:55,653 INFO L444 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,653 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse6 (= ~a16~0 6)) (.cse5 (= ~a21~0 1))) (let ((.cse2 (and (not .cse6) .cse5)) (.cse3 (= ~a16~0 4)) (.cse0 (= 1 ~a7~0)) (.cse4 (not (= ~a8~0 13))) (.cse1 (= ~a17~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and .cse3 .cse2) (and .cse4 .cse5 (= 5 ~a16~0)) (and .cse0 .cse3 (<= ~a17~0 0)) (and .cse0 .cse6) (and .cse4 .cse5 .cse6) (and .cse1 .cse5 (= ~a20~0 1))))) [2019-11-20 03:31:55,653 INFO L444 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,653 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,653 INFO L444 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,653 INFO L444 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,654 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-20 03:31:55,654 INFO L444 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-20 03:31:55,654 INFO L444 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-20 03:31:55,654 INFO L444 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-20 03:31:55,654 INFO L444 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-20 03:31:55,654 INFO L444 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-20 03:31:55,654 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-20 03:31:55,655 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-20 03:31:55,655 INFO L444 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,655 INFO L444 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,655 INFO L444 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,655 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,655 INFO L444 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,655 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-20 03:31:55,656 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 03:31:55,656 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-20 03:31:55,656 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-20 03:31:55,656 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-20 03:31:55,656 INFO L444 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-20 03:31:55,656 INFO L444 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-20 03:31:55,656 INFO L444 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-20 03:31:55,656 INFO L444 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-20 03:31:55,657 INFO L444 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-20 03:31:55,657 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-20 03:31:55,657 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-20 03:31:55,657 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-20 03:31:55,657 INFO L444 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,657 INFO L444 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,657 INFO L444 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,658 INFO L444 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,658 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-20 03:31:55,658 INFO L444 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,658 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,658 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-20 03:31:55,658 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-20 03:31:55,658 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 03:31:55,658 INFO L444 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-20 03:31:55,659 INFO L444 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-20 03:31:55,659 INFO L444 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-20 03:31:55,659 INFO L444 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-20 03:31:55,659 INFO L444 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-20 03:31:55,659 INFO L444 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-20 03:31:55,659 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-20 03:31:55,659 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-20 03:31:55,659 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-20 03:31:55,660 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-20 03:31:55,660 INFO L444 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,660 INFO L444 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,660 INFO L444 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,660 INFO L444 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,660 INFO L444 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,660 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-20 03:31:55,661 INFO L444 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,661 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-20 03:31:55,661 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-20 03:31:55,661 INFO L444 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-20 03:31:55,661 INFO L444 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-20 03:31:55,661 INFO L444 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-20 03:31:55,661 INFO L444 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-20 03:31:55,661 INFO L444 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-20 03:31:55,662 INFO L444 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-20 03:31:55,662 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-20 03:31:55,662 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-20 03:31:55,662 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-20 03:31:55,662 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 03:31:55,662 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 437) no Hoare annotation was computed. [2019-11-20 03:31:55,662 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-20 03:31:55,663 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-20 03:31:55,663 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-20 03:31:55,663 INFO L444 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,663 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,663 INFO L444 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,663 INFO L444 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,663 INFO L444 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,664 INFO L444 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 03:31:55,664 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-20 03:31:55,664 INFO L444 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-20 03:31:55,664 INFO L444 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-20 03:31:55,664 INFO L444 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-20 03:31:55,664 INFO L444 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-20 03:31:55,664 INFO L444 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-20 03:31:55,665 INFO L444 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-20 03:31:55,665 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-20 03:31:55,665 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-20 03:31:55,665 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-20 03:31:55,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 03:31:55 BoogieIcfgContainer [2019-11-20 03:31:55,693 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 03:31:55,694 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 03:31:55,694 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 03:31:55,694 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 03:31:55,695 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:31:42" (3/4) ... [2019-11-20 03:31:55,698 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 03:31:55,732 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-20 03:31:55,733 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 03:31:55,885 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7f9b01c5-5073-4fd8-8cbb-c833b5068db1/bin/uautomizer/witness.graphml [2019-11-20 03:31:55,885 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 03:31:55,887 INFO L168 Benchmark]: Toolchain (without parser) took 16240.73 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 391.1 MB). Free memory was 947.4 MB in the beginning and 916.4 MB in the end (delta: 31.0 MB). Peak memory consumption was 422.1 MB. Max. memory is 11.5 GB. [2019-11-20 03:31:55,887 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:31:55,888 INFO L168 Benchmark]: CACSL2BoogieTranslator took 635.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 947.4 MB in the beginning and 1.1 GB in the end (delta: -143.8 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-11-20 03:31:55,888 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2019-11-20 03:31:55,888 INFO L168 Benchmark]: Boogie Preprocessor took 94.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2019-11-20 03:31:55,889 INFO L168 Benchmark]: RCFGBuilder took 1606.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 961.0 MB in the end (delta: 115.9 MB). Peak memory consumption was 115.9 MB. Max. memory is 11.5 GB. [2019-11-20 03:31:55,889 INFO L168 Benchmark]: TraceAbstraction took 13606.48 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 273.7 MB). Free memory was 961.0 MB in the beginning and 932.6 MB in the end (delta: 28.4 MB). Peak memory consumption was 302.1 MB. Max. memory is 11.5 GB. [2019-11-20 03:31:55,890 INFO L168 Benchmark]: Witness Printer took 191.54 ms. Allocated memory is still 1.4 GB. Free memory was 932.6 MB in the beginning and 916.4 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2019-11-20 03:31:55,892 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 635.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 947.4 MB in the beginning and 1.1 GB in the end (delta: -143.8 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 100.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 94.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1606.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 961.0 MB in the end (delta: 115.9 MB). Peak memory consumption was 115.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13606.48 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 273.7 MB). Free memory was 961.0 MB in the beginning and 932.6 MB in the end (delta: 28.4 MB). Peak memory consumption was 302.1 MB. Max. memory is 11.5 GB. * Witness Printer took 191.54 ms. Allocated memory is still 1.4 GB. Free memory was 932.6 MB in the beginning and 916.4 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 437]: 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: (((((((1 == a7 && a17 == 1) || ((!(a16 == 6) && a21 == 1) && a17 == 1)) || (a16 == 4 && !(a16 == 6) && a21 == 1)) || ((!(a8 == 13) && a21 == 1) && 5 == a16)) || ((1 == a7 && a16 == 4) && a17 <= 0)) || (1 == a7 && a16 == 6)) || ((!(a8 == 13) && a21 == 1) && a16 == 6)) || ((a17 == 1 && a21 == 1) && a20 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((1 == a7 && a17 == 1) || ((!(a16 == 6) && a21 == 1) && a17 == 1)) || (a16 == 4 && !(a16 == 6) && a21 == 1)) || ((!(a8 == 13) && a21 == 1) && 5 == a16)) || ((1 == a7 && a16 == 4) && a17 <= 0)) || (1 == a7 && a16 == 6)) || ((!(a8 == 13) && a21 == 1) && a16 == 6)) || ((a17 == 1 && a21 == 1) && a20 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 13.5s, OverallIterations: 11, TraceHistogramMax: 7, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, HoareTripleCheckerStatistics: 916 SDtfs, 2467 SDslu, 123 SDs, 0 SdLazy, 5865 SolverSat, 1047 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 335 GetRequests, 295 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1969occurred 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.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 1908 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 42 NumberOfFragments, 163 HoareAnnotationTreeSize, 3 FomulaSimplifications, 14748 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 5082 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 2207 NumberOfCodeBlocks, 2207 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2195 ConstructedInterpolants, 0 QuantifiedInterpolants, 1591827 SizeOfPredicates, 0 NumberOfNonLiveVariables, 507 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 2712/2720 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...