./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_0190fb54-3858-458d-acf1-eebc2a51a56b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0190fb54-3858-458d-acf1-eebc2a51a56b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0190fb54-3858-458d-acf1-eebc2a51a56b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0190fb54-3858-458d-acf1-eebc2a51a56b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-3.c -s /tmp/vcloud-vcloud-master/worker/run_dir_0190fb54-3858-458d-acf1-eebc2a51a56b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0190fb54-3858-458d-acf1-eebc2a51a56b/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 b1d7062786d1cbe42a29d98cc634a5c85ac9a3f1 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:52:10,935 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:52:10,936 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:52:10,948 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:52:10,949 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:52:10,950 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:52:10,952 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:52:10,954 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:52:10,956 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:52:10,957 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:52:10,958 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:52:10,960 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:52:10,960 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:52:10,961 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:52:10,962 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:52:10,964 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:52:10,964 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:52:10,965 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:52:10,968 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:52:10,970 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:52:10,973 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:52:10,974 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:52:10,975 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:52:10,976 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:52:10,980 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:52:10,980 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:52:10,981 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:52:10,982 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:52:10,982 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:52:10,984 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:52:10,984 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:52:10,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:52:10,986 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:52:10,987 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:52:10,988 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:52:10,988 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:52:10,989 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:52:10,989 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:52:10,990 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:52:10,991 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:52:10,992 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:52:10,992 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0190fb54-3858-458d-acf1-eebc2a51a56b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:52:11,009 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:52:11,009 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:52:11,011 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:52:11,011 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:52:11,011 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:52:11,012 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:52:11,012 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:52:11,012 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:52:11,012 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:52:11,013 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:52:11,013 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:52:11,013 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:52:11,013 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:52:11,014 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:52:11,014 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:52:11,014 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:52:11,014 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:52:11,015 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:52:11,015 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:52:11,015 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:52:11,015 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:52:11,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:52:11,016 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:52:11,016 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:52:11,017 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:52:11,017 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:52:11,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:52:11,017 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:52:11,018 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_0190fb54-3858-458d-acf1-eebc2a51a56b/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 -> b1d7062786d1cbe42a29d98cc634a5c85ac9a3f1 [2019-11-15 20:52:11,049 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:52:11,062 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:52:11,066 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:52:11,068 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:52:11,068 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:52:11,069 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0190fb54-3858-458d-acf1-eebc2a51a56b/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-3.c [2019-11-15 20:52:11,134 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0190fb54-3858-458d-acf1-eebc2a51a56b/bin/uautomizer/data/374f41bbd/965894affffe4b99b6513c860bb9157e/FLAG62cdec6e1 [2019-11-15 20:52:11,578 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:52:11,583 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0190fb54-3858-458d-acf1-eebc2a51a56b/sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-3.c [2019-11-15 20:52:11,600 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0190fb54-3858-458d-acf1-eebc2a51a56b/bin/uautomizer/data/374f41bbd/965894affffe4b99b6513c860bb9157e/FLAG62cdec6e1 [2019-11-15 20:52:11,855 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0190fb54-3858-458d-acf1-eebc2a51a56b/bin/uautomizer/data/374f41bbd/965894affffe4b99b6513c860bb9157e [2019-11-15 20:52:11,858 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:52:11,859 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:52:11,866 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:52:11,866 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:52:11,872 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:52:11,873 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:52:11" (1/1) ... [2019-11-15 20:52:11,876 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4674895b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:52:11, skipping insertion in model container [2019-11-15 20:52:11,876 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:52:11" (1/1) ... [2019-11-15 20:52:11,885 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:52:11,948 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:52:12,327 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:52:12,331 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:52:12,383 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:52:12,407 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:52:12,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:52:12 WrapperNode [2019-11-15 20:52:12,408 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:52:12,409 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:52:12,409 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:52:12,410 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:52:12,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:52:12" (1/1) ... [2019-11-15 20:52:12,428 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:52:12" (1/1) ... [2019-11-15 20:52:12,474 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:52:12,475 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:52:12,475 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:52:12,475 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:52:12,485 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:52:12" (1/1) ... [2019-11-15 20:52:12,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:52:12" (1/1) ... [2019-11-15 20:52:12,490 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:52:12" (1/1) ... [2019-11-15 20:52:12,491 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:52:12" (1/1) ... [2019-11-15 20:52:12,501 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:52:12" (1/1) ... [2019-11-15 20:52:12,509 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:52:12" (1/1) ... [2019-11-15 20:52:12,512 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:52:12" (1/1) ... [2019-11-15 20:52:12,518 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:52:12,518 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:52:12,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:52:12,519 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:52:12,520 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:52:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0190fb54-3858-458d-acf1-eebc2a51a56b/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:52:12,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:52:12,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:52:12,737 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 20:52:13,461 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-15 20:52:13,461 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-15 20:52:13,462 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:52:13,462 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 20:52:13,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:52:13 BoogieIcfgContainer [2019-11-15 20:52:13,464 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:52:13,465 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:52:13,465 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:52:13,468 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:52:13,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:52:11" (1/3) ... [2019-11-15 20:52:13,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@631d87d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:52:13, skipping insertion in model container [2019-11-15 20:52:13,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:52:12" (2/3) ... [2019-11-15 20:52:13,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@631d87d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:52:13, skipping insertion in model container [2019-11-15 20:52:13,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:52:13" (3/3) ... [2019-11-15 20:52:13,471 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.cil-3.c [2019-11-15 20:52:13,479 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:52:13,485 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 20:52:13,493 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 20:52:13,516 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:52:13,517 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:52:13,517 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:52:13,517 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:52:13,517 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:52:13,517 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:52:13,517 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:52:13,517 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:52:13,533 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2019-11-15 20:52:13,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 20:52:13,539 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:52:13,540 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:52:13,542 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:52:13,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:13,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1449576961, now seen corresponding path program 1 times [2019-11-15 20:52:13,553 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:52:13,553 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098455608] [2019-11-15 20:52:13,553 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:13,553 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:13,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:52:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:13,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:52:13,731 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098455608] [2019-11-15 20:52:13,732 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:52:13,732 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:52:13,733 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330011476] [2019-11-15 20:52:13,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:52:13,738 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:52:13,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:52:13,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:52:13,756 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 3 states. [2019-11-15 20:52:14,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:52:14,029 INFO L93 Difference]: Finished difference Result 251 states and 426 transitions. [2019-11-15 20:52:14,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:52:14,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-15 20:52:14,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:52:14,044 INFO L225 Difference]: With dead ends: 251 [2019-11-15 20:52:14,044 INFO L226 Difference]: Without dead ends: 114 [2019-11-15 20:52:14,052 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:52:14,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-15 20:52:14,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-11-15 20:52:14,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-15 20:52:14,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 171 transitions. [2019-11-15 20:52:14,104 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 171 transitions. Word has length 23 [2019-11-15 20:52:14,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:52:14,104 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 171 transitions. [2019-11-15 20:52:14,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:52:14,105 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 171 transitions. [2019-11-15 20:52:14,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 20:52:14,107 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:52:14,107 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:52:14,107 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:52:14,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:14,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1395170557, now seen corresponding path program 1 times [2019-11-15 20:52:14,108 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:52:14,108 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509554952] [2019-11-15 20:52:14,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:14,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:14,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:52:14,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:14,211 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:52:14,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509554952] [2019-11-15 20:52:14,211 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:52:14,212 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:52:14,212 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265074929] [2019-11-15 20:52:14,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:52:14,214 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:52:14,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:52:14,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:52:14,215 INFO L87 Difference]: Start difference. First operand 114 states and 171 transitions. Second operand 3 states. [2019-11-15 20:52:14,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:52:14,432 INFO L93 Difference]: Finished difference Result 237 states and 359 transitions. [2019-11-15 20:52:14,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:52:14,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-15 20:52:14,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:52:14,436 INFO L225 Difference]: With dead ends: 237 [2019-11-15 20:52:14,436 INFO L226 Difference]: Without dead ends: 132 [2019-11-15 20:52:14,437 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:52:14,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-15 20:52:14,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2019-11-15 20:52:14,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-15 20:52:14,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 191 transitions. [2019-11-15 20:52:14,462 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 191 transitions. Word has length 36 [2019-11-15 20:52:14,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:52:14,463 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 191 transitions. [2019-11-15 20:52:14,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:52:14,463 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 191 transitions. [2019-11-15 20:52:14,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-15 20:52:14,465 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:52:14,466 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 20:52:14,466 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:52:14,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:14,466 INFO L82 PathProgramCache]: Analyzing trace with hash -462623258, now seen corresponding path program 1 times [2019-11-15 20:52:14,467 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:52:14,467 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277680299] [2019-11-15 20:52:14,467 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:14,467 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:14,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:52:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:14,611 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 20:52:14,611 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277680299] [2019-11-15 20:52:14,611 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:52:14,611 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:52:14,612 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18406719] [2019-11-15 20:52:14,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:52:14,612 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:52:14,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:52:14,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:52:14,613 INFO L87 Difference]: Start difference. First operand 129 states and 191 transitions. Second operand 3 states. [2019-11-15 20:52:14,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:52:14,806 INFO L93 Difference]: Finished difference Result 271 states and 407 transitions. [2019-11-15 20:52:14,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:52:14,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-15 20:52:14,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:52:14,810 INFO L225 Difference]: With dead ends: 271 [2019-11-15 20:52:14,811 INFO L226 Difference]: Without dead ends: 151 [2019-11-15 20:52:14,812 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:52:14,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-11-15 20:52:14,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 146. [2019-11-15 20:52:14,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 20:52:14,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 213 transitions. [2019-11-15 20:52:14,837 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 213 transitions. Word has length 50 [2019-11-15 20:52:14,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:52:14,839 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 213 transitions. [2019-11-15 20:52:14,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:52:14,839 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 213 transitions. [2019-11-15 20:52:14,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 20:52:14,848 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:52:14,849 INFO L380 BasicCegarLoop]: trace histogram [4, 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] [2019-11-15 20:52:14,849 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:52:14,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:14,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1174891697, now seen corresponding path program 1 times [2019-11-15 20:52:14,850 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:52:14,850 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377910510] [2019-11-15 20:52:14,851 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:14,851 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:14,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:52:14,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:15,022 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-15 20:52:15,022 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377910510] [2019-11-15 20:52:15,023 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:52:15,024 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:52:15,024 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658767830] [2019-11-15 20:52:15,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:52:15,026 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:52:15,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:52:15,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:52:15,027 INFO L87 Difference]: Start difference. First operand 146 states and 213 transitions. Second operand 3 states. [2019-11-15 20:52:15,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:52:15,298 INFO L93 Difference]: Finished difference Result 334 states and 502 transitions. [2019-11-15 20:52:15,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:52:15,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-15 20:52:15,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:52:15,301 INFO L225 Difference]: With dead ends: 334 [2019-11-15 20:52:15,302 INFO L226 Difference]: Without dead ends: 196 [2019-11-15 20:52:15,303 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:52:15,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-15 20:52:15,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 187. [2019-11-15 20:52:15,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-11-15 20:52:15,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 263 transitions. [2019-11-15 20:52:15,322 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 263 transitions. Word has length 67 [2019-11-15 20:52:15,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:52:15,323 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 263 transitions. [2019-11-15 20:52:15,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:52:15,323 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 263 transitions. [2019-11-15 20:52:15,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 20:52:15,324 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:52:15,325 INFO L380 BasicCegarLoop]: trace histogram [4, 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] [2019-11-15 20:52:15,325 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:52:15,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:15,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1314637265, now seen corresponding path program 1 times [2019-11-15 20:52:15,326 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:52:15,326 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079381388] [2019-11-15 20:52:15,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:15,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:15,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:52:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:15,422 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-15 20:52:15,423 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079381388] [2019-11-15 20:52:15,424 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:52:15,424 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:52:15,425 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707901648] [2019-11-15 20:52:15,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:52:15,426 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:52:15,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:52:15,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:52:15,427 INFO L87 Difference]: Start difference. First operand 187 states and 263 transitions. Second operand 3 states. [2019-11-15 20:52:15,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:52:15,623 INFO L93 Difference]: Finished difference Result 389 states and 554 transitions. [2019-11-15 20:52:15,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:52:15,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-15 20:52:15,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:52:15,626 INFO L225 Difference]: With dead ends: 389 [2019-11-15 20:52:15,627 INFO L226 Difference]: Without dead ends: 211 [2019-11-15 20:52:15,628 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:52:15,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-15 20:52:15,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2019-11-15 20:52:15,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-15 20:52:15,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 287 transitions. [2019-11-15 20:52:15,642 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 287 transitions. Word has length 67 [2019-11-15 20:52:15,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:52:15,643 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 287 transitions. [2019-11-15 20:52:15,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:52:15,643 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 287 transitions. [2019-11-15 20:52:15,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 20:52:15,644 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:52:15,644 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:52:15,645 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:52:15,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:15,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1231866158, now seen corresponding path program 1 times [2019-11-15 20:52:15,645 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:52:15,646 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292613419] [2019-11-15 20:52:15,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:15,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:15,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:52:15,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:15,712 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-15 20:52:15,712 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292613419] [2019-11-15 20:52:15,712 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:52:15,713 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:52:15,713 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964668427] [2019-11-15 20:52:15,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:52:15,713 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:52:15,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:52:15,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:52:15,714 INFO L87 Difference]: Start difference. First operand 206 states and 287 transitions. Second operand 3 states. [2019-11-15 20:52:15,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:52:15,883 INFO L93 Difference]: Finished difference Result 427 states and 603 transitions. [2019-11-15 20:52:15,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:52:15,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-15 20:52:15,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:52:15,886 INFO L225 Difference]: With dead ends: 427 [2019-11-15 20:52:15,886 INFO L226 Difference]: Without dead ends: 230 [2019-11-15 20:52:15,887 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:52:15,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-15 20:52:15,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2019-11-15 20:52:15,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-11-15 20:52:15,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 313 transitions. [2019-11-15 20:52:15,903 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 313 transitions. Word has length 84 [2019-11-15 20:52:15,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:52:15,904 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 313 transitions. [2019-11-15 20:52:15,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:52:15,904 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 313 transitions. [2019-11-15 20:52:15,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-15 20:52:15,906 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:52:15,906 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:52:15,906 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:52:15,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:15,907 INFO L82 PathProgramCache]: Analyzing trace with hash 266431114, now seen corresponding path program 1 times [2019-11-15 20:52:15,907 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:52:15,907 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941591889] [2019-11-15 20:52:15,907 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:15,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:15,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:52:15,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:15,991 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-15 20:52:15,991 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941591889] [2019-11-15 20:52:15,992 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:52:15,992 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:52:15,992 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32490189] [2019-11-15 20:52:15,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:52:15,993 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:52:15,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:52:15,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:52:15,994 INFO L87 Difference]: Start difference. First operand 227 states and 313 transitions. Second operand 3 states. [2019-11-15 20:52:16,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:52:16,051 INFO L93 Difference]: Finished difference Result 661 states and 912 transitions. [2019-11-15 20:52:16,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:52:16,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-15 20:52:16,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:52:16,056 INFO L225 Difference]: With dead ends: 661 [2019-11-15 20:52:16,056 INFO L226 Difference]: Without dead ends: 443 [2019-11-15 20:52:16,057 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:52:16,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-11-15 20:52:16,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2019-11-15 20:52:16,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-11-15 20:52:16,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 609 transitions. [2019-11-15 20:52:16,077 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 609 transitions. Word has length 104 [2019-11-15 20:52:16,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:52:16,078 INFO L462 AbstractCegarLoop]: Abstraction has 443 states and 609 transitions. [2019-11-15 20:52:16,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:52:16,079 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 609 transitions. [2019-11-15 20:52:16,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-15 20:52:16,081 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:52:16,081 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:52:16,081 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:52:16,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:16,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1706663820, now seen corresponding path program 1 times [2019-11-15 20:52:16,082 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:52:16,083 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195732725] [2019-11-15 20:52:16,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:16,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:16,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:52:16,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:16,207 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-15 20:52:16,208 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195732725] [2019-11-15 20:52:16,208 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:52:16,208 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:52:16,208 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606699791] [2019-11-15 20:52:16,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:52:16,209 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:52:16,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:52:16,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:52:16,210 INFO L87 Difference]: Start difference. First operand 443 states and 609 transitions. Second operand 3 states. [2019-11-15 20:52:16,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:52:16,261 INFO L93 Difference]: Finished difference Result 661 states and 909 transitions. [2019-11-15 20:52:16,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:52:16,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-15 20:52:16,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:52:16,267 INFO L225 Difference]: With dead ends: 661 [2019-11-15 20:52:16,267 INFO L226 Difference]: Without dead ends: 659 [2019-11-15 20:52:16,268 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:52:16,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-11-15 20:52:16,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2019-11-15 20:52:16,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-15 20:52:16,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 907 transitions. [2019-11-15 20:52:16,289 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 907 transitions. Word has length 106 [2019-11-15 20:52:16,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:52:16,290 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 907 transitions. [2019-11-15 20:52:16,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:52:16,290 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 907 transitions. [2019-11-15 20:52:16,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-15 20:52:16,292 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:52:16,293 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:52:16,293 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:52:16,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:16,293 INFO L82 PathProgramCache]: Analyzing trace with hash 589479754, now seen corresponding path program 1 times [2019-11-15 20:52:16,294 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:52:16,294 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099678823] [2019-11-15 20:52:16,294 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:16,294 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:16,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:52:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:16,354 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-15 20:52:16,355 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099678823] [2019-11-15 20:52:16,355 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:52:16,355 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:52:16,355 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863992572] [2019-11-15 20:52:16,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:52:16,356 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:52:16,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:52:16,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:52:16,356 INFO L87 Difference]: Start difference. First operand 659 states and 907 transitions. Second operand 3 states. [2019-11-15 20:52:16,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:52:16,548 INFO L93 Difference]: Finished difference Result 1462 states and 2068 transitions. [2019-11-15 20:52:16,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:52:16,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-11-15 20:52:16,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:52:16,555 INFO L225 Difference]: With dead ends: 1462 [2019-11-15 20:52:16,555 INFO L226 Difference]: Without dead ends: 809 [2019-11-15 20:52:16,556 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:52:16,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2019-11-15 20:52:16,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 776. [2019-11-15 20:52:16,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-11-15 20:52:16,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1096 transitions. [2019-11-15 20:52:16,582 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1096 transitions. Word has length 161 [2019-11-15 20:52:16,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:52:16,583 INFO L462 AbstractCegarLoop]: Abstraction has 776 states and 1096 transitions. [2019-11-15 20:52:16,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:52:16,583 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1096 transitions. [2019-11-15 20:52:16,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-15 20:52:16,587 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:52:16,587 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:52:16,587 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:52:16,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:16,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1596288335, now seen corresponding path program 1 times [2019-11-15 20:52:16,588 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:52:16,588 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851600774] [2019-11-15 20:52:16,589 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:16,589 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:16,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:52:16,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:16,660 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-11-15 20:52:16,661 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851600774] [2019-11-15 20:52:16,661 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:52:16,661 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:52:16,661 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760172369] [2019-11-15 20:52:16,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:52:16,662 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:52:16,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:52:16,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:52:16,663 INFO L87 Difference]: Start difference. First operand 776 states and 1096 transitions. Second operand 3 states. [2019-11-15 20:52:16,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:52:16,884 INFO L93 Difference]: Finished difference Result 1824 states and 2649 transitions. [2019-11-15 20:52:16,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:52:16,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-11-15 20:52:16,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:52:16,890 INFO L225 Difference]: With dead ends: 1824 [2019-11-15 20:52:16,890 INFO L226 Difference]: Without dead ends: 1006 [2019-11-15 20:52:16,892 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:52:16,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2019-11-15 20:52:16,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 965. [2019-11-15 20:52:16,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-11-15 20:52:16,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1348 transitions. [2019-11-15 20:52:16,920 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1348 transitions. Word has length 188 [2019-11-15 20:52:16,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:52:16,920 INFO L462 AbstractCegarLoop]: Abstraction has 965 states and 1348 transitions. [2019-11-15 20:52:16,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:52:16,920 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1348 transitions. [2019-11-15 20:52:16,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-11-15 20:52:16,924 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:52:16,924 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 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] [2019-11-15 20:52:16,924 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:52:16,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:16,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1275827432, now seen corresponding path program 1 times [2019-11-15 20:52:16,925 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:52:16,925 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103195901] [2019-11-15 20:52:16,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:16,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:16,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:52:16,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:16,990 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-11-15 20:52:16,991 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103195901] [2019-11-15 20:52:16,991 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:52:16,991 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:52:16,991 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669917157] [2019-11-15 20:52:16,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:52:16,992 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:52:16,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:52:16,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:52:16,993 INFO L87 Difference]: Start difference. First operand 965 states and 1348 transitions. Second operand 3 states. [2019-11-15 20:52:17,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:52:17,198 INFO L93 Difference]: Finished difference Result 2080 states and 2926 transitions. [2019-11-15 20:52:17,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:52:17,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-11-15 20:52:17,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:52:17,206 INFO L225 Difference]: With dead ends: 2080 [2019-11-15 20:52:17,206 INFO L226 Difference]: Without dead ends: 1079 [2019-11-15 20:52:17,208 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:52:17,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-11-15 20:52:17,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1040. [2019-11-15 20:52:17,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1040 states. [2019-11-15 20:52:17,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1444 transitions. [2019-11-15 20:52:17,240 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1444 transitions. Word has length 209 [2019-11-15 20:52:17,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:52:17,241 INFO L462 AbstractCegarLoop]: Abstraction has 1040 states and 1444 transitions. [2019-11-15 20:52:17,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:52:17,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1444 transitions. [2019-11-15 20:52:17,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-15 20:52:17,245 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:52:17,246 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:52:17,246 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:52:17,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:17,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1859847365, now seen corresponding path program 1 times [2019-11-15 20:52:17,247 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:52:17,247 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966961787] [2019-11-15 20:52:17,247 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:17,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:17,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:52:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:17,367 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-11-15 20:52:17,368 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966961787] [2019-11-15 20:52:17,368 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:52:17,368 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:52:17,369 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26785137] [2019-11-15 20:52:17,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:52:17,370 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:52:17,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:52:17,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:52:17,371 INFO L87 Difference]: Start difference. First operand 1040 states and 1444 transitions. Second operand 3 states. [2019-11-15 20:52:17,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:52:17,622 INFO L93 Difference]: Finished difference Result 2230 states and 3115 transitions. [2019-11-15 20:52:17,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:52:17,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-11-15 20:52:17,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:52:17,630 INFO L225 Difference]: With dead ends: 2230 [2019-11-15 20:52:17,630 INFO L226 Difference]: Without dead ends: 1160 [2019-11-15 20:52:17,632 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:52:17,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2019-11-15 20:52:17,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1124. [2019-11-15 20:52:17,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2019-11-15 20:52:17,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1555 transitions. [2019-11-15 20:52:17,666 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1555 transitions. Word has length 233 [2019-11-15 20:52:17,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:52:17,666 INFO L462 AbstractCegarLoop]: Abstraction has 1124 states and 1555 transitions. [2019-11-15 20:52:17,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:52:17,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1555 transitions. [2019-11-15 20:52:17,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-15 20:52:17,671 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:52:17,671 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:52:17,672 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:52:17,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:17,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1978288839, now seen corresponding path program 1 times [2019-11-15 20:52:17,672 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:52:17,673 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216205555] [2019-11-15 20:52:17,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:17,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:17,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:52:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:17,762 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-11-15 20:52:17,762 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216205555] [2019-11-15 20:52:17,762 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:52:17,762 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:52:17,763 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30847083] [2019-11-15 20:52:17,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:52:17,764 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:52:17,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:52:17,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:52:17,764 INFO L87 Difference]: Start difference. First operand 1124 states and 1555 transitions. Second operand 3 states. [2019-11-15 20:52:17,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:52:17,992 INFO L93 Difference]: Finished difference Result 2398 states and 3340 transitions. [2019-11-15 20:52:17,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:52:17,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-11-15 20:52:17,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:52:18,001 INFO L225 Difference]: With dead ends: 2398 [2019-11-15 20:52:18,002 INFO L226 Difference]: Without dead ends: 1256 [2019-11-15 20:52:18,004 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:52:18,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2019-11-15 20:52:18,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1217. [2019-11-15 20:52:18,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-11-15 20:52:18,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1687 transitions. [2019-11-15 20:52:18,038 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1687 transitions. Word has length 233 [2019-11-15 20:52:18,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:52:18,039 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 1687 transitions. [2019-11-15 20:52:18,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:52:18,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1687 transitions. [2019-11-15 20:52:18,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-11-15 20:52:18,043 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:52:18,044 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 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] [2019-11-15 20:52:18,044 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:52:18,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:18,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1116608197, now seen corresponding path program 1 times [2019-11-15 20:52:18,045 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:52:18,045 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141400815] [2019-11-15 20:52:18,045 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:18,045 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:18,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:52:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:18,137 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 622 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2019-11-15 20:52:18,138 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141400815] [2019-11-15 20:52:18,138 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:52:18,138 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:52:18,138 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79135235] [2019-11-15 20:52:18,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:52:18,139 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:52:18,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:52:18,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:52:18,140 INFO L87 Difference]: Start difference. First operand 1217 states and 1687 transitions. Second operand 3 states. [2019-11-15 20:52:18,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:52:18,185 INFO L93 Difference]: Finished difference Result 3630 states and 5032 transitions. [2019-11-15 20:52:18,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:52:18,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-11-15 20:52:18,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:52:18,198 INFO L225 Difference]: With dead ends: 3630 [2019-11-15 20:52:18,199 INFO L226 Difference]: Without dead ends: 2422 [2019-11-15 20:52:18,201 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:52:18,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2019-11-15 20:52:18,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2420. [2019-11-15 20:52:18,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2420 states. [2019-11-15 20:52:18,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2420 states and 3354 transitions. [2019-11-15 20:52:18,267 INFO L78 Accepts]: Start accepts. Automaton has 2420 states and 3354 transitions. Word has length 263 [2019-11-15 20:52:18,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:52:18,268 INFO L462 AbstractCegarLoop]: Abstraction has 2420 states and 3354 transitions. [2019-11-15 20:52:18,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:52:18,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 3354 transitions. [2019-11-15 20:52:18,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-11-15 20:52:18,275 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:52:18,275 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 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] [2019-11-15 20:52:18,275 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:52:18,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:18,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1235049671, now seen corresponding path program 1 times [2019-11-15 20:52:18,276 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:52:18,276 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213251144] [2019-11-15 20:52:18,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:18,277 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:18,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:52:18,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:18,374 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2019-11-15 20:52:18,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213251144] [2019-11-15 20:52:18,375 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:52:18,375 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:52:18,375 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951944716] [2019-11-15 20:52:18,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:52:18,376 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:52:18,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:52:18,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:52:18,377 INFO L87 Difference]: Start difference. First operand 2420 states and 3354 transitions. Second operand 3 states. [2019-11-15 20:52:18,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:52:18,629 INFO L93 Difference]: Finished difference Result 5143 states and 7169 transitions. [2019-11-15 20:52:18,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:52:18,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-11-15 20:52:18,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:52:18,645 INFO L225 Difference]: With dead ends: 5143 [2019-11-15 20:52:18,645 INFO L226 Difference]: Without dead ends: 2702 [2019-11-15 20:52:18,648 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:52:18,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-11-15 20:52:18,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 2630. [2019-11-15 20:52:18,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2630 states. [2019-11-15 20:52:18,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 3666 transitions. [2019-11-15 20:52:18,737 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 3666 transitions. Word has length 263 [2019-11-15 20:52:18,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:52:18,738 INFO L462 AbstractCegarLoop]: Abstraction has 2630 states and 3666 transitions. [2019-11-15 20:52:18,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:52:18,738 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 3666 transitions. [2019-11-15 20:52:18,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-11-15 20:52:18,746 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:52:18,747 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:52:18,747 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:52:18,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:18,747 INFO L82 PathProgramCache]: Analyzing trace with hash 2135776069, now seen corresponding path program 1 times [2019-11-15 20:52:18,748 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:52:18,748 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317947170] [2019-11-15 20:52:18,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:18,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:18,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:52:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:18,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1169 backedges. 629 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2019-11-15 20:52:18,928 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317947170] [2019-11-15 20:52:18,928 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:52:18,928 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:52:18,928 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796557571] [2019-11-15 20:52:18,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:52:18,929 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:52:18,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:52:18,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:52:18,930 INFO L87 Difference]: Start difference. First operand 2630 states and 3666 transitions. Second operand 3 states. [2019-11-15 20:52:19,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:52:19,164 INFO L93 Difference]: Finished difference Result 5335 states and 7421 transitions. [2019-11-15 20:52:19,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:52:19,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2019-11-15 20:52:19,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:52:19,179 INFO L225 Difference]: With dead ends: 5335 [2019-11-15 20:52:19,180 INFO L226 Difference]: Without dead ends: 2696 [2019-11-15 20:52:19,183 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:52:19,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2696 states. [2019-11-15 20:52:19,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2696 to 2624. [2019-11-15 20:52:19,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2624 states. [2019-11-15 20:52:19,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 3630 transitions. [2019-11-15 20:52:19,255 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 3630 transitions. Word has length 298 [2019-11-15 20:52:19,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:52:19,256 INFO L462 AbstractCegarLoop]: Abstraction has 2624 states and 3630 transitions. [2019-11-15 20:52:19,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:52:19,256 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 3630 transitions. [2019-11-15 20:52:19,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-11-15 20:52:19,263 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:52:19,264 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:52:19,264 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:52:19,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:19,264 INFO L82 PathProgramCache]: Analyzing trace with hash -901475869, now seen corresponding path program 1 times [2019-11-15 20:52:19,265 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:52:19,265 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341126085] [2019-11-15 20:52:19,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:19,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:19,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:52:19,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:19,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1175 backedges. 562 proven. 0 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-11-15 20:52:19,372 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341126085] [2019-11-15 20:52:19,372 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:52:19,373 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:52:19,373 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051520692] [2019-11-15 20:52:19,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:52:19,374 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:52:19,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:52:19,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:52:19,374 INFO L87 Difference]: Start difference. First operand 2624 states and 3630 transitions. Second operand 3 states. [2019-11-15 20:52:19,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:52:19,579 INFO L93 Difference]: Finished difference Result 5299 states and 7319 transitions. [2019-11-15 20:52:19,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:52:19,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2019-11-15 20:52:19,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:52:19,598 INFO L225 Difference]: With dead ends: 5299 [2019-11-15 20:52:19,599 INFO L226 Difference]: Without dead ends: 2684 [2019-11-15 20:52:19,602 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:52:19,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2019-11-15 20:52:19,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 2624. [2019-11-15 20:52:19,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2624 states. [2019-11-15 20:52:19,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 3576 transitions. [2019-11-15 20:52:19,691 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 3576 transitions. Word has length 307 [2019-11-15 20:52:19,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:52:19,692 INFO L462 AbstractCegarLoop]: Abstraction has 2624 states and 3576 transitions. [2019-11-15 20:52:19,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:52:19,692 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 3576 transitions. [2019-11-15 20:52:19,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-11-15 20:52:19,701 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:52:19,702 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 20:52:19,702 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:52:19,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:19,702 INFO L82 PathProgramCache]: Analyzing trace with hash 503398906, now seen corresponding path program 1 times [2019-11-15 20:52:19,703 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:52:19,703 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790172581] [2019-11-15 20:52:19,703 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:19,703 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:19,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:52:19,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:19,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 731 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-15 20:52:19,859 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790172581] [2019-11-15 20:52:19,860 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:52:19,860 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:52:19,860 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662504076] [2019-11-15 20:52:19,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:52:19,861 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:52:19,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:52:19,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:52:19,861 INFO L87 Difference]: Start difference. First operand 2624 states and 3576 transitions. Second operand 3 states. [2019-11-15 20:52:20,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:52:20,105 INFO L93 Difference]: Finished difference Result 5545 states and 7499 transitions. [2019-11-15 20:52:20,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:52:20,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-11-15 20:52:20,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:52:20,124 INFO L225 Difference]: With dead ends: 5545 [2019-11-15 20:52:20,125 INFO L226 Difference]: Without dead ends: 2930 [2019-11-15 20:52:20,129 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:52:20,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2019-11-15 20:52:20,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 2714. [2019-11-15 20:52:20,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2714 states. [2019-11-15 20:52:20,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2714 states and 3696 transitions. [2019-11-15 20:52:20,212 INFO L78 Accepts]: Start accepts. Automaton has 2714 states and 3696 transitions. Word has length 335 [2019-11-15 20:52:20,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:52:20,213 INFO L462 AbstractCegarLoop]: Abstraction has 2714 states and 3696 transitions. [2019-11-15 20:52:20,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:52:20,213 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 3696 transitions. [2019-11-15 20:52:20,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-11-15 20:52:20,221 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:52:20,221 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 20:52:20,221 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:52:20,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:20,222 INFO L82 PathProgramCache]: Analyzing trace with hash -121520003, now seen corresponding path program 1 times [2019-11-15 20:52:20,222 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:52:20,222 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957459387] [2019-11-15 20:52:20,222 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:20,222 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:20,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:52:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:20,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 871 proven. 0 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2019-11-15 20:52:20,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957459387] [2019-11-15 20:52:20,417 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:52:20,417 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:52:20,418 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580116193] [2019-11-15 20:52:20,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:52:20,419 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:52:20,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:52:20,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:52:20,420 INFO L87 Difference]: Start difference. First operand 2714 states and 3696 transitions. Second operand 3 states. [2019-11-15 20:52:20,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:52:20,514 INFO L93 Difference]: Finished difference Result 7734 states and 10582 transitions. [2019-11-15 20:52:20,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:52:20,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-11-15 20:52:20,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:52:20,566 INFO L225 Difference]: With dead ends: 7734 [2019-11-15 20:52:20,566 INFO L226 Difference]: Without dead ends: 5029 [2019-11-15 20:52:20,571 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:52:20,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5029 states. [2019-11-15 20:52:20,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5029 to 5027. [2019-11-15 20:52:20,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5027 states. [2019-11-15 20:52:20,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5027 states to 5027 states and 6880 transitions. [2019-11-15 20:52:20,732 INFO L78 Accepts]: Start accepts. Automaton has 5027 states and 6880 transitions. Word has length 336 [2019-11-15 20:52:20,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:52:20,733 INFO L462 AbstractCegarLoop]: Abstraction has 5027 states and 6880 transitions. [2019-11-15 20:52:20,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:52:20,733 INFO L276 IsEmpty]: Start isEmpty. Operand 5027 states and 6880 transitions. [2019-11-15 20:52:20,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-11-15 20:52:20,746 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:52:20,747 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-11-15 20:52:20,747 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:52:20,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:20,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1651416633, now seen corresponding path program 1 times [2019-11-15 20:52:20,748 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:52:20,748 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676412968] [2019-11-15 20:52:20,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:20,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:20,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:52:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:20,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 791 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-11-15 20:52:20,887 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676412968] [2019-11-15 20:52:20,887 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514681060] [2019-11-15 20:52:20,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0190fb54-3858-458d-acf1-eebc2a51a56b/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:52:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:21,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 20:52:21,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:52:21,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 791 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-11-15 20:52:21,351 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:52:21,352 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 20:52:21,353 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790042086] [2019-11-15 20:52:21,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:52:21,354 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:52:21,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:52:21,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:52:21,355 INFO L87 Difference]: Start difference. First operand 5027 states and 6880 transitions. Second operand 4 states. [2019-11-15 20:52:21,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:52:21,924 INFO L93 Difference]: Finished difference Result 9987 states and 13646 transitions. [2019-11-15 20:52:21,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:52:21,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 346 [2019-11-15 20:52:21,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:52:21,939 INFO L225 Difference]: With dead ends: 9987 [2019-11-15 20:52:21,939 INFO L226 Difference]: Without dead ends: 7540 [2019-11-15 20:52:21,945 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:52:21,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7540 states. [2019-11-15 20:52:22,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7540 to 5561. [2019-11-15 20:52:22,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5561 states. [2019-11-15 20:52:22,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5561 states to 5561 states and 7516 transitions. [2019-11-15 20:52:22,102 INFO L78 Accepts]: Start accepts. Automaton has 5561 states and 7516 transitions. Word has length 346 [2019-11-15 20:52:22,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:52:22,102 INFO L462 AbstractCegarLoop]: Abstraction has 5561 states and 7516 transitions. [2019-11-15 20:52:22,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:52:22,103 INFO L276 IsEmpty]: Start isEmpty. Operand 5561 states and 7516 transitions. [2019-11-15 20:52:22,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-11-15 20:52:22,115 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:52:22,116 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:52:22,321 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:52:22,322 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:52:22,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:22,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1397611342, now seen corresponding path program 1 times [2019-11-15 20:52:22,323 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:52:22,323 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927652633] [2019-11-15 20:52:22,323 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:22,323 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:22,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:52:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:22,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-15 20:52:22,511 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927652633] [2019-11-15 20:52:22,512 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745275605] [2019-11-15 20:52:22,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0190fb54-3858-458d-acf1-eebc2a51a56b/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:52:22,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:22,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 20:52:22,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:52:22,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-15 20:52:22,808 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:52:22,809 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 20:52:22,809 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385879383] [2019-11-15 20:52:22,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:52:22,811 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:52:22,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:52:22,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:52:22,812 INFO L87 Difference]: Start difference. First operand 5561 states and 7516 transitions. Second operand 4 states. [2019-11-15 20:52:23,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:52:23,317 INFO L93 Difference]: Finished difference Result 12544 states and 16972 transitions. [2019-11-15 20:52:23,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:52:23,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 373 [2019-11-15 20:52:23,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:52:23,331 INFO L225 Difference]: With dead ends: 12544 [2019-11-15 20:52:23,331 INFO L226 Difference]: Without dead ends: 6979 [2019-11-15 20:52:23,338 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:52:23,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6979 states. [2019-11-15 20:52:23,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6979 to 5709. [2019-11-15 20:52:23,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5709 states. [2019-11-15 20:52:23,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5709 states to 5709 states and 7634 transitions. [2019-11-15 20:52:23,490 INFO L78 Accepts]: Start accepts. Automaton has 5709 states and 7634 transitions. Word has length 373 [2019-11-15 20:52:23,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:52:23,491 INFO L462 AbstractCegarLoop]: Abstraction has 5709 states and 7634 transitions. [2019-11-15 20:52:23,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:52:23,491 INFO L276 IsEmpty]: Start isEmpty. Operand 5709 states and 7634 transitions. [2019-11-15 20:52:23,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-11-15 20:52:23,504 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:52:23,504 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:52:23,708 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:52:23,708 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:52:23,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:23,709 INFO L82 PathProgramCache]: Analyzing trace with hash -236946382, now seen corresponding path program 1 times [2019-11-15 20:52:23,709 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:52:23,709 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300337381] [2019-11-15 20:52:23,709 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:23,709 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:23,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:52:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:23,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-11-15 20:52:23,895 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300337381] [2019-11-15 20:52:23,896 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:52:23,896 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:52:23,896 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417390814] [2019-11-15 20:52:23,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:52:23,897 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:52:23,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:52:23,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:52:23,898 INFO L87 Difference]: Start difference. First operand 5709 states and 7634 transitions. Second operand 3 states. [2019-11-15 20:52:24,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:52:24,179 INFO L93 Difference]: Finished difference Result 11015 states and 14510 transitions. [2019-11-15 20:52:24,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:52:24,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 412 [2019-11-15 20:52:24,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:52:24,187 INFO L225 Difference]: With dead ends: 11015 [2019-11-15 20:52:24,188 INFO L226 Difference]: Without dead ends: 3069 [2019-11-15 20:52:24,198 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:52:24,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3069 states. [2019-11-15 20:52:24,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3069 to 2976. [2019-11-15 20:52:24,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2976 states. [2019-11-15 20:52:24,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 3983 transitions. [2019-11-15 20:52:24,282 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 3983 transitions. Word has length 412 [2019-11-15 20:52:24,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:52:24,283 INFO L462 AbstractCegarLoop]: Abstraction has 2976 states and 3983 transitions. [2019-11-15 20:52:24,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:52:24,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 3983 transitions. [2019-11-15 20:52:24,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2019-11-15 20:52:24,298 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:52:24,298 INFO L380 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:52:24,299 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:52:24,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:24,299 INFO L82 PathProgramCache]: Analyzing trace with hash -788979008, now seen corresponding path program 1 times [2019-11-15 20:52:24,299 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:52:24,300 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80720958] [2019-11-15 20:52:24,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:24,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:24,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:52:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:24,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1571 proven. 14 refuted. 0 times theorem prover too weak. 1126 trivial. 0 not checked. [2019-11-15 20:52:24,564 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80720958] [2019-11-15 20:52:24,565 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130987759] [2019-11-15 20:52:24,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0190fb54-3858-458d-acf1-eebc2a51a56b/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:52:24,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:24,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 20:52:24,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:52:25,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1018 proven. 0 refuted. 0 times theorem prover too weak. 1693 trivial. 0 not checked. [2019-11-15 20:52:25,260 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:52:25,260 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-15 20:52:25,260 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111513861] [2019-11-15 20:52:25,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:52:25,261 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:52:25,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:52:25,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:52:25,262 INFO L87 Difference]: Start difference. First operand 2976 states and 3983 transitions. Second operand 3 states. [2019-11-15 20:52:25,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:52:25,299 INFO L93 Difference]: Finished difference Result 3028 states and 4049 transitions. [2019-11-15 20:52:25,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:52:25,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 496 [2019-11-15 20:52:25,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:52:25,305 INFO L225 Difference]: With dead ends: 3028 [2019-11-15 20:52:25,305 INFO L226 Difference]: Without dead ends: 2531 [2019-11-15 20:52:25,306 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 496 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:52:25,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2531 states. [2019-11-15 20:52:25,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2531 to 2481. [2019-11-15 20:52:25,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2481 states. [2019-11-15 20:52:25,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 3319 transitions. [2019-11-15 20:52:25,365 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 3319 transitions. Word has length 496 [2019-11-15 20:52:25,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:52:25,366 INFO L462 AbstractCegarLoop]: Abstraction has 2481 states and 3319 transitions. [2019-11-15 20:52:25,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:52:25,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 3319 transitions. [2019-11-15 20:52:25,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2019-11-15 20:52:25,378 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:52:25,380 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 16, 16, 14, 14, 13, 13, 12, 12, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 20:52:25,584 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:52:25,584 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:52:25,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:25,585 INFO L82 PathProgramCache]: Analyzing trace with hash 866163585, now seen corresponding path program 1 times [2019-11-15 20:52:25,585 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:52:25,585 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343233325] [2019-11-15 20:52:25,586 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:25,586 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:25,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:52:25,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:25,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2607 backedges. 1546 proven. 14 refuted. 0 times theorem prover too weak. 1047 trivial. 0 not checked. [2019-11-15 20:52:25,839 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343233325] [2019-11-15 20:52:25,839 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615152462] [2019-11-15 20:52:25,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0190fb54-3858-458d-acf1-eebc2a51a56b/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:52:26,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:26,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:52:26,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:52:26,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2607 backedges. 268 proven. 0 refuted. 0 times theorem prover too weak. 2339 trivial. 0 not checked. [2019-11-15 20:52:26,250 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:52:26,250 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-15 20:52:26,251 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997250918] [2019-11-15 20:52:26,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:52:26,254 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:52:26,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:52:26,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:52:26,255 INFO L87 Difference]: Start difference. First operand 2481 states and 3319 transitions. Second operand 3 states. [2019-11-15 20:52:26,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:52:26,467 INFO L93 Difference]: Finished difference Result 5060 states and 6783 transitions. [2019-11-15 20:52:26,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:52:26,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 497 [2019-11-15 20:52:26,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:52:26,474 INFO L225 Difference]: With dead ends: 5060 [2019-11-15 20:52:26,474 INFO L226 Difference]: Without dead ends: 2589 [2019-11-15 20:52:26,478 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 497 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:52:26,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2589 states. [2019-11-15 20:52:26,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2589 to 2586. [2019-11-15 20:52:26,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2586 states. [2019-11-15 20:52:26,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2586 states to 2586 states and 3331 transitions. [2019-11-15 20:52:26,546 INFO L78 Accepts]: Start accepts. Automaton has 2586 states and 3331 transitions. Word has length 497 [2019-11-15 20:52:26,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:52:26,548 INFO L462 AbstractCegarLoop]: Abstraction has 2586 states and 3331 transitions. [2019-11-15 20:52:26,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:52:26,548 INFO L276 IsEmpty]: Start isEmpty. Operand 2586 states and 3331 transitions. [2019-11-15 20:52:26,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2019-11-15 20:52:26,568 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:52:26,569 INFO L380 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 19, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:52:26,773 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:52:26,773 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:52:26,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:52:26,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1604973917, now seen corresponding path program 2 times [2019-11-15 20:52:26,775 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:52:26,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5802802] [2019-11-15 20:52:26,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:26,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:52:26,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:52:26,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:52:27,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 2054 proven. 14 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-11-15 20:52:27,132 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5802802] [2019-11-15 20:52:27,134 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387877609] [2019-11-15 20:52:27,135 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0190fb54-3858-458d-acf1-eebc2a51a56b/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:52:27,338 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 20:52:27,338 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:52:27,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 964 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 20:52:27,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:52:27,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 2054 proven. 14 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-11-15 20:52:27,659 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:52:27,660 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 20:52:27,660 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766459986] [2019-11-15 20:52:27,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:52:27,662 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:52:27,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:52:27,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:52:27,663 INFO L87 Difference]: Start difference. First operand 2586 states and 3331 transitions. Second operand 4 states. [2019-11-15 20:52:27,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:52:27,923 INFO L93 Difference]: Finished difference Result 2848 states and 3664 transitions. [2019-11-15 20:52:27,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:52:27,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 608 [2019-11-15 20:52:27,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:52:27,925 INFO L225 Difference]: With dead ends: 2848 [2019-11-15 20:52:27,925 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 20:52:27,928 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 613 GetRequests, 610 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:52:27,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 20:52:27,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 20:52:27,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 20:52:27,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 20:52:27,929 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 608 [2019-11-15 20:52:27,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:52:27,930 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:52:27,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:52:27,930 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:52:27,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 20:52:28,135 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:52:28,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 20:52:28,652 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 253 DAG size of output: 111 [2019-11-15 20:52:29,872 WARN L191 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2019-11-15 20:52:30,004 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 20 [2019-11-15 20:52:30,156 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 7 [2019-11-15 20:52:30,387 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 22 [2019-11-15 20:52:30,457 INFO L439 ceAbstractionStarter]: At program point L201(lines 197 514) the Hoare annotation is: (let ((.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and (not .cse2) .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)))) [2019-11-15 20:52:30,457 INFO L439 ceAbstractionStarter]: At program point L135(lines 131 536) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-15 20:52:30,457 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 104) no Hoare annotation was computed. [2019-11-15 20:52:30,457 INFO L443 ceAbstractionStarter]: For program point L235(lines 235 251) no Hoare annotation was computed. [2019-11-15 20:52:30,457 INFO L443 ceAbstractionStarter]: For program point L235-2(lines 210 508) no Hoare annotation was computed. [2019-11-15 20:52:30,457 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 479) no Hoare annotation was computed. [2019-11-15 20:52:30,457 INFO L443 ceAbstractionStarter]: For program point L434(lines 434 448) no Hoare annotation was computed. [2019-11-15 20:52:30,457 INFO L443 ceAbstractionStarter]: For program point L434-1(lines 434 448) no Hoare annotation was computed. [2019-11-15 20:52:30,458 INFO L443 ceAbstractionStarter]: For program point L467-2(lines 467 479) no Hoare annotation was computed. [2019-11-15 20:52:30,458 INFO L443 ceAbstractionStarter]: For program point L335(lines 335 338) no Hoare annotation was computed. [2019-11-15 20:52:30,458 INFO L443 ceAbstractionStarter]: For program point L269(lines 269 271) no Hoare annotation was computed. [2019-11-15 20:52:30,458 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 512) no Hoare annotation was computed. [2019-11-15 20:52:30,458 INFO L443 ceAbstractionStarter]: For program point L269-2(lines 210 508) no Hoare annotation was computed. [2019-11-15 20:52:30,458 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 523) no Hoare annotation was computed. [2019-11-15 20:52:30,458 INFO L443 ceAbstractionStarter]: For program point L137(lines 137 534) no Hoare annotation was computed. [2019-11-15 20:52:30,458 INFO L443 ceAbstractionStarter]: For program point L501(lines 501 503) no Hoare annotation was computed. [2019-11-15 20:52:30,460 INFO L439 ceAbstractionStarter]: At program point L204(lines 203 512) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse2 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse0 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (not .cse0) .cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse2) (and .cse1 .cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)))) [2019-11-15 20:52:30,461 INFO L439 ceAbstractionStarter]: At program point L171(lines 161 526) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4480) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-15 20:52:30,461 INFO L443 ceAbstractionStarter]: For program point L568(lines 568 570) no Hoare annotation was computed. [2019-11-15 20:52:30,461 INFO L443 ceAbstractionStarter]: For program point L568-2(lines 568 570) no Hoare annotation was computed. [2019-11-15 20:52:30,461 INFO L443 ceAbstractionStarter]: For program point L370(lines 370 372) no Hoare annotation was computed. [2019-11-15 20:52:30,462 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 406) no Hoare annotation was computed. [2019-11-15 20:52:30,463 INFO L443 ceAbstractionStarter]: For program point L206(lines 206 511) no Hoare annotation was computed. [2019-11-15 20:52:30,463 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 522) no Hoare annotation was computed. [2019-11-15 20:52:30,463 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 533) no Hoare annotation was computed. [2019-11-15 20:52:30,464 INFO L443 ceAbstractionStarter]: For program point L107-1(lines 84 574) no Hoare annotation was computed. [2019-11-15 20:52:30,464 INFO L443 ceAbstractionStarter]: For program point L438(lines 438 444) no Hoare annotation was computed. [2019-11-15 20:52:30,464 INFO L446 ceAbstractionStarter]: At program point L207(lines 206 511) the Hoare annotation is: true [2019-11-15 20:52:30,465 INFO L439 ceAbstractionStarter]: At program point L141(lines 137 534) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)))) [2019-11-15 20:52:30,465 INFO L443 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-11-15 20:52:30,465 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 244) no Hoare annotation was computed. [2019-11-15 20:52:30,465 INFO L443 ceAbstractionStarter]: For program point L473(lines 473 476) no Hoare annotation was computed. [2019-11-15 20:52:30,465 INFO L446 ceAbstractionStarter]: At program point L209(lines 208 511) the Hoare annotation is: true [2019-11-15 20:52:30,465 INFO L443 ceAbstractionStarter]: For program point L176(lines 176 521) no Hoare annotation was computed. [2019-11-15 20:52:30,466 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 532) no Hoare annotation was computed. [2019-11-15 20:52:30,466 INFO L443 ceAbstractionStarter]: For program point L110(lines 110 543) no Hoare annotation was computed. [2019-11-15 20:52:30,466 INFO L446 ceAbstractionStarter]: At program point L573(lines 10 575) the Hoare annotation is: true [2019-11-15 20:52:30,466 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 319) no Hoare annotation was computed. [2019-11-15 20:52:30,467 INFO L443 ceAbstractionStarter]: For program point L309-2(lines 309 319) no Hoare annotation was computed. [2019-11-15 20:52:30,467 INFO L439 ceAbstractionStarter]: At program point L177(lines 173 522) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-15 20:52:30,467 INFO L439 ceAbstractionStarter]: At program point L111(lines 110 543) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (= 12292 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-15 20:52:30,468 INFO L443 ceAbstractionStarter]: For program point L343(lines 343 345) no Hoare annotation was computed. [2019-11-15 20:52:30,469 INFO L439 ceAbstractionStarter]: At program point L509(lines 107 562) the Hoare annotation is: (let ((.cse4 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (let ((.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse2 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse6 (not .cse4)) (.cse12 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse10 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse11 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse3 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse9 (= 4400 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse8 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse7 (<= ULTIMATE.start_ssl3_connect_~s__state~0 3)) (.cse5 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560))) (or (and .cse0 (= 4368 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse2) (and .cse0 .cse7 .cse4) (and .cse8 .cse4 .cse5 .cse9) (and .cse6 .cse10 .cse11 .cse0) (and .cse12 .cse8 .cse4 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (and (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) .cse12 .cse0) (and .cse10 .cse11 .cse3 .cse4 .cse5) (and (= ULTIMATE.start_ssl3_connect_~s__state~0 4384) .cse0) (and .cse0 .cse4 .cse9) (and (= 4416 ULTIMATE.start_ssl3_connect_~s__state~0) .cse8 .cse4) (and .cse7 .cse5)))) [2019-11-15 20:52:30,469 INFO L443 ceAbstractionStarter]: For program point L410(lines 410 414) no Hoare annotation was computed. [2019-11-15 20:52:30,469 INFO L439 ceAbstractionStarter]: At program point L344(lines 84 574) the Hoare annotation is: false [2019-11-15 20:52:30,469 INFO L443 ceAbstractionStarter]: For program point L410-2(lines 210 508) no Hoare annotation was computed. [2019-11-15 20:52:30,470 INFO L443 ceAbstractionStarter]: For program point L179(lines 179 520) no Hoare annotation was computed. [2019-11-15 20:52:30,470 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 531) no Hoare annotation was computed. [2019-11-15 20:52:30,470 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 542) no Hoare annotation was computed. [2019-11-15 20:52:30,471 INFO L443 ceAbstractionStarter]: For program point L246(lines 246 249) no Hoare annotation was computed. [2019-11-15 20:52:30,471 INFO L439 ceAbstractionStarter]: At program point L147(lines 143 532) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) [2019-11-15 20:52:30,471 INFO L443 ceAbstractionStarter]: For program point L544(lines 544 560) no Hoare annotation was computed. [2019-11-15 20:52:30,471 INFO L443 ceAbstractionStarter]: For program point L379(lines 379 381) no Hoare annotation was computed. [2019-11-15 20:52:30,471 INFO L443 ceAbstractionStarter]: For program point L346(lines 346 348) no Hoare annotation was computed. [2019-11-15 20:52:30,472 INFO L443 ceAbstractionStarter]: For program point L313(lines 313 315) no Hoare annotation was computed. [2019-11-15 20:52:30,472 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 282) no Hoare annotation was computed. [2019-11-15 20:52:30,472 INFO L443 ceAbstractionStarter]: For program point L313-2(lines 311 319) no Hoare annotation was computed. [2019-11-15 20:52:30,472 INFO L443 ceAbstractionStarter]: For program point L545(lines 545 559) no Hoare annotation was computed. [2019-11-15 20:52:30,472 INFO L439 ceAbstractionStarter]: At program point L215(lines 113 542) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) [2019-11-15 20:52:30,472 INFO L443 ceAbstractionStarter]: For program point L182(lines 182 519) no Hoare annotation was computed. [2019-11-15 20:52:30,473 INFO L443 ceAbstractionStarter]: For program point L149(lines 149 530) no Hoare annotation was computed. [2019-11-15 20:52:30,473 INFO L443 ceAbstractionStarter]: For program point L116(lines 116 541) no Hoare annotation was computed. [2019-11-15 20:52:30,473 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 551) no Hoare annotation was computed. [2019-11-15 20:52:30,473 INFO L443 ceAbstractionStarter]: For program point L546-2(lines 545 559) no Hoare annotation was computed. [2019-11-15 20:52:30,473 INFO L439 ceAbstractionStarter]: At program point L183(lines 179 520) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-15 20:52:30,474 INFO L443 ceAbstractionStarter]: For program point L548(lines 548 550) no Hoare annotation was computed. [2019-11-15 20:52:30,475 INFO L443 ceAbstractionStarter]: For program point L383(lines 383 388) no Hoare annotation was computed. [2019-11-15 20:52:30,476 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 20:52:30,476 INFO L443 ceAbstractionStarter]: For program point L383-2(lines 383 388) no Hoare annotation was computed. [2019-11-15 20:52:30,476 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 518) no Hoare annotation was computed. [2019-11-15 20:52:30,476 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 529) no Hoare annotation was computed. [2019-11-15 20:52:30,476 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 540) no Hoare annotation was computed. [2019-11-15 20:52:30,477 INFO L439 ceAbstractionStarter]: At program point L153(lines 149 530) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4448) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-15 20:52:30,477 INFO L443 ceAbstractionStarter]: For program point L484-1(lines 484 486) no Hoare annotation was computed. [2019-11-15 20:52:30,477 INFO L443 ceAbstractionStarter]: For program point L220(lines 220 222) no Hoare annotation was computed. [2019-11-15 20:52:30,477 INFO L443 ceAbstractionStarter]: For program point L220-2(lines 220 222) no Hoare annotation was computed. [2019-11-15 20:52:30,477 INFO L446 ceAbstractionStarter]: At program point L584(lines 576 586) the Hoare annotation is: true [2019-11-15 20:52:30,477 INFO L443 ceAbstractionStarter]: For program point L419(lines 419 422) no Hoare annotation was computed. [2019-11-15 20:52:30,478 INFO L443 ceAbstractionStarter]: For program point L188(lines 188 517) no Hoare annotation was computed. [2019-11-15 20:52:30,478 INFO L443 ceAbstractionStarter]: For program point L155(lines 155 528) no Hoare annotation was computed. [2019-11-15 20:52:30,478 INFO L443 ceAbstractionStarter]: For program point L122(lines 122 539) no Hoare annotation was computed. [2019-11-15 20:52:30,478 INFO L443 ceAbstractionStarter]: For program point L288(lines 288 294) no Hoare annotation was computed. [2019-11-15 20:52:30,478 INFO L439 ceAbstractionStarter]: At program point L189(lines 185 518) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (and (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2))))) [2019-11-15 20:52:30,478 INFO L443 ceAbstractionStarter]: For program point L553(lines 553 557) no Hoare annotation was computed. [2019-11-15 20:52:30,479 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 456) no Hoare annotation was computed. [2019-11-15 20:52:30,479 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 357) no Hoare annotation was computed. [2019-11-15 20:52:30,479 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 20:52:30,480 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 260) no Hoare annotation was computed. [2019-11-15 20:52:30,480 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 516) no Hoare annotation was computed. [2019-11-15 20:52:30,480 INFO L443 ceAbstractionStarter]: For program point L158(lines 158 527) no Hoare annotation was computed. [2019-11-15 20:52:30,480 INFO L443 ceAbstractionStarter]: For program point L125(lines 125 538) no Hoare annotation was computed. [2019-11-15 20:52:30,480 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 293) no Hoare annotation was computed. [2019-11-15 20:52:30,481 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 228) no Hoare annotation was computed. [2019-11-15 20:52:30,481 INFO L443 ceAbstractionStarter]: For program point L291-2(lines 210 508) no Hoare annotation was computed. [2019-11-15 20:52:30,481 INFO L439 ceAbstractionStarter]: At program point L159(lines 155 528) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4464) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-15 20:52:30,481 INFO L443 ceAbstractionStarter]: For program point L93(lines 93 99) no Hoare annotation was computed. [2019-11-15 20:52:30,481 INFO L443 ceAbstractionStarter]: For program point L490(lines 490 492) no Hoare annotation was computed. [2019-11-15 20:52:30,482 INFO L443 ceAbstractionStarter]: For program point L457(lines 457 461) no Hoare annotation was computed. [2019-11-15 20:52:30,482 INFO L443 ceAbstractionStarter]: For program point L490-2(lines 490 492) no Hoare annotation was computed. [2019-11-15 20:52:30,482 INFO L443 ceAbstractionStarter]: For program point L457-2(lines 457 461) no Hoare annotation was computed. [2019-11-15 20:52:30,482 INFO L443 ceAbstractionStarter]: For program point L358(lines 358 362) no Hoare annotation was computed. [2019-11-15 20:52:30,482 INFO L443 ceAbstractionStarter]: For program point L358-2(lines 358 362) no Hoare annotation was computed. [2019-11-15 20:52:30,482 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 20:52:30,483 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 515) no Hoare annotation was computed. [2019-11-15 20:52:30,483 INFO L443 ceAbstractionStarter]: For program point L161(lines 161 526) no Hoare annotation was computed. [2019-11-15 20:52:30,483 INFO L443 ceAbstractionStarter]: For program point L128(lines 128 537) no Hoare annotation was computed. [2019-11-15 20:52:30,483 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 572) no Hoare annotation was computed. [2019-11-15 20:52:30,483 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 329) no Hoare annotation was computed. [2019-11-15 20:52:30,483 INFO L443 ceAbstractionStarter]: For program point L327-2(lines 210 508) no Hoare annotation was computed. [2019-11-15 20:52:30,484 INFO L439 ceAbstractionStarter]: At program point L195(lines 191 516) the Hoare annotation is: (let ((.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse2 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560))) (or (and (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2) (and (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 .cse2) .cse0))) [2019-11-15 20:52:30,484 INFO L439 ceAbstractionStarter]: At program point L129(lines 125 538) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-15 20:52:30,484 INFO L443 ceAbstractionStarter]: For program point L96(lines 96 98) no Hoare annotation was computed. [2019-11-15 20:52:30,484 INFO L443 ceAbstractionStarter]: For program point L96-2(lines 93 99) no Hoare annotation was computed. [2019-11-15 20:52:30,485 INFO L443 ceAbstractionStarter]: For program point L427(lines 427 429) no Hoare annotation was computed. [2019-11-15 20:52:30,485 INFO L443 ceAbstractionStarter]: For program point L394(lines 394 396) no Hoare annotation was computed. [2019-11-15 20:52:30,485 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 514) no Hoare annotation was computed. [2019-11-15 20:52:30,485 INFO L443 ceAbstractionStarter]: For program point L164(lines 164 525) no Hoare annotation was computed. [2019-11-15 20:52:30,485 INFO L443 ceAbstractionStarter]: For program point L131(lines 131 536) no Hoare annotation was computed. [2019-11-15 20:52:30,485 INFO L443 ceAbstractionStarter]: For program point L496(lines 496 498) no Hoare annotation was computed. [2019-11-15 20:52:30,486 INFO L443 ceAbstractionStarter]: For program point L496-2(lines 496 498) no Hoare annotation was computed. [2019-11-15 20:52:30,486 INFO L443 ceAbstractionStarter]: For program point L298(lines 298 302) no Hoare annotation was computed. [2019-11-15 20:52:30,486 INFO L443 ceAbstractionStarter]: For program point L298-2(lines 298 302) no Hoare annotation was computed. [2019-11-15 20:52:30,486 INFO L446 ceAbstractionStarter]: At program point L563(lines 106 564) the Hoare annotation is: true [2019-11-15 20:52:30,486 INFO L443 ceAbstractionStarter]: For program point L200(lines 200 513) no Hoare annotation was computed. [2019-11-15 20:52:30,486 INFO L443 ceAbstractionStarter]: For program point L167(lines 167 524) no Hoare annotation was computed. [2019-11-15 20:52:30,487 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 535) no Hoare annotation was computed. [2019-11-15 20:52:30,487 INFO L443 ceAbstractionStarter]: For program point L101(lines 101 105) no Hoare annotation was computed. [2019-11-15 20:52:30,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:52:30 BoogieIcfgContainer [2019-11-15 20:52:30,527 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:52:30,528 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:52:30,528 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:52:30,528 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:52:30,529 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:52:13" (3/4) ... [2019-11-15 20:52:30,536 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 20:52:30,564 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 20:52:30,565 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 20:52:30,721 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0190fb54-3858-458d-acf1-eebc2a51a56b/bin/uautomizer/witness.graphml [2019-11-15 20:52:30,721 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:52:30,723 INFO L168 Benchmark]: Toolchain (without parser) took 18863.97 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 982.0 MB). Free memory was 942.0 MB in the beginning and 1.6 GB in the end (delta: -638.1 MB). Peak memory consumption was 343.9 MB. Max. memory is 11.5 GB. [2019-11-15 20:52:30,723 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:52:30,724 INFO L168 Benchmark]: CACSL2BoogieTranslator took 542.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -195.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:52:30,724 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.33 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2019-11-15 20:52:30,724 INFO L168 Benchmark]: Boogie Preprocessor took 43.43 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.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. [2019-11-15 20:52:30,725 INFO L168 Benchmark]: RCFGBuilder took 945.26 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: 62.1 MB). Peak memory consumption was 62.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:52:30,725 INFO L168 Benchmark]: TraceAbstraction took 17062.72 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 835.2 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -543.5 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-11-15 20:52:30,725 INFO L168 Benchmark]: Witness Printer took 193.92 ms. Allocated memory is still 2.0 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:52:30,729 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.32 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 542.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -195.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.33 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.43 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.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 945.26 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: 62.1 MB). Peak memory consumption was 62.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17062.72 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 835.2 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -543.5 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 193.92 ms. Allocated memory is still 2.0 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 572]: 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: 110]: Loop Invariant Derived loop invariant: blastFlag <= 2 && 12292 == s__state - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: ((s__state <= 4512 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state) || (4512 <= s__state && s__state <= 4528 && blastFlag <= 2) - InvariantResult [Line: 143]: Loop Invariant Derived loop invariant: ((blastFlag <= 4 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: ((((4560 <= s__state && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) || (((!(0 == s__hit) && 4560 <= s__state) && s__state <= 4560) && blastFlag <= 2) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: ((s__state <= 4464 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: ((s__state <= 4480 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: ((((((((((((blastFlag <= 2 && 4368 == s__state) || ((((s__state <= 4352 && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((((blastFlag <= 2 && !(0 == s__hit)) && s__state <= 4352) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state)) || ((blastFlag <= 2 && s__state <= 3) && 0 == s__hit)) || (((blastFlag <= 4 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4400 == s__state)) || (((!(0 == s__hit) && 4560 <= s__state) && s__state <= 4560) && blastFlag <= 2)) || (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state)) || ((4512 <= s__state && s__state <= 4528) && blastFlag <= 2)) || ((((4560 <= s__state && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || (s__state == 4384 && blastFlag <= 2)) || ((blastFlag <= 2 && 0 == s__hit) && 4400 == s__state)) || ((4416 == s__state && blastFlag <= 4) && 0 == s__hit)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((blastFlag <= 2 && !(0 == s__hit)) && s__state <= 4352) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state) || ((((s__state <= 4352 && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: s__state <= 4560 && blastFlag <= 2 - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((s__state <= 4512 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit) || ((((blastFlag <= 4 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: (((4512 <= s__state && s__state <= 4560) && blastFlag <= 2) || (((s__state <= 4560 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4432 <= s__state)) || (((blastFlag <= 4 && 0 == s__hit) && 4432 <= s__state) && s__state <= 4560) - InvariantResult [Line: 149]: Loop Invariant Derived loop invariant: ((blastFlag <= 4 && s__state <= 4448) && 0 == s__hit) && 4432 <= s__state - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 127 locations, 1 error locations. Result: SAFE, OverallTime: 16.9s, OverallIterations: 25, TraceHistogramMax: 21, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.3s, HoareTripleCheckerStatistics: 4490 SDtfs, 2114 SDslu, 2318 SDs, 0 SdLazy, 2460 SolverSat, 611 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2400 GetRequests, 2365 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5709occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 25 MinimizatonAttempts, 4032 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 155 NumberOfFragments, 427 HoareAnnotationTreeSize, 22 FomulaSimplifications, 29279 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 22 FomulaSimplificationsInter, 24849 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 8415 NumberOfCodeBlocks, 8415 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 8385 ConstructedInterpolants, 0 QuantifiedInterpolants, 4385301 SizeOfPredicates, 7 NumberOfNonLiveVariables, 3916 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 30 InterpolantComputations, 22 PerfectInterpolantSequences, 37271/37361 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...