./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem14_label45.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_e297e3bf-473e-4a94-97a2-9a9a4e6417bc/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e297e3bf-473e-4a94-97a2-9a9a4e6417bc/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e297e3bf-473e-4a94-97a2-9a9a4e6417bc/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e297e3bf-473e-4a94-97a2-9a9a4e6417bc/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem14_label45.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e297e3bf-473e-4a94-97a2-9a9a4e6417bc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e297e3bf-473e-4a94-97a2-9a9a4e6417bc/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 3a5c86310b0cee0c3fda3eee1e81be72e3f86b95 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 02:29:32,356 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 02:29:32,358 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 02:29:32,368 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 02:29:32,369 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 02:29:32,370 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 02:29:32,371 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 02:29:32,373 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 02:29:32,376 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 02:29:32,377 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 02:29:32,378 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 02:29:32,379 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 02:29:32,379 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 02:29:32,380 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 02:29:32,381 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 02:29:32,383 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 02:29:32,384 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 02:29:32,385 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 02:29:32,387 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 02:29:32,389 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 02:29:32,391 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 02:29:32,393 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 02:29:32,395 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 02:29:32,397 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 02:29:32,400 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 02:29:32,400 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 02:29:32,400 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 02:29:32,401 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 02:29:32,402 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 02:29:32,403 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 02:29:32,403 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 02:29:32,404 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 02:29:32,404 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 02:29:32,405 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 02:29:32,406 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 02:29:32,406 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 02:29:32,407 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 02:29:32,407 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 02:29:32,408 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 02:29:32,409 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 02:29:32,409 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 02:29:32,410 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e297e3bf-473e-4a94-97a2-9a9a4e6417bc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 02:29:32,423 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 02:29:32,424 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 02:29:32,425 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 02:29:32,425 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 02:29:32,425 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 02:29:32,425 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 02:29:32,426 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 02:29:32,426 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 02:29:32,426 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 02:29:32,426 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 02:29:32,426 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 02:29:32,426 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 02:29:32,427 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 02:29:32,427 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 02:29:32,427 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 02:29:32,427 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 02:29:32,427 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 02:29:32,428 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 02:29:32,428 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 02:29:32,428 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 02:29:32,428 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 02:29:32,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 02:29:32,429 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 02:29:32,429 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 02:29:32,429 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 02:29:32,429 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 02:29:32,430 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 02:29:32,430 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 02:29:32,430 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_e297e3bf-473e-4a94-97a2-9a9a4e6417bc/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 -> 3a5c86310b0cee0c3fda3eee1e81be72e3f86b95 [2019-11-20 02:29:32,574 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 02:29:32,584 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 02:29:32,589 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 02:29:32,592 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 02:29:32,592 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 02:29:32,593 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e297e3bf-473e-4a94-97a2-9a9a4e6417bc/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem14_label45.c [2019-11-20 02:29:32,659 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e297e3bf-473e-4a94-97a2-9a9a4e6417bc/bin/uautomizer/data/af34f8c4c/86ff24aa7f7444959ff23610820b1817/FLAGb1d9d3ee1 [2019-11-20 02:29:33,171 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 02:29:33,172 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e297e3bf-473e-4a94-97a2-9a9a4e6417bc/sv-benchmarks/c/eca-rers2012/Problem14_label45.c [2019-11-20 02:29:33,209 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e297e3bf-473e-4a94-97a2-9a9a4e6417bc/bin/uautomizer/data/af34f8c4c/86ff24aa7f7444959ff23610820b1817/FLAGb1d9d3ee1 [2019-11-20 02:29:33,408 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e297e3bf-473e-4a94-97a2-9a9a4e6417bc/bin/uautomizer/data/af34f8c4c/86ff24aa7f7444959ff23610820b1817 [2019-11-20 02:29:33,410 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 02:29:33,411 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 02:29:33,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 02:29:33,416 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 02:29:33,419 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 02:29:33,420 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:29:33" (1/1) ... [2019-11-20 02:29:33,422 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35b3a05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:29:33, skipping insertion in model container [2019-11-20 02:29:33,422 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:29:33" (1/1) ... [2019-11-20 02:29:33,429 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 02:29:33,487 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 02:29:33,950 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:29:33,954 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 02:29:34,110 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:29:34,132 INFO L192 MainTranslator]: Completed translation [2019-11-20 02:29:34,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:29:34 WrapperNode [2019-11-20 02:29:34,132 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 02:29:34,134 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 02:29:34,134 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 02:29:34,135 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 02:29:34,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:29:34" (1/1) ... [2019-11-20 02:29:34,174 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:29:34" (1/1) ... [2019-11-20 02:29:34,265 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 02:29:34,266 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 02:29:34,266 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 02:29:34,266 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 02:29:34,280 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:29:34" (1/1) ... [2019-11-20 02:29:34,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:29:34" (1/1) ... [2019-11-20 02:29:34,292 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:29:34" (1/1) ... [2019-11-20 02:29:34,292 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:29:34" (1/1) ... [2019-11-20 02:29:34,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:29:34" (1/1) ... [2019-11-20 02:29:34,362 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:29:34" (1/1) ... [2019-11-20 02:29:34,373 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:29:34" (1/1) ... [2019-11-20 02:29:34,393 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 02:29:34,393 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 02:29:34,393 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 02:29:34,394 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 02:29:34,395 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:29:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e297e3bf-473e-4a94-97a2-9a9a4e6417bc/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 02:29:34,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 02:29:34,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 02:29:36,090 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 02:29:36,090 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 02:29:36,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:29:36 BoogieIcfgContainer [2019-11-20 02:29:36,092 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 02:29:36,093 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 02:29:36,093 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 02:29:36,096 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 02:29:36,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:29:33" (1/3) ... [2019-11-20 02:29:36,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3071d38d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:29:36, skipping insertion in model container [2019-11-20 02:29:36,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:29:34" (2/3) ... [2019-11-20 02:29:36,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3071d38d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:29:36, skipping insertion in model container [2019-11-20 02:29:36,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:29:36" (3/3) ... [2019-11-20 02:29:36,100 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label45.c [2019-11-20 02:29:36,110 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 02:29:36,118 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 02:29:36,130 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 02:29:36,171 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 02:29:36,172 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 02:29:36,172 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 02:29:36,172 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 02:29:36,172 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 02:29:36,172 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 02:29:36,172 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 02:29:36,172 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 02:29:36,192 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2019-11-20 02:29:36,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-20 02:29:36,199 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:29:36,200 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:29:36,201 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:29:36,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:29:36,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1318097310, now seen corresponding path program 1 times [2019-11-20 02:29:36,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:29:36,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406387666] [2019-11-20 02:29:36,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:29:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:29:36,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:29:36,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406387666] [2019-11-20 02:29:36,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:29:36,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:29:36,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652429310] [2019-11-20 02:29:36,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:29:36,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:29:36,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:29:36,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:29:36,494 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 4 states. [2019-11-20 02:29:38,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:29:38,933 INFO L93 Difference]: Finished difference Result 866 states and 1574 transitions. [2019-11-20 02:29:38,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:29:38,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-11-20 02:29:38,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:29:38,955 INFO L225 Difference]: With dead ends: 866 [2019-11-20 02:29:38,955 INFO L226 Difference]: Without dead ends: 538 [2019-11-20 02:29:38,961 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:29:38,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-11-20 02:29:39,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 360. [2019-11-20 02:29:39,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-11-20 02:29:39,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 510 transitions. [2019-11-20 02:29:39,030 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 510 transitions. Word has length 36 [2019-11-20 02:29:39,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:29:39,031 INFO L462 AbstractCegarLoop]: Abstraction has 360 states and 510 transitions. [2019-11-20 02:29:39,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:29:39,031 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 510 transitions. [2019-11-20 02:29:39,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-20 02:29:39,037 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:29:39,037 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:29:39,037 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:29:39,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:29:39,038 INFO L82 PathProgramCache]: Analyzing trace with hash 598559029, now seen corresponding path program 1 times [2019-11-20 02:29:39,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:29:39,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517396312] [2019-11-20 02:29:39,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:29:39,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:29:39,258 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:29:39,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517396312] [2019-11-20 02:29:39,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:29:39,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:29:39,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948832395] [2019-11-20 02:29:39,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:29:39,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:29:39,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:29:39,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:29:39,264 INFO L87 Difference]: Start difference. First operand 360 states and 510 transitions. Second operand 4 states. [2019-11-20 02:29:40,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:29:40,799 INFO L93 Difference]: Finished difference Result 1430 states and 2032 transitions. [2019-11-20 02:29:40,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:29:40,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-11-20 02:29:40,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:29:40,805 INFO L225 Difference]: With dead ends: 1430 [2019-11-20 02:29:40,806 INFO L226 Difference]: Without dead ends: 716 [2019-11-20 02:29:40,809 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:29:40,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2019-11-20 02:29:40,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 538. [2019-11-20 02:29:40,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-11-20 02:29:40,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 787 transitions. [2019-11-20 02:29:40,838 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 787 transitions. Word has length 115 [2019-11-20 02:29:40,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:29:40,839 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 787 transitions. [2019-11-20 02:29:40,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:29:40,839 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 787 transitions. [2019-11-20 02:29:40,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 02:29:40,845 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:29:40,846 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:29:40,846 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:29:40,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:29:40,847 INFO L82 PathProgramCache]: Analyzing trace with hash -597275881, now seen corresponding path program 1 times [2019-11-20 02:29:40,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:29:40,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485981019] [2019-11-20 02:29:40,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:29:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:29:40,984 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:29:40,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485981019] [2019-11-20 02:29:40,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:29:40,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:29:40,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979116072] [2019-11-20 02:29:40,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:29:40,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:29:40,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:29:40,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:29:40,991 INFO L87 Difference]: Start difference. First operand 538 states and 787 transitions. Second operand 4 states. [2019-11-20 02:29:42,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:29:42,542 INFO L93 Difference]: Finished difference Result 2142 states and 3140 transitions. [2019-11-20 02:29:42,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:29:42,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-11-20 02:29:42,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:29:42,559 INFO L225 Difference]: With dead ends: 2142 [2019-11-20 02:29:42,559 INFO L226 Difference]: Without dead ends: 1606 [2019-11-20 02:29:42,560 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:29:42,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2019-11-20 02:29:42,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1250. [2019-11-20 02:29:42,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1250 states. [2019-11-20 02:29:42,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1690 transitions. [2019-11-20 02:29:42,625 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1690 transitions. Word has length 127 [2019-11-20 02:29:42,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:29:42,628 INFO L462 AbstractCegarLoop]: Abstraction has 1250 states and 1690 transitions. [2019-11-20 02:29:42,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:29:42,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1690 transitions. [2019-11-20 02:29:42,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-11-20 02:29:42,647 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:29:42,648 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 02:29:42,648 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:29:42,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:29:42,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1779789830, now seen corresponding path program 1 times [2019-11-20 02:29:42,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:29:42,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577543830] [2019-11-20 02:29:42,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:29:42,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:29:43,065 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-20 02:29:43,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577543830] [2019-11-20 02:29:43,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:29:43,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 02:29:43,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618001657] [2019-11-20 02:29:43,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 02:29:43,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:29:43,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 02:29:43,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:29:43,068 INFO L87 Difference]: Start difference. First operand 1250 states and 1690 transitions. Second operand 6 states. [2019-11-20 02:29:44,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:29:44,686 INFO L93 Difference]: Finished difference Result 2340 states and 3185 transitions. [2019-11-20 02:29:44,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 02:29:44,688 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 242 [2019-11-20 02:29:44,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:29:44,697 INFO L225 Difference]: With dead ends: 2340 [2019-11-20 02:29:44,697 INFO L226 Difference]: Without dead ends: 1270 [2019-11-20 02:29:44,700 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-20 02:29:44,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2019-11-20 02:29:44,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1250. [2019-11-20 02:29:44,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1250 states. [2019-11-20 02:29:44,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1661 transitions. [2019-11-20 02:29:44,743 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1661 transitions. Word has length 242 [2019-11-20 02:29:44,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:29:44,744 INFO L462 AbstractCegarLoop]: Abstraction has 1250 states and 1661 transitions. [2019-11-20 02:29:44,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 02:29:44,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1661 transitions. [2019-11-20 02:29:44,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-11-20 02:29:44,752 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:29:44,752 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:29:44,753 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:29:44,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:29:44,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1462057874, now seen corresponding path program 1 times [2019-11-20 02:29:44,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:29:44,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200190259] [2019-11-20 02:29:44,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:29:44,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:29:45,208 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 245 proven. 4 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-20 02:29:45,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200190259] [2019-11-20 02:29:45,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793875642] [2019-11-20 02:29:45,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e297e3bf-473e-4a94-97a2-9a9a4e6417bc/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:29:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:29:45,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 02:29:45,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:29:45,643 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 271 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-20 02:29:45,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 02:29:45,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-20 02:29:45,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907440740] [2019-11-20 02:29:45,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:29:45,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:29:45,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:29:45,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:29:45,648 INFO L87 Difference]: Start difference. First operand 1250 states and 1661 transitions. Second operand 3 states. [2019-11-20 02:29:46,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:29:46,559 INFO L93 Difference]: Finished difference Result 3032 states and 4129 transitions. [2019-11-20 02:29:46,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:29:46,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 322 [2019-11-20 02:29:46,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:29:46,574 INFO L225 Difference]: With dead ends: 3032 [2019-11-20 02:29:46,574 INFO L226 Difference]: Without dead ends: 1962 [2019-11-20 02:29:46,577 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 321 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:29:46,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2019-11-20 02:29:46,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1250. [2019-11-20 02:29:46,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1250 states. [2019-11-20 02:29:46,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1547 transitions. [2019-11-20 02:29:46,621 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1547 transitions. Word has length 322 [2019-11-20 02:29:46,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:29:46,622 INFO L462 AbstractCegarLoop]: Abstraction has 1250 states and 1547 transitions. [2019-11-20 02:29:46,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:29:46,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1547 transitions. [2019-11-20 02:29:46,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-11-20 02:29:46,629 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:29:46,630 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:29:46,834 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:29:46,834 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:29:46,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:29:46,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1521243895, now seen corresponding path program 1 times [2019-11-20 02:29:46,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:29:46,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464650003] [2019-11-20 02:29:46,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:29:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:29:47,242 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 245 proven. 4 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-11-20 02:29:47,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464650003] [2019-11-20 02:29:47,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108973303] [2019-11-20 02:29:47,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e297e3bf-473e-4a94-97a2-9a9a4e6417bc/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-20 02:29:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:29:47,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 02:29:47,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:29:47,600 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-11-20 02:29:47,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 02:29:47,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-20 02:29:47,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598432616] [2019-11-20 02:29:47,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:29:47,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:29:47,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:29:47,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:29:47,604 INFO L87 Difference]: Start difference. First operand 1250 states and 1547 transitions. Second operand 4 states. [2019-11-20 02:29:48,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:29:48,662 INFO L93 Difference]: Finished difference Result 2527 states and 3120 transitions. [2019-11-20 02:29:48,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:29:48,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 339 [2019-11-20 02:29:48,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:29:48,671 INFO L225 Difference]: With dead ends: 2527 [2019-11-20 02:29:48,671 INFO L226 Difference]: Without dead ends: 1428 [2019-11-20 02:29:48,673 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 338 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:29:48,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2019-11-20 02:29:48,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1250. [2019-11-20 02:29:48,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1250 states. [2019-11-20 02:29:48,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1394 transitions. [2019-11-20 02:29:48,704 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1394 transitions. Word has length 339 [2019-11-20 02:29:48,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:29:48,705 INFO L462 AbstractCegarLoop]: Abstraction has 1250 states and 1394 transitions. [2019-11-20 02:29:48,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:29:48,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1394 transitions. [2019-11-20 02:29:48,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2019-11-20 02:29:48,713 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:29:48,713 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:29:48,916 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:29:48,917 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:29:48,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:29:48,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1098217332, now seen corresponding path program 1 times [2019-11-20 02:29:48,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:29:48,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943144826] [2019-11-20 02:29:48,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:29:48,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:29:49,534 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 180 proven. 130 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-20 02:29:49,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943144826] [2019-11-20 02:29:49,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777817369] [2019-11-20 02:29:49,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e297e3bf-473e-4a94-97a2-9a9a4e6417bc/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-20 02:29:49,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:29:49,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 02:29:49,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:29:49,857 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2019-11-20 02:29:49,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 02:29:49,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2019-11-20 02:29:49,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087411961] [2019-11-20 02:29:49,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:29:49,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:29:49,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:29:49,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-20 02:29:49,860 INFO L87 Difference]: Start difference. First operand 1250 states and 1394 transitions. Second operand 3 states. [2019-11-20 02:29:50,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:29:50,514 INFO L93 Difference]: Finished difference Result 3032 states and 3452 transitions. [2019-11-20 02:29:50,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:29:50,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 362 [2019-11-20 02:29:50,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:29:50,526 INFO L225 Difference]: With dead ends: 3032 [2019-11-20 02:29:50,526 INFO L226 Difference]: Without dead ends: 1962 [2019-11-20 02:29:50,528 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-20 02:29:50,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2019-11-20 02:29:50,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1962. [2019-11-20 02:29:50,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2019-11-20 02:29:50,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2173 transitions. [2019-11-20 02:29:50,579 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2173 transitions. Word has length 362 [2019-11-20 02:29:50,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:29:50,580 INFO L462 AbstractCegarLoop]: Abstraction has 1962 states and 2173 transitions. [2019-11-20 02:29:50,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:29:50,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2173 transitions. [2019-11-20 02:29:50,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-11-20 02:29:50,587 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:29:50,588 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:29:50,800 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:29:50,801 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:29:50,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:29:50,801 INFO L82 PathProgramCache]: Analyzing trace with hash -600587830, now seen corresponding path program 1 times [2019-11-20 02:29:50,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:29:50,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626209682] [2019-11-20 02:29:50,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:29:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:29:51,552 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 342 proven. 43 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-20 02:29:51,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626209682] [2019-11-20 02:29:51,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870495796] [2019-11-20 02:29:51,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e297e3bf-473e-4a94-97a2-9a9a4e6417bc/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:29:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:29:51,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 02:29:51,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:29:51,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:29:52,042 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 381 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-20 02:29:52,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 02:29:52,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2019-11-20 02:29:52,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479956190] [2019-11-20 02:29:52,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 02:29:52,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:29:52,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 02:29:52,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-20 02:29:52,046 INFO L87 Difference]: Start difference. First operand 1962 states and 2173 transitions. Second operand 8 states. [2019-11-20 02:29:54,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:29:54,008 INFO L93 Difference]: Finished difference Result 3946 states and 4377 transitions. [2019-11-20 02:29:54,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 02:29:54,009 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 365 [2019-11-20 02:29:54,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:29:54,020 INFO L225 Difference]: With dead ends: 3946 [2019-11-20 02:29:54,020 INFO L226 Difference]: Without dead ends: 2164 [2019-11-20 02:29:54,023 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 363 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-11-20 02:29:54,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2164 states. [2019-11-20 02:29:54,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 1962. [2019-11-20 02:29:54,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2019-11-20 02:29:54,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2149 transitions. [2019-11-20 02:29:54,086 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2149 transitions. Word has length 365 [2019-11-20 02:29:54,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:29:54,087 INFO L462 AbstractCegarLoop]: Abstraction has 1962 states and 2149 transitions. [2019-11-20 02:29:54,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 02:29:54,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2149 transitions. [2019-11-20 02:29:54,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2019-11-20 02:29:54,103 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:29:54,104 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2019-11-20 02:29:54,308 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:29:54,308 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:29:54,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:29:54,308 INFO L82 PathProgramCache]: Analyzing trace with hash -842004897, now seen corresponding path program 1 times [2019-11-20 02:29:54,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:29:54,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922278586] [2019-11-20 02:29:54,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:29:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:29:55,657 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 636 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-11-20 02:29:55,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922278586] [2019-11-20 02:29:55,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:29:55,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 02:29:55,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750037679] [2019-11-20 02:29:55,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 02:29:55,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:29:55,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 02:29:55,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-20 02:29:55,661 INFO L87 Difference]: Start difference. First operand 1962 states and 2149 transitions. Second operand 8 states. [2019-11-20 02:29:56,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:29:56,851 INFO L93 Difference]: Finished difference Result 3756 states and 4129 transitions. [2019-11-20 02:29:56,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 02:29:56,852 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 537 [2019-11-20 02:29:56,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:29:56,863 INFO L225 Difference]: With dead ends: 3756 [2019-11-20 02:29:56,863 INFO L226 Difference]: Without dead ends: 1974 [2019-11-20 02:29:56,865 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2019-11-20 02:29:56,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2019-11-20 02:29:56,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1962. [2019-11-20 02:29:56,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2019-11-20 02:29:56,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2135 transitions. [2019-11-20 02:29:56,908 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2135 transitions. Word has length 537 [2019-11-20 02:29:56,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:29:56,909 INFO L462 AbstractCegarLoop]: Abstraction has 1962 states and 2135 transitions. [2019-11-20 02:29:56,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 02:29:56,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2135 transitions. [2019-11-20 02:29:56,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2019-11-20 02:29:56,929 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:29:56,930 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:29:56,930 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:29:56,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:29:56,933 INFO L82 PathProgramCache]: Analyzing trace with hash -963993425, now seen corresponding path program 1 times [2019-11-20 02:29:56,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:29:56,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335475937] [2019-11-20 02:29:56,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:29:57,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:29:57,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1244 backedges. 896 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2019-11-20 02:29:57,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335475937] [2019-11-20 02:29:57,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:29:57,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:29:57,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911744555] [2019-11-20 02:29:57,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:29:57,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:29:57,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:29:57,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:29:57,482 INFO L87 Difference]: Start difference. First operand 1962 states and 2135 transitions. Second operand 3 states. [2019-11-20 02:29:58,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:29:58,206 INFO L93 Difference]: Finished difference Result 4456 states and 4878 transitions. [2019-11-20 02:29:58,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:29:58,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 650 [2019-11-20 02:29:58,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:29:58,223 INFO L225 Difference]: With dead ends: 4456 [2019-11-20 02:29:58,223 INFO L226 Difference]: Without dead ends: 2674 [2019-11-20 02:29:58,226 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:29:58,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2019-11-20 02:29:58,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2318. [2019-11-20 02:29:58,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2019-11-20 02:29:58,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2536 transitions. [2019-11-20 02:29:58,275 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2536 transitions. Word has length 650 [2019-11-20 02:29:58,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:29:58,276 INFO L462 AbstractCegarLoop]: Abstraction has 2318 states and 2536 transitions. [2019-11-20 02:29:58,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:29:58,276 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2536 transitions. [2019-11-20 02:29:58,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 653 [2019-11-20 02:29:58,283 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:29:58,284 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:29:58,284 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:29:58,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:29:58,285 INFO L82 PathProgramCache]: Analyzing trace with hash 2048365184, now seen corresponding path program 1 times [2019-11-20 02:29:58,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:29:58,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022665433] [2019-11-20 02:29:58,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:29:58,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:29:58,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 1120 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2019-11-20 02:29:58,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022665433] [2019-11-20 02:29:58,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:29:58,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:29:58,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382894730] [2019-11-20 02:29:58,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:29:58,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:29:58,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:29:58,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:29:58,976 INFO L87 Difference]: Start difference. First operand 2318 states and 2536 transitions. Second operand 3 states. [2019-11-20 02:29:59,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:29:59,720 INFO L93 Difference]: Finished difference Result 4634 states and 5074 transitions. [2019-11-20 02:29:59,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:29:59,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 652 [2019-11-20 02:29:59,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:29:59,734 INFO L225 Difference]: With dead ends: 4634 [2019-11-20 02:29:59,734 INFO L226 Difference]: Without dead ends: 2318 [2019-11-20 02:29:59,737 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:29:59,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2019-11-20 02:29:59,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2318. [2019-11-20 02:29:59,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2019-11-20 02:29:59,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2494 transitions. [2019-11-20 02:29:59,819 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2494 transitions. Word has length 652 [2019-11-20 02:29:59,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:29:59,819 INFO L462 AbstractCegarLoop]: Abstraction has 2318 states and 2494 transitions. [2019-11-20 02:29:59,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:29:59,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2494 transitions. [2019-11-20 02:29:59,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 696 [2019-11-20 02:29:59,843 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:29:59,844 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:29:59,844 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:29:59,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:29:59,844 INFO L82 PathProgramCache]: Analyzing trace with hash 689865864, now seen corresponding path program 1 times [2019-11-20 02:29:59,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:29:59,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058968807] [2019-11-20 02:29:59,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:29:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:30:01,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1291 backedges. 769 proven. 174 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2019-11-20 02:30:01,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058968807] [2019-11-20 02:30:01,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440671176] [2019-11-20 02:30:01,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e297e3bf-473e-4a94-97a2-9a9a4e6417bc/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:30:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:30:01,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 847 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 02:30:01,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:30:02,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1291 backedges. 914 proven. 29 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2019-11-20 02:30:02,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 02:30:02,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2019-11-20 02:30:02,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413400403] [2019-11-20 02:30:02,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 02:30:02,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:30:02,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 02:30:02,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-20 02:30:02,908 INFO L87 Difference]: Start difference. First operand 2318 states and 2494 transitions. Second operand 8 states. [2019-11-20 02:30:04,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:30:04,025 INFO L93 Difference]: Finished difference Result 4853 states and 5228 transitions. [2019-11-20 02:30:04,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 02:30:04,026 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 695 [2019-11-20 02:30:04,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:30:04,041 INFO L225 Difference]: With dead ends: 4853 [2019-11-20 02:30:04,041 INFO L226 Difference]: Without dead ends: 2715 [2019-11-20 02:30:04,044 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 703 GetRequests, 692 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-11-20 02:30:04,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2715 states. [2019-11-20 02:30:04,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2715 to 2674. [2019-11-20 02:30:04,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2674 states. [2019-11-20 02:30:04,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 2859 transitions. [2019-11-20 02:30:04,108 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 2859 transitions. Word has length 695 [2019-11-20 02:30:04,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:30:04,109 INFO L462 AbstractCegarLoop]: Abstraction has 2674 states and 2859 transitions. [2019-11-20 02:30:04,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 02:30:04,110 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 2859 transitions. [2019-11-20 02:30:04,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 698 [2019-11-20 02:30:04,118 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:30:04,120 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:30:04,323 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:30:04,324 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:30:04,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:30:04,324 INFO L82 PathProgramCache]: Analyzing trace with hash -2025724903, now seen corresponding path program 1 times [2019-11-20 02:30:04,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:30:04,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272048511] [2019-11-20 02:30:04,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:30:04,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:30:05,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1612 backedges. 1000 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-11-20 02:30:05,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272048511] [2019-11-20 02:30:05,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:30:05,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 02:30:05,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805415977] [2019-11-20 02:30:05,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 02:30:05,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:30:05,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 02:30:05,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-20 02:30:05,307 INFO L87 Difference]: Start difference. First operand 2674 states and 2859 transitions. Second operand 7 states. [2019-11-20 02:30:06,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:30:06,369 INFO L93 Difference]: Finished difference Result 5396 states and 5769 transitions. [2019-11-20 02:30:06,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 02:30:06,369 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 697 [2019-11-20 02:30:06,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:30:06,384 INFO L225 Difference]: With dead ends: 5396 [2019-11-20 02:30:06,384 INFO L226 Difference]: Without dead ends: 2852 [2019-11-20 02:30:06,388 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-20 02:30:06,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2019-11-20 02:30:06,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2674. [2019-11-20 02:30:06,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2674 states. [2019-11-20 02:30:06,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 2823 transitions. [2019-11-20 02:30:06,446 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 2823 transitions. Word has length 697 [2019-11-20 02:30:06,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:30:06,446 INFO L462 AbstractCegarLoop]: Abstraction has 2674 states and 2823 transitions. [2019-11-20 02:30:06,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 02:30:06,447 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 2823 transitions. [2019-11-20 02:30:06,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 723 [2019-11-20 02:30:06,455 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:30:06,456 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:30:06,456 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:30:06,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:30:06,457 INFO L82 PathProgramCache]: Analyzing trace with hash 750664143, now seen corresponding path program 1 times [2019-11-20 02:30:06,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:30:06,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784079440] [2019-11-20 02:30:06,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:30:06,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:30:06,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1637 backedges. 1140 proven. 0 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2019-11-20 02:30:06,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784079440] [2019-11-20 02:30:06,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:30:06,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:30:06,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920120764] [2019-11-20 02:30:06,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:30:06,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:30:06,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:30:06,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:30:06,970 INFO L87 Difference]: Start difference. First operand 2674 states and 2823 transitions. Second operand 3 states. [2019-11-20 02:30:07,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:30:07,597 INFO L93 Difference]: Finished difference Result 5702 states and 6027 transitions. [2019-11-20 02:30:07,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:30:07,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 722 [2019-11-20 02:30:07,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:30:07,613 INFO L225 Difference]: With dead ends: 5702 [2019-11-20 02:30:07,613 INFO L226 Difference]: Without dead ends: 3208 [2019-11-20 02:30:07,616 INFO L630 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-20 02:30:07,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3208 states. [2019-11-20 02:30:07,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3208 to 3030. [2019-11-20 02:30:07,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3030 states. [2019-11-20 02:30:07,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 3030 states and 3188 transitions. [2019-11-20 02:30:07,672 INFO L78 Accepts]: Start accepts. Automaton has 3030 states and 3188 transitions. Word has length 722 [2019-11-20 02:30:07,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:30:07,673 INFO L462 AbstractCegarLoop]: Abstraction has 3030 states and 3188 transitions. [2019-11-20 02:30:07,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:30:07,673 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 3188 transitions. [2019-11-20 02:30:07,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 878 [2019-11-20 02:30:07,687 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:30:07,688 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:30:07,688 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:30:07,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:30:07,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1954280938, now seen corresponding path program 1 times [2019-11-20 02:30:07,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:30:07,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307084432] [2019-11-20 02:30:07,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:30:07,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:30:08,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2336 backedges. 1516 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-11-20 02:30:08,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307084432] [2019-11-20 02:30:08,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:30:08,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:30:08,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761448669] [2019-11-20 02:30:08,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:30:08,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:30:08,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:30:08,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:30:08,649 INFO L87 Difference]: Start difference. First operand 3030 states and 3188 transitions. Second operand 4 states. [2019-11-20 02:30:09,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:30:09,492 INFO L93 Difference]: Finished difference Result 6948 states and 7354 transitions. [2019-11-20 02:30:09,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:30:09,492 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 877 [2019-11-20 02:30:09,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:30:09,510 INFO L225 Difference]: With dead ends: 6948 [2019-11-20 02:30:09,510 INFO L226 Difference]: Without dead ends: 3920 [2019-11-20 02:30:09,514 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:30:09,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2019-11-20 02:30:09,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3742. [2019-11-20 02:30:09,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2019-11-20 02:30:09,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 3909 transitions. [2019-11-20 02:30:09,568 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 3909 transitions. Word has length 877 [2019-11-20 02:30:09,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:30:09,569 INFO L462 AbstractCegarLoop]: Abstraction has 3742 states and 3909 transitions. [2019-11-20 02:30:09,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:30:09,569 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 3909 transitions. [2019-11-20 02:30:09,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 971 [2019-11-20 02:30:09,581 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:30:09,581 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:30:09,582 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:30:09,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:30:09,582 INFO L82 PathProgramCache]: Analyzing trace with hash 625456656, now seen corresponding path program 1 times [2019-11-20 02:30:09,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:30:09,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203076982] [2019-11-20 02:30:09,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:30:09,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:30:11,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2909 backedges. 1978 proven. 0 refuted. 0 times theorem prover too weak. 931 trivial. 0 not checked. [2019-11-20 02:30:11,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203076982] [2019-11-20 02:30:11,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:30:11,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 02:30:11,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074258925] [2019-11-20 02:30:11,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 02:30:11,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:30:11,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 02:30:11,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-20 02:30:11,356 INFO L87 Difference]: Start difference. First operand 3742 states and 3909 transitions. Second operand 7 states. [2019-11-20 02:30:12,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:30:12,511 INFO L93 Difference]: Finished difference Result 7307 states and 7640 transitions. [2019-11-20 02:30:12,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 02:30:12,511 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 970 [2019-11-20 02:30:12,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:30:12,520 INFO L225 Difference]: With dead ends: 7307 [2019-11-20 02:30:12,520 INFO L226 Difference]: Without dead ends: 3745 [2019-11-20 02:30:12,525 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-20 02:30:12,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3745 states. [2019-11-20 02:30:12,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3745 to 3742. [2019-11-20 02:30:12,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2019-11-20 02:30:12,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 3907 transitions. [2019-11-20 02:30:12,580 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 3907 transitions. Word has length 970 [2019-11-20 02:30:12,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:30:12,581 INFO L462 AbstractCegarLoop]: Abstraction has 3742 states and 3907 transitions. [2019-11-20 02:30:12,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 02:30:12,581 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 3907 transitions. [2019-11-20 02:30:12,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1048 [2019-11-20 02:30:12,594 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:30:12,596 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:30:12,596 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:30:12,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:30:12,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1401544166, now seen corresponding path program 1 times [2019-11-20 02:30:12,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:30:12,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370116984] [2019-11-20 02:30:12,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:30:12,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:30:13,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3551 backedges. 1082 proven. 0 refuted. 0 times theorem prover too weak. 2469 trivial. 0 not checked. [2019-11-20 02:30:13,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370116984] [2019-11-20 02:30:13,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:30:13,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:30:13,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559475988] [2019-11-20 02:30:13,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:30:13,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:30:13,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:30:13,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:30:13,884 INFO L87 Difference]: Start difference. First operand 3742 states and 3907 transitions. Second operand 4 states. [2019-11-20 02:30:14,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:30:14,606 INFO L93 Difference]: Finished difference Result 7838 states and 8187 transitions. [2019-11-20 02:30:14,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:30:14,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1047 [2019-11-20 02:30:14,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:30:14,615 INFO L225 Difference]: With dead ends: 7838 [2019-11-20 02:30:14,615 INFO L226 Difference]: Without dead ends: 3920 [2019-11-20 02:30:14,619 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:30:14,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2019-11-20 02:30:14,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3564. [2019-11-20 02:30:14,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3564 states. [2019-11-20 02:30:14,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 3651 transitions. [2019-11-20 02:30:14,672 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 3651 transitions. Word has length 1047 [2019-11-20 02:30:14,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:30:14,673 INFO L462 AbstractCegarLoop]: Abstraction has 3564 states and 3651 transitions. [2019-11-20 02:30:14,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:30:14,674 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 3651 transitions. [2019-11-20 02:30:14,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1096 [2019-11-20 02:30:14,688 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:30:14,689 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:30:14,689 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:30:14,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:30:14,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1689291374, now seen corresponding path program 1 times [2019-11-20 02:30:14,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:30:14,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856928128] [2019-11-20 02:30:14,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:30:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:30:15,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3788 backedges. 1122 proven. 0 refuted. 0 times theorem prover too weak. 2666 trivial. 0 not checked. [2019-11-20 02:30:15,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856928128] [2019-11-20 02:30:15,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:30:15,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 02:30:15,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762501323] [2019-11-20 02:30:15,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 02:30:15,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:30:15,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 02:30:15,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:30:15,984 INFO L87 Difference]: Start difference. First operand 3564 states and 3651 transitions. Second operand 5 states. [2019-11-20 02:30:17,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:30:17,087 INFO L93 Difference]: Finished difference Result 7480 states and 7680 transitions. [2019-11-20 02:30:17,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 02:30:17,088 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1095 [2019-11-20 02:30:17,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:30:17,089 INFO L225 Difference]: With dead ends: 7480 [2019-11-20 02:30:17,090 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 02:30:17,095 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:30:17,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 02:30:17,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 02:30:17,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 02:30:17,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 02:30:17,097 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1095 [2019-11-20 02:30:17,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:30:17,097 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 02:30:17,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 02:30:17,097 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 02:30:17,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 02:30:17,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 02:30:17,347 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 122 [2019-11-20 02:30:17,562 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 124 [2019-11-20 02:30:18,138 WARN L191 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 52 [2019-11-20 02:30:18,759 WARN L191 SmtUtils]: Spent 620.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 56 [2019-11-20 02:30:18,763 INFO L444 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2019-11-20 02:30:18,763 INFO L444 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2019-11-20 02:30:18,763 INFO L444 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,763 INFO L444 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,763 INFO L444 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,764 INFO L444 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2019-11-20 02:30:18,764 INFO L444 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-20 02:30:18,764 INFO L444 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-20 02:30:18,764 INFO L444 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-20 02:30:18,764 INFO L444 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2019-11-20 02:30:18,764 INFO L444 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2019-11-20 02:30:18,764 INFO L444 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2019-11-20 02:30:18,764 INFO L444 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2019-11-20 02:30:18,764 INFO L444 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,764 INFO L444 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,764 INFO L444 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,764 INFO L444 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2019-11-20 02:30:18,765 INFO L444 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2019-11-20 02:30:18,765 INFO L444 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-20 02:30:18,765 INFO L444 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-20 02:30:18,765 INFO L444 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-20 02:30:18,765 INFO L444 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2019-11-20 02:30:18,765 INFO L444 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2019-11-20 02:30:18,765 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2019-11-20 02:30:18,765 INFO L444 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,765 INFO L444 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,765 INFO L444 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,765 INFO L444 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2019-11-20 02:30:18,765 INFO L444 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-20 02:30:18,765 INFO L444 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-20 02:30:18,766 INFO L444 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-20 02:30:18,766 INFO L444 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2019-11-20 02:30:18,766 INFO L444 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2019-11-20 02:30:18,766 INFO L444 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2019-11-20 02:30:18,766 INFO L444 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2019-11-20 02:30:18,766 INFO L444 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2019-11-20 02:30:18,766 INFO L444 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,766 INFO L444 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,766 INFO L444 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,766 INFO L444 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2019-11-20 02:30:18,766 INFO L444 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-20 02:30:18,766 INFO L444 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-20 02:30:18,767 INFO L444 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-20 02:30:18,767 INFO L444 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2019-11-20 02:30:18,767 INFO L444 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2019-11-20 02:30:18,767 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2019-11-20 02:30:18,767 INFO L444 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,767 INFO L444 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,767 INFO L444 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,767 INFO L444 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2019-11-20 02:30:18,767 INFO L444 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-20 02:30:18,767 INFO L444 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-20 02:30:18,767 INFO L444 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-20 02:30:18,767 INFO L444 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2019-11-20 02:30:18,768 INFO L444 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2019-11-20 02:30:18,768 INFO L444 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2019-11-20 02:30:18,768 INFO L444 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2019-11-20 02:30:18,768 INFO L444 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2019-11-20 02:30:18,768 INFO L444 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,768 INFO L444 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,768 INFO L444 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,768 INFO L444 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2019-11-20 02:30:18,768 INFO L444 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-20 02:30:18,768 INFO L444 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-20 02:30:18,768 INFO L444 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-20 02:30:18,768 INFO L444 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2019-11-20 02:30:18,769 INFO L444 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2019-11-20 02:30:18,769 INFO L444 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2019-11-20 02:30:18,769 INFO L444 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2019-11-20 02:30:18,769 INFO L444 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,769 INFO L444 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,769 INFO L444 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,769 INFO L444 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-20 02:30:18,769 INFO L444 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-20 02:30:18,769 INFO L444 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-20 02:30:18,769 INFO L444 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2019-11-20 02:30:18,769 INFO L444 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2019-11-20 02:30:18,769 INFO L444 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2019-11-20 02:30:18,770 INFO L444 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2019-11-20 02:30:18,770 INFO L444 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2019-11-20 02:30:18,770 INFO L444 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,770 INFO L444 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,770 INFO L444 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,770 INFO L444 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2019-11-20 02:30:18,770 INFO L444 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2019-11-20 02:30:18,770 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 02:30:18,770 INFO L444 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-20 02:30:18,770 INFO L444 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-20 02:30:18,770 INFO L444 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-20 02:30:18,770 INFO L444 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2019-11-20 02:30:18,771 INFO L444 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2019-11-20 02:30:18,771 INFO L444 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2019-11-20 02:30:18,771 INFO L444 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,771 INFO L444 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,771 INFO L444 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,771 INFO L444 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-20 02:30:18,771 INFO L444 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-20 02:30:18,771 INFO L444 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-20 02:30:18,771 INFO L444 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2019-11-20 02:30:18,771 INFO L444 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2019-11-20 02:30:18,771 INFO L444 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2019-11-20 02:30:18,771 INFO L444 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2019-11-20 02:30:18,771 INFO L444 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2019-11-20 02:30:18,772 INFO L444 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,772 INFO L444 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,772 INFO L444 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,772 INFO L444 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2019-11-20 02:30:18,772 INFO L444 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2019-11-20 02:30:18,772 INFO L444 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-20 02:30:18,772 INFO L444 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-20 02:30:18,772 INFO L444 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-20 02:30:18,772 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2019-11-20 02:30:18,772 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 02:30:18,772 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed. [2019-11-20 02:30:18,775 INFO L444 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2019-11-20 02:30:18,775 INFO L444 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2019-11-20 02:30:18,775 INFO L444 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,775 INFO L444 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,776 INFO L444 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,776 INFO L444 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-11-20 02:30:18,776 INFO L444 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-20 02:30:18,776 INFO L444 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-20 02:30:18,777 INFO L444 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-20 02:30:18,777 INFO L444 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2019-11-20 02:30:18,777 INFO L444 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2019-11-20 02:30:18,777 INFO L444 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2019-11-20 02:30:18,777 INFO L444 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2019-11-20 02:30:18,778 INFO L444 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,778 INFO L444 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,778 INFO L444 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,778 INFO L444 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2019-11-20 02:30:18,778 INFO L444 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-20 02:30:18,778 INFO L444 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-20 02:30:18,778 INFO L444 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-20 02:30:18,779 INFO L444 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2019-11-20 02:30:18,779 INFO L444 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2019-11-20 02:30:18,779 INFO L444 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2019-11-20 02:30:18,779 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2019-11-20 02:30:18,779 INFO L444 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,779 INFO L444 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,779 INFO L444 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2019-11-20 02:30:18,780 INFO L444 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-20 02:30:18,780 INFO L444 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-20 02:30:18,780 INFO L444 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2019-11-20 02:30:18,780 INFO L444 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2019-11-20 02:30:18,780 INFO L444 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2019-11-20 02:30:18,780 INFO L444 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2019-11-20 02:30:18,780 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2019-11-20 02:30:18,781 INFO L444 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,781 INFO L444 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,781 INFO L444 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2019-11-20 02:30:18,781 INFO L444 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-20 02:30:18,781 INFO L444 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-20 02:30:18,781 INFO L444 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2019-11-20 02:30:18,781 INFO L444 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2019-11-20 02:30:18,782 INFO L444 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2019-11-20 02:30:18,782 INFO L444 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,782 INFO L444 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,783 INFO L440 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse4 (<= ~a15~0 7)) (.cse3 (not (= ~a15~0 7))) (.cse2 (= 8 ~a15~0)) (.cse1 (not (= ~a21~0 9))) (.cse6 (<= ~a12~0 11)) (.cse0 (= ~a24~0 1)) (.cse5 (not (= ~a21~0 7))) (.cse7 (< 0 (+ ~a12~0 43)))) (or (and (= 8 ~a21~0) .cse0) (and .cse1 (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse2 .cse0 (<= (+ ~a12~0 49) 0)) (and .cse3 .cse0 (< 80 ~a12~0) (not (= 6 ~a21~0))) (and (<= (+ ~a12~0 460225) 0) .cse4 .cse0) (or (and .cse4 .cse5) (and .cse4 .cse3)) (and .cse2 .cse0 .cse6 .cse7) (and (= ~a21~0 6) .cse0 (<= ~a12~0 95442)) (and .cse1 .cse0 .cse6 .cse5) (and .cse0 (and (= ~a15~0 8) .cse5) .cse7))) [2019-11-20 02:30:18,784 INFO L444 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2019-11-20 02:30:18,784 INFO L444 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2019-11-20 02:30:18,784 INFO L444 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-20 02:30:18,784 INFO L444 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-20 02:30:18,784 INFO L444 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2019-11-20 02:30:18,784 INFO L444 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2019-11-20 02:30:18,784 INFO L444 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2019-11-20 02:30:18,785 INFO L444 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2019-11-20 02:30:18,785 INFO L444 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,785 INFO L444 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,785 INFO L447 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2019-11-20 02:30:18,785 INFO L444 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2019-11-20 02:30:18,785 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2019-11-20 02:30:18,785 INFO L444 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-20 02:30:18,786 INFO L444 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-20 02:30:18,786 INFO L444 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2019-11-20 02:30:18,786 INFO L444 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2019-11-20 02:30:18,786 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2019-11-20 02:30:18,786 INFO L444 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,786 INFO L444 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,786 INFO L444 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2019-11-20 02:30:18,787 INFO L444 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2019-11-20 02:30:18,787 INFO L444 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-20 02:30:18,787 INFO L444 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-20 02:30:18,787 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 02:30:18,787 INFO L444 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2019-11-20 02:30:18,787 INFO L444 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2019-11-20 02:30:18,787 INFO L444 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,788 INFO L444 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,788 INFO L444 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-11-20 02:30:18,788 INFO L444 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,788 INFO L444 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2019-11-20 02:30:18,788 INFO L440 ceAbstractionStarter]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse2 (<= ~a15~0 7)) (.cse1 (not (= ~a15~0 7))) (.cse5 (<= ~a12~0 11)) (.cse7 (not (= ~a21~0 9))) (.cse4 (= 8 ~a15~0)) (.cse0 (= ~a24~0 1)) (.cse3 (not (= ~a21~0 7))) (.cse6 (< 0 (+ ~a12~0 43)))) (or (and (= 8 ~a21~0) .cse0) (and .cse1 .cse0 (< 80 ~a12~0) (not (= 6 ~a21~0))) (and (<= (+ ~a12~0 460225) 0) .cse2 .cse0) (or (and .cse2 .cse3) (and .cse2 .cse1)) (and .cse4 .cse0 .cse5 .cse6) (and (= ~a21~0 6) .cse0 (<= ~a12~0 95442)) (and .cse7 .cse0 .cse5 .cse3) (and .cse7 .cse4 .cse0 (<= (+ ~a12~0 49) 0)) (and .cse0 (and (= ~a15~0 8) .cse3) .cse6))) [2019-11-20 02:30:18,788 INFO L444 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2019-11-20 02:30:18,789 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2019-11-20 02:30:18,789 INFO L444 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-20 02:30:18,789 INFO L444 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-20 02:30:18,789 INFO L444 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-11-20 02:30:18,789 INFO L444 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2019-11-20 02:30:18,789 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2019-11-20 02:30:18,789 INFO L444 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2019-11-20 02:30:18,790 INFO L444 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2019-11-20 02:30:18,790 INFO L444 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,790 INFO L444 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,790 INFO L444 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,790 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2019-11-20 02:30:18,790 INFO L444 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-20 02:30:18,790 INFO L444 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-20 02:30:18,791 INFO L444 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-20 02:30:18,791 INFO L444 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2019-11-20 02:30:18,791 INFO L444 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2019-11-20 02:30:18,791 INFO L444 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2019-11-20 02:30:18,791 INFO L444 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2019-11-20 02:30:18,791 INFO L444 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2019-11-20 02:30:18,791 INFO L444 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,792 INFO L444 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,792 INFO L444 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,792 INFO L444 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2019-11-20 02:30:18,792 INFO L444 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2019-11-20 02:30:18,792 INFO L444 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-20 02:30:18,792 INFO L444 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-20 02:30:18,792 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 02:30:18,793 INFO L444 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-20 02:30:18,793 INFO L444 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2019-11-20 02:30:18,793 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2019-11-20 02:30:18,793 INFO L444 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2019-11-20 02:30:18,793 INFO L444 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,793 INFO L444 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,794 INFO L444 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,794 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2019-11-20 02:30:18,794 INFO L444 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-20 02:30:18,794 INFO L444 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-20 02:30:18,794 INFO L444 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-20 02:30:18,794 INFO L444 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2019-11-20 02:30:18,794 INFO L444 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2019-11-20 02:30:18,795 INFO L444 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2019-11-20 02:30:18,795 INFO L444 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2019-11-20 02:30:18,795 INFO L444 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2019-11-20 02:30:18,795 INFO L444 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,795 INFO L444 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,795 INFO L444 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2019-11-20 02:30:18,795 INFO L444 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2019-11-20 02:30:18,796 INFO L444 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-20 02:30:18,796 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-20 02:30:18,796 INFO L444 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-20 02:30:18,796 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2019-11-20 02:30:18,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 02:30:18 BoogieIcfgContainer [2019-11-20 02:30:18,833 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 02:30:18,834 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 02:30:18,834 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 02:30:18,834 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 02:30:18,834 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:29:36" (3/4) ... [2019-11-20 02:30:18,843 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 02:30:18,876 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-20 02:30:18,878 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 02:30:19,068 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e297e3bf-473e-4a94-97a2-9a9a4e6417bc/bin/uautomizer/witness.graphml [2019-11-20 02:30:19,069 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 02:30:19,073 INFO L168 Benchmark]: Toolchain (without parser) took 45662.17 ms. Allocated memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: 2.1 GB). Free memory was 944.8 MB in the beginning and 1.4 GB in the end (delta: -409.2 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-11-20 02:30:19,074 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 02:30:19,074 INFO L168 Benchmark]: CACSL2BoogieTranslator took 718.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -163.4 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2019-11-20 02:30:19,075 INFO L168 Benchmark]: Boogie Procedure Inliner took 131.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-20 02:30:19,075 INFO L168 Benchmark]: Boogie Preprocessor took 126.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 02:30:19,075 INFO L168 Benchmark]: RCFGBuilder took 1698.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 956.0 MB in the end (delta: 136.1 MB). Peak memory consumption was 136.1 MB. Max. memory is 11.5 GB. [2019-11-20 02:30:19,076 INFO L168 Benchmark]: TraceAbstraction took 42740.14 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 1.9 GB). Free memory was 956.0 MB in the beginning and 1.4 GB in the end (delta: -456.9 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-11-20 02:30:19,076 INFO L168 Benchmark]: Witness Printer took 235.12 ms. Allocated memory is still 3.1 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 59.0 MB). Peak memory consumption was 59.0 MB. Max. memory is 11.5 GB. [2019-11-20 02:30:19,083 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 718.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -163.4 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 131.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 126.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1698.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 956.0 MB in the end (delta: 136.1 MB). Peak memory consumption was 136.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 42740.14 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 1.9 GB). Free memory was 956.0 MB in the beginning and 1.4 GB in the end (delta: -456.9 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 235.12 ms. Allocated memory is still 3.1 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 59.0 MB). Peak memory consumption was 59.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 112]: 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: 880]: Loop Invariant Derived loop invariant: ((((((((8 == a21 && a24 == 1) || (((!(a15 == 7) && a24 == 1) && 80 < a12) && !(6 == a21))) || ((a12 + 460225 <= 0 && a15 <= 7) && a24 == 1)) || (a15 <= 7 && !(a21 == 7)) || (a15 <= 7 && !(a15 == 7))) || (((8 == a15 && a24 == 1) && a12 <= 11) && 0 < a12 + 43)) || ((a21 == 6 && a24 == 1) && a12 <= 95442)) || (((!(a21 == 9) && a24 == 1) && a12 <= 11) && !(a21 == 7))) || (((!(a21 == 9) && 8 == a15) && a24 == 1) && a12 + 49 <= 0)) || ((a24 == 1 && a15 == 8 && !(a21 == 7)) && 0 < a12 + 43) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((((((8 == a21 && a24 == 1) || ((((!(a21 == 9) && !(3 == input)) && 8 == a15) && a24 == 1) && a12 + 49 <= 0)) || (((!(a15 == 7) && a24 == 1) && 80 < a12) && !(6 == a21))) || ((a12 + 460225 <= 0 && a15 <= 7) && a24 == 1)) || (a15 <= 7 && !(a21 == 7)) || (a15 <= 7 && !(a15 == 7))) || (((8 == a15 && a24 == 1) && a12 <= 11) && 0 < a12 + 43)) || ((a21 == 6 && a24 == 1) && a12 <= 95442)) || (((!(a21 == 9) && a24 == 1) && a12 <= 11) && !(a21 == 7))) || ((a24 == 1 && a15 == 8 && !(a21 == 7)) && 0 < a12 + 43) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. Result: SAFE, OverallTime: 42.6s, OverallIterations: 18, TraceHistogramMax: 10, AutomataDifference: 21.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.6s, HoareTripleCheckerStatistics: 1650 SDtfs, 4712 SDslu, 221 SDs, 0 SdLazy, 15652 SolverSat, 2022 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2180 GetRequests, 2100 SyntacticMatches, 8 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3742occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 18 MinimizatonAttempts, 3126 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 70 NumberOfFragments, 255 HoareAnnotationTreeSize, 3 FomulaSimplifications, 631749 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 3 FomulaSimplificationsInter, 92208 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 11933 NumberOfCodeBlocks, 11933 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 11910 ConstructedInterpolants, 0 QuantifiedInterpolants, 27576344 SizeOfPredicates, 12 NumberOfNonLiveVariables, 2656 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 23 InterpolantComputations, 16 PerfectInterpolantSequences, 24980/25368 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...