./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem03_label24.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_43ba96fc-8cf3-49c5-ad25-0ec3624a69b3/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_43ba96fc-8cf3-49c5-ad25-0ec3624a69b3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_43ba96fc-8cf3-49c5-ad25-0ec3624a69b3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_43ba96fc-8cf3-49c5-ad25-0ec3624a69b3/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem03_label24.c -s /tmp/vcloud-vcloud-master/worker/run_dir_43ba96fc-8cf3-49c5-ad25-0ec3624a69b3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_43ba96fc-8cf3-49c5-ad25-0ec3624a69b3/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 d443bde2b4ed91a040fe01a253a772dbee49a394 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:20:02,299 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:20:02,300 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:20:02,314 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:20:02,314 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:20:02,316 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:20:02,317 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:20:02,327 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:20:02,331 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:20:02,335 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:20:02,336 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:20:02,338 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:20:02,338 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:20:02,340 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:20:02,341 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:20:02,342 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:20:02,343 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:20:02,344 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:20:02,346 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:20:02,349 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:20:02,353 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:20:02,354 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:20:02,357 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:20:02,358 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:20:02,360 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:20:02,361 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:20:02,361 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:20:02,363 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:20:02,363 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:20:02,364 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:20:02,364 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:20:02,365 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:20:02,365 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:20:02,366 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:20:02,368 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:20:02,368 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:20:02,369 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:20:02,369 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:20:02,369 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:20:02,370 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:20:02,370 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:20:02,371 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_43ba96fc-8cf3-49c5-ad25-0ec3624a69b3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:20:02,396 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:20:02,396 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:20:02,397 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:20:02,397 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:20:02,398 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:20:02,398 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:20:02,398 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:20:02,398 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:20:02,399 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:20:02,399 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:20:02,399 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:20:02,399 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:20:02,399 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:20:02,400 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:20:02,400 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:20:02,400 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:20:02,400 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:20:02,401 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:20:02,401 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:20:02,401 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:20:02,401 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:20:02,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:20:02,402 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:20:02,402 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:20:02,402 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:20:02,402 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:20:02,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:20:02,403 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:20:02,403 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_43ba96fc-8cf3-49c5-ad25-0ec3624a69b3/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 -> d443bde2b4ed91a040fe01a253a772dbee49a394 [2019-11-16 00:20:02,449 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:20:02,463 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:20:02,467 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:20:02,468 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:20:02,468 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:20:02,470 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_43ba96fc-8cf3-49c5-ad25-0ec3624a69b3/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem03_label24.c [2019-11-16 00:20:02,534 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_43ba96fc-8cf3-49c5-ad25-0ec3624a69b3/bin/uautomizer/data/af1df8b22/b126f5a59a434e87b7513f9206ee0c53/FLAGe4d5a54b7 [2019-11-16 00:20:03,095 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:20:03,096 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_43ba96fc-8cf3-49c5-ad25-0ec3624a69b3/sv-benchmarks/c/eca-rers2012/Problem03_label24.c [2019-11-16 00:20:03,117 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_43ba96fc-8cf3-49c5-ad25-0ec3624a69b3/bin/uautomizer/data/af1df8b22/b126f5a59a434e87b7513f9206ee0c53/FLAGe4d5a54b7 [2019-11-16 00:20:03,493 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_43ba96fc-8cf3-49c5-ad25-0ec3624a69b3/bin/uautomizer/data/af1df8b22/b126f5a59a434e87b7513f9206ee0c53 [2019-11-16 00:20:03,495 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:20:03,497 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:20:03,498 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:20:03,498 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:20:03,503 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:20:03,504 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:20:03" (1/1) ... [2019-11-16 00:20:03,506 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@451d7634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:03, skipping insertion in model container [2019-11-16 00:20:03,507 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:20:03" (1/1) ... [2019-11-16 00:20:03,514 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:20:03,578 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:20:04,232 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:20:04,237 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:20:04,517 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:20:04,541 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:20:04,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:04 WrapperNode [2019-11-16 00:20:04,542 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:20:04,543 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:20:04,543 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:20:04,544 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:20:04,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:04" (1/1) ... [2019-11-16 00:20:04,586 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:04" (1/1) ... [2019-11-16 00:20:04,672 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:20:04,674 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:20:04,675 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:20:04,675 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:20:04,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:04" (1/1) ... [2019-11-16 00:20:04,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:04" (1/1) ... [2019-11-16 00:20:04,694 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:04" (1/1) ... [2019-11-16 00:20:04,695 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:04" (1/1) ... [2019-11-16 00:20:04,748 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:04" (1/1) ... [2019-11-16 00:20:04,772 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:04" (1/1) ... [2019-11-16 00:20:04,785 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:04" (1/1) ... [2019-11-16 00:20:04,798 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:20:04,798 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:20:04,799 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:20:04,799 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:20:04,800 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43ba96fc-8cf3-49c5-ad25-0ec3624a69b3/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-16 00:20:04,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:20:04,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:20:07,172 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:20:07,173 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-16 00:20:07,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:20:07 BoogieIcfgContainer [2019-11-16 00:20:07,174 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:20:07,175 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:20:07,175 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:20:07,178 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:20:07,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:20:03" (1/3) ... [2019-11-16 00:20:07,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b2e2d7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:20:07, skipping insertion in model container [2019-11-16 00:20:07,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:04" (2/3) ... [2019-11-16 00:20:07,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b2e2d7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:20:07, skipping insertion in model container [2019-11-16 00:20:07,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:20:07" (3/3) ... [2019-11-16 00:20:07,187 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label24.c [2019-11-16 00:20:07,197 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:20:07,205 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:20:07,216 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:20:07,255 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:20:07,255 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:20:07,255 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:20:07,255 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:20:07,255 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:20:07,255 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:20:07,256 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:20:07,256 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:20:07,275 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-11-16 00:20:07,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-16 00:20:07,304 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:20:07,305 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:20:07,307 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:20:07,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:07,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1612939027, now seen corresponding path program 1 times [2019-11-16 00:20:07,318 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:20:07,318 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520012342] [2019-11-16 00:20:07,319 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:07,319 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:07,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:20:07,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:08,119 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-16 00:20:08,119 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520012342] [2019-11-16 00:20:08,120 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:20:08,120 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:20:08,121 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773602456] [2019-11-16 00:20:08,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:20:08,126 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:20:08,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:20:08,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:20:08,141 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 4 states. [2019-11-16 00:20:10,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:20:10,790 INFO L93 Difference]: Finished difference Result 1023 states and 1861 transitions. [2019-11-16 00:20:10,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:20:10,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2019-11-16 00:20:10,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:20:10,813 INFO L225 Difference]: With dead ends: 1023 [2019-11-16 00:20:10,813 INFO L226 Difference]: Without dead ends: 654 [2019-11-16 00:20:10,818 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:20:10,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2019-11-16 00:20:10,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 652. [2019-11-16 00:20:10,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2019-11-16 00:20:10,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 964 transitions. [2019-11-16 00:20:10,926 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 964 transitions. Word has length 191 [2019-11-16 00:20:10,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:20:10,929 INFO L462 AbstractCegarLoop]: Abstraction has 652 states and 964 transitions. [2019-11-16 00:20:10,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:20:10,930 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 964 transitions. [2019-11-16 00:20:10,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-11-16 00:20:10,938 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:20:10,939 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:20:10,940 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:20:10,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:10,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1561555348, now seen corresponding path program 1 times [2019-11-16 00:20:10,940 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:20:10,941 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44574319] [2019-11-16 00:20:10,941 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:10,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:10,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:20:10,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:11,081 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:20:11,082 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44574319] [2019-11-16 00:20:11,082 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:20:11,082 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:20:11,082 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398681921] [2019-11-16 00:20:11,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:20:11,084 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:20:11,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:20:11,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:20:11,085 INFO L87 Difference]: Start difference. First operand 652 states and 964 transitions. Second operand 3 states. [2019-11-16 00:20:12,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:20:12,245 INFO L93 Difference]: Finished difference Result 1929 states and 2864 transitions. [2019-11-16 00:20:12,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:20:12,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2019-11-16 00:20:12,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:20:12,255 INFO L225 Difference]: With dead ends: 1929 [2019-11-16 00:20:12,256 INFO L226 Difference]: Without dead ends: 1279 [2019-11-16 00:20:12,260 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:20:12,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2019-11-16 00:20:12,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1265. [2019-11-16 00:20:12,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1265 states. [2019-11-16 00:20:12,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1832 transitions. [2019-11-16 00:20:12,308 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1832 transitions. Word has length 199 [2019-11-16 00:20:12,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:20:12,309 INFO L462 AbstractCegarLoop]: Abstraction has 1265 states and 1832 transitions. [2019-11-16 00:20:12,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:20:12,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1832 transitions. [2019-11-16 00:20:12,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-11-16 00:20:12,314 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:20:12,315 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:20:12,315 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:20:12,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:12,316 INFO L82 PathProgramCache]: Analyzing trace with hash -252433271, now seen corresponding path program 1 times [2019-11-16 00:20:12,316 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:20:12,316 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689081169] [2019-11-16 00:20:12,316 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:12,317 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:12,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:20:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:12,600 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:20:12,601 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689081169] [2019-11-16 00:20:12,601 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:20:12,602 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:20:12,602 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291025567] [2019-11-16 00:20:12,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:20:12,604 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:20:12,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:20:12,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:20:12,604 INFO L87 Difference]: Start difference. First operand 1265 states and 1832 transitions. Second operand 3 states. [2019-11-16 00:20:13,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:20:13,927 INFO L93 Difference]: Finished difference Result 3758 states and 5448 transitions. [2019-11-16 00:20:13,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:20:13,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2019-11-16 00:20:13,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:20:13,944 INFO L225 Difference]: With dead ends: 3758 [2019-11-16 00:20:13,944 INFO L226 Difference]: Without dead ends: 2495 [2019-11-16 00:20:13,947 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:20:13,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2019-11-16 00:20:14,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 2493. [2019-11-16 00:20:14,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2493 states. [2019-11-16 00:20:14,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2493 states and 3402 transitions. [2019-11-16 00:20:14,013 INFO L78 Accepts]: Start accepts. Automaton has 2493 states and 3402 transitions. Word has length 206 [2019-11-16 00:20:14,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:20:14,014 INFO L462 AbstractCegarLoop]: Abstraction has 2493 states and 3402 transitions. [2019-11-16 00:20:14,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:20:14,014 INFO L276 IsEmpty]: Start isEmpty. Operand 2493 states and 3402 transitions. [2019-11-16 00:20:14,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-11-16 00:20:14,022 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:20:14,023 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:20:14,023 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:20:14,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:14,023 INFO L82 PathProgramCache]: Analyzing trace with hash -225243153, now seen corresponding path program 1 times [2019-11-16 00:20:14,024 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:20:14,024 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412633511] [2019-11-16 00:20:14,024 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:14,024 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:14,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:20:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:14,145 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:20:14,145 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412633511] [2019-11-16 00:20:14,146 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:20:14,146 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:20:14,146 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895870687] [2019-11-16 00:20:14,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:20:14,148 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:20:14,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:20:14,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:20:14,149 INFO L87 Difference]: Start difference. First operand 2493 states and 3402 transitions. Second operand 4 states. [2019-11-16 00:20:15,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:20:15,706 INFO L93 Difference]: Finished difference Result 4955 states and 6763 transitions. [2019-11-16 00:20:15,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:20:15,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 216 [2019-11-16 00:20:15,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:20:15,720 INFO L225 Difference]: With dead ends: 4955 [2019-11-16 00:20:15,721 INFO L226 Difference]: Without dead ends: 2464 [2019-11-16 00:20:15,724 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:20:15,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2464 states. [2019-11-16 00:20:15,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2464 to 2464. [2019-11-16 00:20:15,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2464 states. [2019-11-16 00:20:15,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2464 states to 2464 states and 3263 transitions. [2019-11-16 00:20:15,787 INFO L78 Accepts]: Start accepts. Automaton has 2464 states and 3263 transitions. Word has length 216 [2019-11-16 00:20:15,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:20:15,788 INFO L462 AbstractCegarLoop]: Abstraction has 2464 states and 3263 transitions. [2019-11-16 00:20:15,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:20:15,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2464 states and 3263 transitions. [2019-11-16 00:20:15,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-11-16 00:20:15,796 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:20:15,796 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:20:15,797 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:20:15,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:15,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1464925484, now seen corresponding path program 1 times [2019-11-16 00:20:15,797 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:20:15,798 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141581183] [2019-11-16 00:20:15,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:15,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:15,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:20:15,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:15,929 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:20:15,930 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141581183] [2019-11-16 00:20:15,930 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:20:15,930 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:20:15,930 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829274730] [2019-11-16 00:20:15,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:20:15,931 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:20:15,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:20:15,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:20:15,934 INFO L87 Difference]: Start difference. First operand 2464 states and 3263 transitions. Second operand 4 states. [2019-11-16 00:20:17,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:20:17,615 INFO L93 Difference]: Finished difference Result 9843 states and 13038 transitions. [2019-11-16 00:20:17,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:20:17,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 218 [2019-11-16 00:20:17,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:20:17,656 INFO L225 Difference]: With dead ends: 9843 [2019-11-16 00:20:17,656 INFO L226 Difference]: Without dead ends: 7381 [2019-11-16 00:20:17,660 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:20:17,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7381 states. [2019-11-16 00:20:17,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7381 to 7377. [2019-11-16 00:20:17,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7377 states. [2019-11-16 00:20:17,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7377 states to 7377 states and 9720 transitions. [2019-11-16 00:20:17,816 INFO L78 Accepts]: Start accepts. Automaton has 7377 states and 9720 transitions. Word has length 218 [2019-11-16 00:20:17,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:20:17,816 INFO L462 AbstractCegarLoop]: Abstraction has 7377 states and 9720 transitions. [2019-11-16 00:20:17,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:20:17,817 INFO L276 IsEmpty]: Start isEmpty. Operand 7377 states and 9720 transitions. [2019-11-16 00:20:17,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-11-16 00:20:17,828 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:20:17,829 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:20:17,829 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:20:17,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:17,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1826592161, now seen corresponding path program 1 times [2019-11-16 00:20:17,830 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:20:17,830 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555749098] [2019-11-16 00:20:17,830 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:17,831 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:17,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:20:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:17,934 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-16 00:20:17,935 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555749098] [2019-11-16 00:20:17,936 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:20:17,936 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:20:17,936 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178637107] [2019-11-16 00:20:17,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:20:17,937 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:20:17,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:20:17,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:20:17,938 INFO L87 Difference]: Start difference. First operand 7377 states and 9720 transitions. Second operand 3 states. [2019-11-16 00:20:18,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:20:18,906 INFO L93 Difference]: Finished difference Result 14758 states and 19450 transitions. [2019-11-16 00:20:18,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:20:18,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 222 [2019-11-16 00:20:18,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:20:18,931 INFO L225 Difference]: With dead ends: 14758 [2019-11-16 00:20:18,931 INFO L226 Difference]: Without dead ends: 7383 [2019-11-16 00:20:18,939 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:20:18,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7383 states. [2019-11-16 00:20:19,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7383 to 7377. [2019-11-16 00:20:19,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7377 states. [2019-11-16 00:20:19,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7377 states to 7377 states and 8865 transitions. [2019-11-16 00:20:19,087 INFO L78 Accepts]: Start accepts. Automaton has 7377 states and 8865 transitions. Word has length 222 [2019-11-16 00:20:19,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:20:19,088 INFO L462 AbstractCegarLoop]: Abstraction has 7377 states and 8865 transitions. [2019-11-16 00:20:19,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:20:19,088 INFO L276 IsEmpty]: Start isEmpty. Operand 7377 states and 8865 transitions. [2019-11-16 00:20:19,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-11-16 00:20:19,097 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:20:19,097 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:20:19,098 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:20:19,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:19,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1919299954, now seen corresponding path program 1 times [2019-11-16 00:20:19,098 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:20:19,099 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966361154] [2019-11-16 00:20:19,099 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:19,099 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:19,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:20:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:19,368 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:20:19,369 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966361154] [2019-11-16 00:20:19,369 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:20:19,369 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:20:19,369 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37012754] [2019-11-16 00:20:19,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:20:19,370 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:20:19,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:20:19,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:20:19,371 INFO L87 Difference]: Start difference. First operand 7377 states and 8865 transitions. Second operand 3 states. [2019-11-16 00:20:20,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:20:20,327 INFO L93 Difference]: Finished difference Result 21872 states and 26317 transitions. [2019-11-16 00:20:20,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:20:20,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2019-11-16 00:20:20,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:20:20,395 INFO L225 Difference]: With dead ends: 21872 [2019-11-16 00:20:20,396 INFO L226 Difference]: Without dead ends: 14497 [2019-11-16 00:20:20,405 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:20:20,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14497 states. [2019-11-16 00:20:20,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14497 to 14488. [2019-11-16 00:20:20,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14488 states. [2019-11-16 00:20:20,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14488 states to 14488 states and 17031 transitions. [2019-11-16 00:20:20,638 INFO L78 Accepts]: Start accepts. Automaton has 14488 states and 17031 transitions. Word has length 240 [2019-11-16 00:20:20,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:20:20,639 INFO L462 AbstractCegarLoop]: Abstraction has 14488 states and 17031 transitions. [2019-11-16 00:20:20,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:20:20,639 INFO L276 IsEmpty]: Start isEmpty. Operand 14488 states and 17031 transitions. [2019-11-16 00:20:20,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-11-16 00:20:20,653 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:20:20,654 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:20:20,654 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:20:20,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:20,654 INFO L82 PathProgramCache]: Analyzing trace with hash 237647221, now seen corresponding path program 1 times [2019-11-16 00:20:20,655 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:20:20,655 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635217927] [2019-11-16 00:20:20,655 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:20,655 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:20,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:20:20,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:20,806 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:20:20,806 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635217927] [2019-11-16 00:20:20,806 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:20:20,807 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:20:20,807 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649442324] [2019-11-16 00:20:20,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:20:20,808 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:20:20,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:20:20,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:20:20,809 INFO L87 Difference]: Start difference. First operand 14488 states and 17031 transitions. Second operand 4 states. [2019-11-16 00:20:21,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:20:21,770 INFO L93 Difference]: Finished difference Result 28974 states and 34060 transitions. [2019-11-16 00:20:21,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:20:21,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 245 [2019-11-16 00:20:21,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:20:21,796 INFO L225 Difference]: With dead ends: 28974 [2019-11-16 00:20:21,796 INFO L226 Difference]: Without dead ends: 14488 [2019-11-16 00:20:21,810 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:20:21,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14488 states. [2019-11-16 00:20:22,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14488 to 14488. [2019-11-16 00:20:22,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14488 states. [2019-11-16 00:20:22,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14488 states to 14488 states and 16609 transitions. [2019-11-16 00:20:22,133 INFO L78 Accepts]: Start accepts. Automaton has 14488 states and 16609 transitions. Word has length 245 [2019-11-16 00:20:22,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:20:22,134 INFO L462 AbstractCegarLoop]: Abstraction has 14488 states and 16609 transitions. [2019-11-16 00:20:22,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:20:22,134 INFO L276 IsEmpty]: Start isEmpty. Operand 14488 states and 16609 transitions. [2019-11-16 00:20:22,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-11-16 00:20:22,146 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:20:22,147 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:20:22,147 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:20:22,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:22,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1556480726, now seen corresponding path program 1 times [2019-11-16 00:20:22,148 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:20:22,148 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104565163] [2019-11-16 00:20:22,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:22,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:22,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:20:22,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:22,257 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-16 00:20:22,257 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104565163] [2019-11-16 00:20:22,258 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:20:22,258 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:20:22,258 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525944794] [2019-11-16 00:20:22,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:20:22,259 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:20:22,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:20:22,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:20:22,259 INFO L87 Difference]: Start difference. First operand 14488 states and 16609 transitions. Second operand 3 states. [2019-11-16 00:20:23,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:20:23,351 INFO L93 Difference]: Finished difference Result 35718 states and 40926 transitions. [2019-11-16 00:20:23,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:20:23,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2019-11-16 00:20:23,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:20:23,395 INFO L225 Difference]: With dead ends: 35718 [2019-11-16 00:20:23,396 INFO L226 Difference]: Without dead ends: 21232 [2019-11-16 00:20:23,412 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:20:23,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21232 states. [2019-11-16 00:20:23,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21232 to 21227. [2019-11-16 00:20:23,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21227 states. [2019-11-16 00:20:23,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21227 states to 21227 states and 24282 transitions. [2019-11-16 00:20:23,692 INFO L78 Accepts]: Start accepts. Automaton has 21227 states and 24282 transitions. Word has length 253 [2019-11-16 00:20:23,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:20:23,693 INFO L462 AbstractCegarLoop]: Abstraction has 21227 states and 24282 transitions. [2019-11-16 00:20:23,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:20:23,693 INFO L276 IsEmpty]: Start isEmpty. Operand 21227 states and 24282 transitions. [2019-11-16 00:20:23,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-11-16 00:20:23,708 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:20:23,709 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:20:23,709 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:20:23,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:23,713 INFO L82 PathProgramCache]: Analyzing trace with hash 474797067, now seen corresponding path program 1 times [2019-11-16 00:20:23,713 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:20:23,714 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006792852] [2019-11-16 00:20:23,714 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:23,714 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:23,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:20:23,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:23,866 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-16 00:20:23,866 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006792852] [2019-11-16 00:20:23,867 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719077827] [2019-11-16 00:20:23,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43ba96fc-8cf3-49c5-ad25-0ec3624a69b3/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-16 00:20:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:24,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:20:24,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:20:24,195 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-11-16 00:20:24,196 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:20:24,196 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2019-11-16 00:20:24,197 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086311247] [2019-11-16 00:20:24,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:20:24,201 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:20:24,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:20:24,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:20:24,202 INFO L87 Difference]: Start difference. First operand 21227 states and 24282 transitions. Second operand 3 states. [2019-11-16 00:20:25,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:20:25,802 INFO L93 Difference]: Finished difference Result 42470 states and 48598 transitions. [2019-11-16 00:20:25,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:20:25,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2019-11-16 00:20:25,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:20:25,847 INFO L225 Difference]: With dead ends: 42470 [2019-11-16 00:20:25,848 INFO L226 Difference]: Without dead ends: 21245 [2019-11-16 00:20:25,865 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:20:25,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21245 states. [2019-11-16 00:20:26,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21245 to 20618. [2019-11-16 00:20:26,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20618 states. [2019-11-16 00:20:26,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20618 states to 20618 states and 23185 transitions. [2019-11-16 00:20:26,236 INFO L78 Accepts]: Start accepts. Automaton has 20618 states and 23185 transitions. Word has length 260 [2019-11-16 00:20:26,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:20:26,237 INFO L462 AbstractCegarLoop]: Abstraction has 20618 states and 23185 transitions. [2019-11-16 00:20:26,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:20:26,237 INFO L276 IsEmpty]: Start isEmpty. Operand 20618 states and 23185 transitions. [2019-11-16 00:20:26,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-11-16 00:20:26,254 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:20:26,254 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:20:26,468 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:20:26,468 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:20:26,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:26,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1666597647, now seen corresponding path program 1 times [2019-11-16 00:20:26,469 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:20:26,469 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754445009] [2019-11-16 00:20:26,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:26,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:26,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:20:26,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:26,654 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 87 proven. 3 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-11-16 00:20:26,654 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754445009] [2019-11-16 00:20:26,655 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225684816] [2019-11-16 00:20:26,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43ba96fc-8cf3-49c5-ad25-0ec3624a69b3/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:20:26,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:26,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:20:26,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:20:26,904 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-16 00:20:26,904 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:20:26,904 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-16 00:20:26,904 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585447479] [2019-11-16 00:20:26,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:20:26,905 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:20:26,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:20:26,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:20:26,906 INFO L87 Difference]: Start difference. First operand 20618 states and 23185 transitions. Second operand 3 states. [2019-11-16 00:20:28,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:20:28,129 INFO L93 Difference]: Finished difference Result 55276 states and 62224 transitions. [2019-11-16 00:20:28,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:20:28,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 270 [2019-11-16 00:20:28,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:20:28,190 INFO L225 Difference]: With dead ends: 55276 [2019-11-16 00:20:28,190 INFO L226 Difference]: Without dead ends: 34660 [2019-11-16 00:20:28,207 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:20:28,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34660 states. [2019-11-16 00:20:28,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34660 to 34625. [2019-11-16 00:20:28,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34625 states. [2019-11-16 00:20:28,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34625 states to 34625 states and 38656 transitions. [2019-11-16 00:20:28,944 INFO L78 Accepts]: Start accepts. Automaton has 34625 states and 38656 transitions. Word has length 270 [2019-11-16 00:20:28,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:20:28,948 INFO L462 AbstractCegarLoop]: Abstraction has 34625 states and 38656 transitions. [2019-11-16 00:20:28,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:20:28,948 INFO L276 IsEmpty]: Start isEmpty. Operand 34625 states and 38656 transitions. [2019-11-16 00:20:28,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-11-16 00:20:28,974 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:20:28,975 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:20:29,187 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:20:29,189 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:20:29,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:29,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1954846457, now seen corresponding path program 1 times [2019-11-16 00:20:29,189 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:20:29,190 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118606810] [2019-11-16 00:20:29,190 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:29,190 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:29,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:20:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:29,612 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 104 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:20:29,612 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118606810] [2019-11-16 00:20:29,612 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350273785] [2019-11-16 00:20:29,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43ba96fc-8cf3-49c5-ad25-0ec3624a69b3/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:20:29,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:29,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:20:29,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:20:29,896 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-16 00:20:29,896 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:20:29,897 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-16 00:20:29,897 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023696881] [2019-11-16 00:20:29,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:20:29,898 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:20:29,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:20:29,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:20:29,898 INFO L87 Difference]: Start difference. First operand 34625 states and 38656 transitions. Second operand 3 states. [2019-11-16 00:20:31,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:20:31,516 INFO L93 Difference]: Finished difference Result 69874 states and 77969 transitions. [2019-11-16 00:20:31,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:20:31,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 284 [2019-11-16 00:20:31,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:20:31,518 INFO L225 Difference]: With dead ends: 69874 [2019-11-16 00:20:31,518 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:20:31,548 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 283 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:20:31,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:20:31,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:20:31,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:20:31,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:20:31,549 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 284 [2019-11-16 00:20:31,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:20:31,549 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:20:31,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:20:31,549 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:20:31,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:20:31,754 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:20:31,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:20:31,941 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 55 [2019-11-16 00:20:32,082 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 55 [2019-11-16 00:20:32,712 WARN L191 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-11-16 00:20:33,181 WARN L191 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-11-16 00:20:33,183 INFO L443 ceAbstractionStarter]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-11-16 00:20:33,183 INFO L443 ceAbstractionStarter]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-11-16 00:20:33,183 INFO L443 ceAbstractionStarter]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,183 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,183 INFO L443 ceAbstractionStarter]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,183 INFO L443 ceAbstractionStarter]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,183 INFO L443 ceAbstractionStarter]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,183 INFO L443 ceAbstractionStarter]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,184 INFO L443 ceAbstractionStarter]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,184 INFO L443 ceAbstractionStarter]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-11-16 00:20:33,184 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,184 INFO L443 ceAbstractionStarter]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-11-16 00:20:33,184 INFO L443 ceAbstractionStarter]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-11-16 00:20:33,184 INFO L443 ceAbstractionStarter]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,184 INFO L443 ceAbstractionStarter]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,184 INFO L443 ceAbstractionStarter]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,184 INFO L443 ceAbstractionStarter]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,184 INFO L443 ceAbstractionStarter]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-11-16 00:20:33,184 INFO L443 ceAbstractionStarter]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-11-16 00:20:33,184 INFO L443 ceAbstractionStarter]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,185 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,185 INFO L443 ceAbstractionStarter]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,185 INFO L443 ceAbstractionStarter]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,185 INFO L443 ceAbstractionStarter]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,185 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,185 INFO L443 ceAbstractionStarter]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,185 INFO L443 ceAbstractionStarter]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,185 INFO L443 ceAbstractionStarter]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,185 INFO L443 ceAbstractionStarter]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,185 INFO L443 ceAbstractionStarter]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-11-16 00:20:33,185 INFO L443 ceAbstractionStarter]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-11-16 00:20:33,185 INFO L443 ceAbstractionStarter]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-11-16 00:20:33,186 INFO L443 ceAbstractionStarter]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,186 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,186 INFO L443 ceAbstractionStarter]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,186 INFO L443 ceAbstractionStarter]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,186 INFO L443 ceAbstractionStarter]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,186 INFO L443 ceAbstractionStarter]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,186 INFO L443 ceAbstractionStarter]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-11-16 00:20:33,186 INFO L443 ceAbstractionStarter]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-11-16 00:20:33,186 INFO L443 ceAbstractionStarter]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-11-16 00:20:33,186 INFO L443 ceAbstractionStarter]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,186 INFO L443 ceAbstractionStarter]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,186 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,187 INFO L443 ceAbstractionStarter]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,187 INFO L443 ceAbstractionStarter]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,187 INFO L443 ceAbstractionStarter]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,187 INFO L443 ceAbstractionStarter]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-11-16 00:20:33,187 INFO L443 ceAbstractionStarter]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-11-16 00:20:33,187 INFO L443 ceAbstractionStarter]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-11-16 00:20:33,187 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,187 INFO L443 ceAbstractionStarter]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,187 INFO L443 ceAbstractionStarter]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,187 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-11-16 00:20:33,187 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,188 INFO L443 ceAbstractionStarter]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-11-16 00:20:33,188 INFO L443 ceAbstractionStarter]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,188 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,188 INFO L443 ceAbstractionStarter]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-11-16 00:20:33,188 INFO L443 ceAbstractionStarter]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-11-16 00:20:33,188 INFO L443 ceAbstractionStarter]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,188 INFO L443 ceAbstractionStarter]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,188 INFO L443 ceAbstractionStarter]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,188 INFO L443 ceAbstractionStarter]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,188 INFO L443 ceAbstractionStarter]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,188 INFO L443 ceAbstractionStarter]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,188 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,189 INFO L443 ceAbstractionStarter]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-11-16 00:20:33,189 INFO L443 ceAbstractionStarter]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-11-16 00:20:33,189 INFO L443 ceAbstractionStarter]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-11-16 00:20:33,189 INFO L443 ceAbstractionStarter]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-11-16 00:20:33,189 INFO L443 ceAbstractionStarter]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-11-16 00:20:33,189 INFO L443 ceAbstractionStarter]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,189 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,189 INFO L443 ceAbstractionStarter]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,189 INFO L443 ceAbstractionStarter]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,189 INFO L443 ceAbstractionStarter]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,189 INFO L443 ceAbstractionStarter]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,189 INFO L443 ceAbstractionStarter]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,190 INFO L443 ceAbstractionStarter]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,190 INFO L443 ceAbstractionStarter]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,190 INFO L443 ceAbstractionStarter]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,190 INFO L443 ceAbstractionStarter]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-11-16 00:20:33,190 INFO L443 ceAbstractionStarter]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-11-16 00:20:33,190 INFO L443 ceAbstractionStarter]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-11-16 00:20:33,190 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1608) no Hoare annotation was computed. [2019-11-16 00:20:33,190 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,190 INFO L443 ceAbstractionStarter]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,190 INFO L443 ceAbstractionStarter]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,190 INFO L443 ceAbstractionStarter]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,191 INFO L443 ceAbstractionStarter]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,191 INFO L443 ceAbstractionStarter]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,191 INFO L443 ceAbstractionStarter]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,191 INFO L443 ceAbstractionStarter]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,191 INFO L443 ceAbstractionStarter]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,191 INFO L443 ceAbstractionStarter]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-11-16 00:20:33,191 INFO L443 ceAbstractionStarter]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-11-16 00:20:33,191 INFO L443 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-11-16 00:20:33,191 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-11-16 00:20:33,193 INFO L443 ceAbstractionStarter]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-11-16 00:20:33,194 INFO L443 ceAbstractionStarter]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,194 INFO L443 ceAbstractionStarter]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,194 INFO L443 ceAbstractionStarter]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,194 INFO L443 ceAbstractionStarter]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,194 INFO L443 ceAbstractionStarter]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,194 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:20:33,194 INFO L443 ceAbstractionStarter]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,195 INFO L443 ceAbstractionStarter]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,195 INFO L443 ceAbstractionStarter]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,195 INFO L443 ceAbstractionStarter]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-11-16 00:20:33,195 INFO L443 ceAbstractionStarter]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-11-16 00:20:33,195 INFO L443 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-11-16 00:20:33,195 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,196 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,196 INFO L443 ceAbstractionStarter]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,196 INFO L443 ceAbstractionStarter]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-11-16 00:20:33,196 INFO L443 ceAbstractionStarter]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-11-16 00:20:33,196 INFO L443 ceAbstractionStarter]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,196 INFO L443 ceAbstractionStarter]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,196 INFO L443 ceAbstractionStarter]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,197 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-11-16 00:20:33,197 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,197 INFO L443 ceAbstractionStarter]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-11-16 00:20:33,197 INFO L443 ceAbstractionStarter]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,197 INFO L443 ceAbstractionStarter]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-11-16 00:20:33,197 INFO L443 ceAbstractionStarter]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,197 INFO L443 ceAbstractionStarter]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,198 INFO L443 ceAbstractionStarter]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-11-16 00:20:33,198 INFO L443 ceAbstractionStarter]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-11-16 00:20:33,198 INFO L443 ceAbstractionStarter]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-11-16 00:20:33,198 INFO L443 ceAbstractionStarter]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-11-16 00:20:33,198 INFO L443 ceAbstractionStarter]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-11-16 00:20:33,198 INFO L443 ceAbstractionStarter]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-11-16 00:20:33,198 INFO L443 ceAbstractionStarter]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-11-16 00:20:33,199 INFO L443 ceAbstractionStarter]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,199 INFO L443 ceAbstractionStarter]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,199 INFO L443 ceAbstractionStarter]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,200 INFO L439 ceAbstractionStarter]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse6 (= 1 ~a3~0)) (.cse0 (<= ~a3~0 0)) (.cse5 (= ~a27~0 1)) (.cse2 (= 1 ~a6~0)) (.cse7 (= ~a12~0 1)) (.cse10 (= ~a26~0 1)) (.cse9 (not (= 0 ~a3~0))) (.cse4 (<= ~a6~0 0)) (.cse1 (<= ~a12~0 0)) (.cse3 (= ~a5~0 1)) (.cse8 (<= ~a27~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse5 .cse3) (and .cse4 .cse6 .cse7 .cse3 .cse8) (and .cse9 .cse5 .cse2 .cse7 .cse3) (and .cse5 .cse2 .cse7 .cse3 (= ~a15~0 1)) (and .cse0 .cse4 .cse7 .cse3 .cse8) (and .cse1 .cse5 .cse2 .cse3) (and .cse5 .cse2 .cse7 .cse3 .cse10) (and .cse6 .cse2 .cse7 .cse3 .cse8) (and .cse4 .cse5 .cse7 .cse3 .cse10) (and .cse0 .cse2 .cse7 .cse3 .cse8) (and .cse9 .cse4 .cse5 .cse7 .cse3) (and .cse1 .cse2 .cse3 .cse8) (and .cse4 .cse1 .cse3 .cse10 .cse8) (and (not (= ~a7~0 1)) .cse2 (= 1 ~a10~0) .cse7 .cse3 .cse8) (and .cse2 .cse7 .cse3 .cse10 .cse8) (and .cse4 .cse7 .cse3 .cse10 .cse8) (and .cse9 .cse4 .cse1 .cse3 .cse8))) [2019-11-16 00:20:33,201 INFO L443 ceAbstractionStarter]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,201 INFO L443 ceAbstractionStarter]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,201 INFO L443 ceAbstractionStarter]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,201 INFO L443 ceAbstractionStarter]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-11-16 00:20:33,201 INFO L443 ceAbstractionStarter]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-11-16 00:20:33,201 INFO L443 ceAbstractionStarter]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,202 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,202 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-16 00:20:33,202 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,202 INFO L446 ceAbstractionStarter]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-11-16 00:20:33,202 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,202 INFO L443 ceAbstractionStarter]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,202 INFO L443 ceAbstractionStarter]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,203 INFO L443 ceAbstractionStarter]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,203 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,203 INFO L443 ceAbstractionStarter]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,203 INFO L443 ceAbstractionStarter]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-11-16 00:20:33,203 INFO L443 ceAbstractionStarter]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-11-16 00:20:33,203 INFO L443 ceAbstractionStarter]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,203 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,204 INFO L443 ceAbstractionStarter]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,204 INFO L443 ceAbstractionStarter]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,204 INFO L443 ceAbstractionStarter]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,204 INFO L443 ceAbstractionStarter]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,204 INFO L443 ceAbstractionStarter]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,204 INFO L443 ceAbstractionStarter]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,204 INFO L443 ceAbstractionStarter]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,205 INFO L443 ceAbstractionStarter]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-11-16 00:20:33,205 INFO L443 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-11-16 00:20:33,205 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,205 INFO L443 ceAbstractionStarter]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,205 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-11-16 00:20:33,205 INFO L443 ceAbstractionStarter]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-11-16 00:20:33,205 INFO L443 ceAbstractionStarter]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,206 INFO L439 ceAbstractionStarter]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse6 (= 1 ~a3~0)) (.cse0 (<= ~a3~0 0)) (.cse5 (= ~a27~0 1)) (.cse2 (= 1 ~a6~0)) (.cse7 (= ~a12~0 1)) (.cse10 (= ~a26~0 1)) (.cse9 (not (= 0 ~a3~0))) (.cse4 (<= ~a6~0 0)) (.cse1 (<= ~a12~0 0)) (.cse3 (= ~a5~0 1)) (.cse8 (<= ~a27~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse5 .cse3) (and .cse4 .cse6 .cse7 .cse3 .cse8) (and .cse9 .cse5 .cse2 .cse7 .cse3) (and .cse5 .cse2 .cse7 .cse3 (= ~a15~0 1)) (and .cse0 .cse4 .cse7 .cse3 .cse8) (and .cse1 .cse5 .cse2 .cse3) (and .cse5 .cse2 .cse7 .cse3 .cse10) (and .cse6 .cse2 .cse7 .cse3 .cse8) (and .cse4 .cse5 .cse7 .cse3 .cse10) (and .cse0 .cse2 .cse7 .cse3 .cse8) (and .cse9 .cse4 .cse5 .cse7 .cse3) (and .cse1 .cse2 .cse3 .cse8) (and .cse4 .cse1 .cse3 .cse10 .cse8) (and (not (= ~a7~0 1)) .cse2 (= 1 ~a10~0) .cse7 .cse3 .cse8) (and .cse2 .cse7 .cse3 .cse10 .cse8) (and .cse4 .cse7 .cse3 .cse10 .cse8) (and .cse9 .cse4 .cse1 .cse3 .cse8))) [2019-11-16 00:20:33,206 INFO L443 ceAbstractionStarter]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,206 INFO L443 ceAbstractionStarter]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,206 INFO L443 ceAbstractionStarter]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,206 INFO L443 ceAbstractionStarter]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,206 INFO L443 ceAbstractionStarter]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-11-16 00:20:33,207 INFO L443 ceAbstractionStarter]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-11-16 00:20:33,207 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,207 INFO L443 ceAbstractionStarter]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,207 INFO L443 ceAbstractionStarter]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,207 INFO L443 ceAbstractionStarter]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,207 INFO L443 ceAbstractionStarter]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,207 INFO L443 ceAbstractionStarter]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,208 INFO L443 ceAbstractionStarter]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,208 INFO L443 ceAbstractionStarter]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,208 INFO L443 ceAbstractionStarter]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-11-16 00:20:33,208 INFO L443 ceAbstractionStarter]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-11-16 00:20:33,208 INFO L443 ceAbstractionStarter]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-11-16 00:20:33,208 INFO L443 ceAbstractionStarter]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,208 INFO L443 ceAbstractionStarter]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-11-16 00:20:33,209 INFO L443 ceAbstractionStarter]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,209 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,209 INFO L443 ceAbstractionStarter]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-11-16 00:20:33,209 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,209 INFO L443 ceAbstractionStarter]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,209 INFO L443 ceAbstractionStarter]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,209 INFO L443 ceAbstractionStarter]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,210 INFO L443 ceAbstractionStarter]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,210 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-11-16 00:20:33,210 INFO L443 ceAbstractionStarter]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,210 INFO L443 ceAbstractionStarter]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-11-16 00:20:33,210 INFO L443 ceAbstractionStarter]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-11-16 00:20:33,210 INFO L443 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-11-16 00:20:33,210 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,210 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,211 INFO L443 ceAbstractionStarter]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,211 INFO L443 ceAbstractionStarter]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,211 INFO L443 ceAbstractionStarter]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,211 INFO L443 ceAbstractionStarter]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,211 INFO L443 ceAbstractionStarter]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,211 INFO L443 ceAbstractionStarter]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,211 INFO L443 ceAbstractionStarter]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-11-16 00:20:33,212 INFO L443 ceAbstractionStarter]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-11-16 00:20:33,212 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,212 INFO L443 ceAbstractionStarter]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,212 INFO L443 ceAbstractionStarter]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-11-16 00:20:33,212 INFO L443 ceAbstractionStarter]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-11-16 00:20:33,212 INFO L443 ceAbstractionStarter]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-11-16 00:20:33,212 INFO L443 ceAbstractionStarter]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,213 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,213 INFO L443 ceAbstractionStarter]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,213 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,213 INFO L443 ceAbstractionStarter]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,213 INFO L443 ceAbstractionStarter]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,213 INFO L443 ceAbstractionStarter]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,213 INFO L443 ceAbstractionStarter]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,214 INFO L443 ceAbstractionStarter]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,214 INFO L443 ceAbstractionStarter]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,214 INFO L443 ceAbstractionStarter]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,214 INFO L443 ceAbstractionStarter]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-11-16 00:20:33,214 INFO L443 ceAbstractionStarter]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-11-16 00:20:33,214 INFO L443 ceAbstractionStarter]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-11-16 00:20:33,214 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:20:33,215 INFO L443 ceAbstractionStarter]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,215 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,215 INFO L443 ceAbstractionStarter]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,215 INFO L443 ceAbstractionStarter]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,215 INFO L443 ceAbstractionStarter]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,215 INFO L443 ceAbstractionStarter]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,215 INFO L443 ceAbstractionStarter]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,216 INFO L443 ceAbstractionStarter]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-11-16 00:20:33,216 INFO L443 ceAbstractionStarter]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-11-16 00:20:33,216 INFO L443 ceAbstractionStarter]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,216 INFO L443 ceAbstractionStarter]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-11-16 00:20:33,217 INFO L443 ceAbstractionStarter]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-11-16 00:20:33,217 INFO L443 ceAbstractionStarter]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-11-16 00:20:33,218 INFO L443 ceAbstractionStarter]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,218 INFO L443 ceAbstractionStarter]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,218 INFO L443 ceAbstractionStarter]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,218 INFO L443 ceAbstractionStarter]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,219 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,219 INFO L443 ceAbstractionStarter]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-11-16 00:20:33,219 INFO L443 ceAbstractionStarter]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-11-16 00:20:33,220 INFO L443 ceAbstractionStarter]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,220 INFO L443 ceAbstractionStarter]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,221 INFO L443 ceAbstractionStarter]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,221 INFO L443 ceAbstractionStarter]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-11-16 00:20:33,221 INFO L443 ceAbstractionStarter]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-11-16 00:20:33,221 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,221 INFO L443 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-11-16 00:20:33,221 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,221 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,222 INFO L443 ceAbstractionStarter]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,222 INFO L443 ceAbstractionStarter]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,222 INFO L443 ceAbstractionStarter]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,222 INFO L443 ceAbstractionStarter]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,222 INFO L443 ceAbstractionStarter]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,222 INFO L443 ceAbstractionStarter]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,222 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,223 INFO L443 ceAbstractionStarter]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,223 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:20:33,223 INFO L443 ceAbstractionStarter]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-11-16 00:20:33,223 INFO L443 ceAbstractionStarter]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-11-16 00:20:33,223 INFO L443 ceAbstractionStarter]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-11-16 00:20:33,223 INFO L443 ceAbstractionStarter]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,223 INFO L443 ceAbstractionStarter]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-11-16 00:20:33,224 INFO L443 ceAbstractionStarter]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-11-16 00:20:33,224 INFO L443 ceAbstractionStarter]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,224 INFO L443 ceAbstractionStarter]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,224 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,224 INFO L443 ceAbstractionStarter]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,224 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,224 INFO L443 ceAbstractionStarter]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,224 INFO L443 ceAbstractionStarter]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,225 INFO L443 ceAbstractionStarter]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,225 INFO L443 ceAbstractionStarter]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,225 INFO L443 ceAbstractionStarter]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-11-16 00:20:33,225 INFO L443 ceAbstractionStarter]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-11-16 00:20:33,225 INFO L443 ceAbstractionStarter]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-11-16 00:20:33,225 INFO L443 ceAbstractionStarter]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,225 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,226 INFO L443 ceAbstractionStarter]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,226 INFO L443 ceAbstractionStarter]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,226 INFO L443 ceAbstractionStarter]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:20:33,226 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,226 INFO L443 ceAbstractionStarter]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-11-16 00:20:33,226 INFO L443 ceAbstractionStarter]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-11-16 00:20:33,226 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,227 INFO L443 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-11-16 00:20:33,227 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-11-16 00:20:33,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:20:33 BoogieIcfgContainer [2019-11-16 00:20:33,275 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:20:33,275 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:20:33,276 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:20:33,276 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:20:33,276 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:20:07" (3/4) ... [2019-11-16 00:20:33,282 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:20:33,320 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-16 00:20:33,324 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-16 00:20:33,586 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_43ba96fc-8cf3-49c5-ad25-0ec3624a69b3/bin/uautomizer/witness.graphml [2019-11-16 00:20:33,586 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:20:33,587 INFO L168 Benchmark]: Toolchain (without parser) took 30091.16 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 946.1 MB in the beginning and 892.2 MB in the end (delta: 53.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-11-16 00:20:33,588 INFO L168 Benchmark]: CDTParser took 0.30 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-16 00:20:33,588 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1045.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 186.1 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -164.8 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:20:33,589 INFO L168 Benchmark]: Boogie Procedure Inliner took 130.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:20:33,589 INFO L168 Benchmark]: Boogie Preprocessor took 123.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:20:33,589 INFO L168 Benchmark]: RCFGBuilder took 2375.77 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 95.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -125.7 MB). Peak memory consumption was 242.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:20:33,590 INFO L168 Benchmark]: TraceAbstraction took 26099.91 ms. Allocated memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: 768.6 MB). Free memory was 1.2 GB in the beginning and 943.2 MB in the end (delta: 267.6 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2019-11-16 00:20:33,590 INFO L168 Benchmark]: Witness Printer took 310.85 ms. Allocated memory is still 2.1 GB. Free memory was 943.2 MB in the beginning and 892.2 MB in the end (delta: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:20:33,592 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.30 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 1045.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 186.1 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -164.8 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 130.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 123.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2375.77 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 95.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -125.7 MB). Peak memory consumption was 242.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26099.91 ms. Allocated memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: 768.6 MB). Free memory was 1.2 GB in the beginning and 943.2 MB in the end (delta: 267.6 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. * Witness Printer took 310.85 ms. Allocated memory is still 2.1 GB. Free memory was 943.2 MB in the beginning and 892.2 MB in the end (delta: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1608]: 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: 1652]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1658]: Loop Invariant Derived loop invariant: (((((((((((((((((((a3 <= 0 && a12 <= 0) && 1 == a6) && a5 == 1) || (((a6 <= 0 && a12 <= 0) && a27 == 1) && a5 == 1)) || ((((a6 <= 0 && 1 == a3) && a12 == 1) && a5 == 1) && a27 <= 0)) || ((((!(0 == a3) && a27 == 1) && 1 == a6) && a12 == 1) && a5 == 1)) || ((((a27 == 1 && 1 == a6) && a12 == 1) && a5 == 1) && a15 == 1)) || ((((a3 <= 0 && a6 <= 0) && a12 == 1) && a5 == 1) && a27 <= 0)) || (((a12 <= 0 && a27 == 1) && 1 == a6) && a5 == 1)) || ((((a27 == 1 && 1 == a6) && a12 == 1) && a5 == 1) && a26 == 1)) || ((((1 == a3 && 1 == a6) && a12 == 1) && a5 == 1) && a27 <= 0)) || ((((a6 <= 0 && a27 == 1) && a12 == 1) && a5 == 1) && a26 == 1)) || ((((a3 <= 0 && 1 == a6) && a12 == 1) && a5 == 1) && a27 <= 0)) || ((((!(0 == a3) && a6 <= 0) && a27 == 1) && a12 == 1) && a5 == 1)) || (((a12 <= 0 && 1 == a6) && a5 == 1) && a27 <= 0)) || ((((a6 <= 0 && a12 <= 0) && a5 == 1) && a26 == 1) && a27 <= 0)) || (((((!(a7 == 1) && 1 == a6) && 1 == a10) && a12 == 1) && a5 == 1) && a27 <= 0)) || ((((1 == a6 && a12 == 1) && a5 == 1) && a26 == 1) && a27 <= 0)) || ((((a6 <= 0 && a12 == 1) && a5 == 1) && a26 == 1) && a27 <= 0)) || ((((!(0 == a3) && a6 <= 0) && a12 <= 0) && a5 == 1) && a27 <= 0) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: (((((((((((((((((((a3 <= 0 && a12 <= 0) && 1 == a6) && a5 == 1) || (((a6 <= 0 && a12 <= 0) && a27 == 1) && a5 == 1)) || ((((a6 <= 0 && 1 == a3) && a12 == 1) && a5 == 1) && a27 <= 0)) || ((((!(0 == a3) && a27 == 1) && 1 == a6) && a12 == 1) && a5 == 1)) || ((((a27 == 1 && 1 == a6) && a12 == 1) && a5 == 1) && a15 == 1)) || ((((a3 <= 0 && a6 <= 0) && a12 == 1) && a5 == 1) && a27 <= 0)) || (((a12 <= 0 && a27 == 1) && 1 == a6) && a5 == 1)) || ((((a27 == 1 && 1 == a6) && a12 == 1) && a5 == 1) && a26 == 1)) || ((((1 == a3 && 1 == a6) && a12 == 1) && a5 == 1) && a27 <= 0)) || ((((a6 <= 0 && a27 == 1) && a12 == 1) && a5 == 1) && a26 == 1)) || ((((a3 <= 0 && 1 == a6) && a12 == 1) && a5 == 1) && a27 <= 0)) || ((((!(0 == a3) && a6 <= 0) && a27 == 1) && a12 == 1) && a5 == 1)) || (((a12 <= 0 && 1 == a6) && a5 == 1) && a27 <= 0)) || ((((a6 <= 0 && a12 <= 0) && a5 == 1) && a26 == 1) && a27 <= 0)) || (((((!(a7 == 1) && 1 == a6) && 1 == a10) && a12 == 1) && a5 == 1) && a27 <= 0)) || ((((1 == a6 && a12 == 1) && a5 == 1) && a26 == 1) && a27 <= 0)) || ((((a6 <= 0 && a12 == 1) && a5 == 1) && a26 == 1) && a27 <= 0)) || ((((!(0 == a3) && a6 <= 0) && a12 <= 0) && a5 == 1) && a27 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. Result: SAFE, OverallTime: 25.9s, OverallIterations: 12, TraceHistogramMax: 5, AutomataDifference: 17.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, HoareTripleCheckerStatistics: 2294 SDtfs, 3303 SDslu, 295 SDs, 0 SdLazy, 8498 SolverSat, 1746 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 853 GetRequests, 823 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34625occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 704 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 352 NumberOfFragments, 569 HoareAnnotationTreeSize, 3 FomulaSimplifications, 7128 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 3 FomulaSimplificationsInter, 354 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 3618 NumberOfCodeBlocks, 3618 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3603 ConstructedInterpolants, 0 QuantifiedInterpolants, 1933145 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1507 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 15 InterpolantComputations, 12 PerfectInterpolantSequences, 1099/1113 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...