./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 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8d1a33dc-5ece-44b9-b92e-11ca29380d6e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8d1a33dc-5ece-44b9-b92e-11ca29380d6e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8d1a33dc-5ece-44b9-b92e-11ca29380d6e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8d1a33dc-5ece-44b9-b92e-11ca29380d6e/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_8d1a33dc-5ece-44b9-b92e-11ca29380d6e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8d1a33dc-5ece-44b9-b92e-11ca29380d6e/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-6b5699a [2019-11-25 08:53:29,211 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:53:29,212 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:53:29,226 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:53:29,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:53:29,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:53:29,230 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:53:29,238 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:53:29,243 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:53:29,247 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:53:29,248 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:53:29,249 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:53:29,249 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:53:29,251 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:53:29,253 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:53:29,253 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:53:29,254 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:53:29,255 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:53:29,257 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:53:29,261 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:53:29,265 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:53:29,268 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:53:29,269 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:53:29,270 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:53:29,272 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:53:29,272 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:53:29,272 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:53:29,273 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:53:29,274 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:53:29,275 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:53:29,275 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:53:29,275 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:53:29,276 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:53:29,277 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:53:29,278 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:53:29,278 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:53:29,278 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:53:29,279 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:53:29,279 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:53:29,279 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:53:29,281 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:53:29,281 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8d1a33dc-5ece-44b9-b92e-11ca29380d6e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:53:29,305 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:53:29,305 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:53:29,306 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:53:29,307 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:53:29,307 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:53:29,307 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:53:29,307 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:53:29,307 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:53:29,308 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:53:29,308 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:53:29,308 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:53:29,308 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:53:29,308 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:53:29,308 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:53:29,309 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:53:29,309 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:53:29,309 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:53:29,309 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:53:29,309 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:53:29,310 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:53:29,310 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:53:29,310 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:53:29,310 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:53:29,310 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:53:29,311 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:53:29,311 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:53:29,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:53:29,311 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:53:29,311 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_8d1a33dc-5ece-44b9-b92e-11ca29380d6e/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-25 08:53:29,472 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:53:29,485 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:53:29,487 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:53:29,488 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:53:29,488 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:53:29,489 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8d1a33dc-5ece-44b9-b92e-11ca29380d6e/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-3.c [2019-11-25 08:53:29,540 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8d1a33dc-5ece-44b9-b92e-11ca29380d6e/bin/uautomizer/data/b67e683a6/b02adaaa742d4a75819956e10aa3100a/FLAG375d690de [2019-11-25 08:53:30,021 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:53:30,022 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8d1a33dc-5ece-44b9-b92e-11ca29380d6e/sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-3.c [2019-11-25 08:53:30,032 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8d1a33dc-5ece-44b9-b92e-11ca29380d6e/bin/uautomizer/data/b67e683a6/b02adaaa742d4a75819956e10aa3100a/FLAG375d690de [2019-11-25 08:53:30,511 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8d1a33dc-5ece-44b9-b92e-11ca29380d6e/bin/uautomizer/data/b67e683a6/b02adaaa742d4a75819956e10aa3100a [2019-11-25 08:53:30,514 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:53:30,515 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:53:30,516 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:53:30,516 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:53:30,519 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:53:30,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:53:30" (1/1) ... [2019-11-25 08:53:30,523 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cec2673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:30, skipping insertion in model container [2019-11-25 08:53:30,523 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:53:30" (1/1) ... [2019-11-25 08:53:30,534 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:53:30,581 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:53:30,870 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:53:30,874 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:53:30,929 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:53:30,957 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:53:30,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:30 WrapperNode [2019-11-25 08:53:30,958 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:53:30,959 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:53:30,959 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:53:30,960 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:53:30,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:30" (1/1) ... [2019-11-25 08:53:30,977 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:30" (1/1) ... [2019-11-25 08:53:31,014 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:53:31,014 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:53:31,014 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:53:31,014 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:53:31,022 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:30" (1/1) ... [2019-11-25 08:53:31,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:30" (1/1) ... [2019-11-25 08:53:31,025 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:30" (1/1) ... [2019-11-25 08:53:31,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:30" (1/1) ... [2019-11-25 08:53:31,034 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:30" (1/1) ... [2019-11-25 08:53:31,042 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:30" (1/1) ... [2019-11-25 08:53:31,045 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:30" (1/1) ... [2019-11-25 08:53:31,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:53:31,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:53:31,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:53:31,050 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:53:31,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d1a33dc-5ece-44b9-b92e-11ca29380d6e/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-25 08:53:31,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:53:31,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:53:31,252 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 08:53:31,773 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-25 08:53:31,773 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-25 08:53:31,775 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:53:31,775 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-25 08:53:31,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:53:31 BoogieIcfgContainer [2019-11-25 08:53:31,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:53:31,777 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:53:31,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:53:31,779 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:53:31,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:53:30" (1/3) ... [2019-11-25 08:53:31,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66fa4343 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:53:31, skipping insertion in model container [2019-11-25 08:53:31,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:30" (2/3) ... [2019-11-25 08:53:31,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66fa4343 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:53:31, skipping insertion in model container [2019-11-25 08:53:31,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:53:31" (3/3) ... [2019-11-25 08:53:31,782 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.cil-3.c [2019-11-25 08:53:31,790 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:53:31,796 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:53:31,803 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:53:31,822 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:53:31,823 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:53:31,823 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:53:31,823 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:53:31,823 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:53:31,823 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:53:31,823 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:53:31,823 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:53:31,840 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2019-11-25 08:53:31,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-25 08:53:31,847 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:31,847 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:31,848 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:31,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:31,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1449576961, now seen corresponding path program 1 times [2019-11-25 08:53:31,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:31,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231713733] [2019-11-25 08:53:31,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:31,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:32,039 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-25 08:53:32,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231713733] [2019-11-25 08:53:32,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:32,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:53:32,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246026845] [2019-11-25 08:53:32,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:53:32,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:32,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:53:32,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:32,064 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 3 states. [2019-11-25 08:53:32,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:32,288 INFO L93 Difference]: Finished difference Result 251 states and 426 transitions. [2019-11-25 08:53:32,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:53:32,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-25 08:53:32,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:32,300 INFO L225 Difference]: With dead ends: 251 [2019-11-25 08:53:32,300 INFO L226 Difference]: Without dead ends: 114 [2019-11-25 08:53:32,303 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:32,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-25 08:53:32,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-11-25 08:53:32,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-25 08:53:32,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 171 transitions. [2019-11-25 08:53:32,343 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 171 transitions. Word has length 23 [2019-11-25 08:53:32,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:32,343 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 171 transitions. [2019-11-25 08:53:32,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:53:32,344 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 171 transitions. [2019-11-25 08:53:32,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-25 08:53:32,345 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:32,345 INFO L410 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-25 08:53:32,346 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:32,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:32,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1395170557, now seen corresponding path program 1 times [2019-11-25 08:53:32,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:32,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94169992] [2019-11-25 08:53:32,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:32,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:32,428 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-25 08:53:32,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94169992] [2019-11-25 08:53:32,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:32,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:53:32,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050869789] [2019-11-25 08:53:32,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:53:32,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:32,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:53:32,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:32,431 INFO L87 Difference]: Start difference. First operand 114 states and 171 transitions. Second operand 3 states. [2019-11-25 08:53:32,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:32,616 INFO L93 Difference]: Finished difference Result 237 states and 359 transitions. [2019-11-25 08:53:32,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:53:32,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-25 08:53:32,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:32,619 INFO L225 Difference]: With dead ends: 237 [2019-11-25 08:53:32,619 INFO L226 Difference]: Without dead ends: 132 [2019-11-25 08:53:32,620 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:32,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-25 08:53:32,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2019-11-25 08:53:32,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-25 08:53:32,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 191 transitions. [2019-11-25 08:53:32,644 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 191 transitions. Word has length 36 [2019-11-25 08:53:32,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:32,645 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 191 transitions. [2019-11-25 08:53:32,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:53:32,645 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 191 transitions. [2019-11-25 08:53:32,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-25 08:53:32,646 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:32,647 INFO L410 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-25 08:53:32,647 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:32,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:32,647 INFO L82 PathProgramCache]: Analyzing trace with hash -462623258, now seen corresponding path program 1 times [2019-11-25 08:53:32,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:32,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907637459] [2019-11-25 08:53:32,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:32,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:32,772 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-25 08:53:32,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907637459] [2019-11-25 08:53:32,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:32,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:53:32,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623307129] [2019-11-25 08:53:32,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:53:32,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:32,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:53:32,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:32,775 INFO L87 Difference]: Start difference. First operand 129 states and 191 transitions. Second operand 3 states. [2019-11-25 08:53:32,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:32,938 INFO L93 Difference]: Finished difference Result 271 states and 407 transitions. [2019-11-25 08:53:32,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:53:32,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-25 08:53:32,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:32,942 INFO L225 Difference]: With dead ends: 271 [2019-11-25 08:53:32,942 INFO L226 Difference]: Without dead ends: 151 [2019-11-25 08:53:32,944 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:32,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-11-25 08:53:32,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 146. [2019-11-25 08:53:32,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-25 08:53:32,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 213 transitions. [2019-11-25 08:53:32,962 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 213 transitions. Word has length 50 [2019-11-25 08:53:32,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:32,963 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 213 transitions. [2019-11-25 08:53:32,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:53:32,963 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 213 transitions. [2019-11-25 08:53:32,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-25 08:53:32,965 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:32,966 INFO L410 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-25 08:53:32,966 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:32,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:32,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1174891697, now seen corresponding path program 1 times [2019-11-25 08:53:32,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:32,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937126496] [2019-11-25 08:53:32,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:33,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:33,066 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-25 08:53:33,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937126496] [2019-11-25 08:53:33,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:33,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:53:33,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391148798] [2019-11-25 08:53:33,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:53:33,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:33,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:53:33,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:33,070 INFO L87 Difference]: Start difference. First operand 146 states and 213 transitions. Second operand 3 states. [2019-11-25 08:53:33,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:33,277 INFO L93 Difference]: Finished difference Result 334 states and 502 transitions. [2019-11-25 08:53:33,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:53:33,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-25 08:53:33,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:33,280 INFO L225 Difference]: With dead ends: 334 [2019-11-25 08:53:33,280 INFO L226 Difference]: Without dead ends: 196 [2019-11-25 08:53:33,281 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:33,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-25 08:53:33,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 187. [2019-11-25 08:53:33,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-11-25 08:53:33,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 263 transitions. [2019-11-25 08:53:33,294 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 263 transitions. Word has length 67 [2019-11-25 08:53:33,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:33,295 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 263 transitions. [2019-11-25 08:53:33,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:53:33,296 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 263 transitions. [2019-11-25 08:53:33,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-25 08:53:33,298 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:33,299 INFO L410 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-25 08:53:33,299 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:33,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:33,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1314637265, now seen corresponding path program 1 times [2019-11-25 08:53:33,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:33,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627423760] [2019-11-25 08:53:33,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:33,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:33,357 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-25 08:53:33,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627423760] [2019-11-25 08:53:33,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:33,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:53:33,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248068068] [2019-11-25 08:53:33,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:53:33,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:33,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:53:33,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:33,360 INFO L87 Difference]: Start difference. First operand 187 states and 263 transitions. Second operand 3 states. [2019-11-25 08:53:33,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:33,512 INFO L93 Difference]: Finished difference Result 389 states and 554 transitions. [2019-11-25 08:53:33,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:53:33,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-25 08:53:33,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:33,514 INFO L225 Difference]: With dead ends: 389 [2019-11-25 08:53:33,514 INFO L226 Difference]: Without dead ends: 211 [2019-11-25 08:53:33,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:33,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-25 08:53:33,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2019-11-25 08:53:33,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-25 08:53:33,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 287 transitions. [2019-11-25 08:53:33,526 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 287 transitions. Word has length 67 [2019-11-25 08:53:33,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:33,527 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 287 transitions. [2019-11-25 08:53:33,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:53:33,527 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 287 transitions. [2019-11-25 08:53:33,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-25 08:53:33,534 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:33,535 INFO L410 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-25 08:53:33,535 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:33,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:33,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1231866158, now seen corresponding path program 1 times [2019-11-25 08:53:33,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:33,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540443610] [2019-11-25 08:53:33,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:33,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:33,626 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-25 08:53:33,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540443610] [2019-11-25 08:53:33,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:33,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:53:33,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630891582] [2019-11-25 08:53:33,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:53:33,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:33,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:53:33,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:33,630 INFO L87 Difference]: Start difference. First operand 206 states and 287 transitions. Second operand 3 states. [2019-11-25 08:53:33,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:33,770 INFO L93 Difference]: Finished difference Result 427 states and 603 transitions. [2019-11-25 08:53:33,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:53:33,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-25 08:53:33,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:33,773 INFO L225 Difference]: With dead ends: 427 [2019-11-25 08:53:33,773 INFO L226 Difference]: Without dead ends: 230 [2019-11-25 08:53:33,774 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:33,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-25 08:53:33,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2019-11-25 08:53:33,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-11-25 08:53:33,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 313 transitions. [2019-11-25 08:53:33,783 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 313 transitions. Word has length 84 [2019-11-25 08:53:33,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:33,784 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 313 transitions. [2019-11-25 08:53:33,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:53:33,784 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 313 transitions. [2019-11-25 08:53:33,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-25 08:53:33,787 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:33,787 INFO L410 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-25 08:53:33,787 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:33,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:33,788 INFO L82 PathProgramCache]: Analyzing trace with hash 266431114, now seen corresponding path program 1 times [2019-11-25 08:53:33,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:33,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837192195] [2019-11-25 08:53:33,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:33,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:33,868 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-25 08:53:33,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837192195] [2019-11-25 08:53:33,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:33,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:53:33,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722776776] [2019-11-25 08:53:33,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:53:33,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:33,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:53:33,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:33,870 INFO L87 Difference]: Start difference. First operand 227 states and 313 transitions. Second operand 3 states. [2019-11-25 08:53:33,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:33,917 INFO L93 Difference]: Finished difference Result 661 states and 912 transitions. [2019-11-25 08:53:33,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:53:33,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-25 08:53:33,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:33,921 INFO L225 Difference]: With dead ends: 661 [2019-11-25 08:53:33,921 INFO L226 Difference]: Without dead ends: 443 [2019-11-25 08:53:33,922 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:33,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-11-25 08:53:33,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2019-11-25 08:53:33,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-11-25 08:53:33,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 609 transitions. [2019-11-25 08:53:33,938 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 609 transitions. Word has length 104 [2019-11-25 08:53:33,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:33,939 INFO L462 AbstractCegarLoop]: Abstraction has 443 states and 609 transitions. [2019-11-25 08:53:33,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:53:33,939 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 609 transitions. [2019-11-25 08:53:33,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-25 08:53:33,942 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:33,942 INFO L410 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-25 08:53:33,942 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:33,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:33,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1706663820, now seen corresponding path program 1 times [2019-11-25 08:53:33,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:33,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201416985] [2019-11-25 08:53:33,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:33,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:34,011 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-25 08:53:34,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201416985] [2019-11-25 08:53:34,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:34,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:53:34,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337371665] [2019-11-25 08:53:34,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:53:34,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:34,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:53:34,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:34,014 INFO L87 Difference]: Start difference. First operand 443 states and 609 transitions. Second operand 3 states. [2019-11-25 08:53:34,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:34,052 INFO L93 Difference]: Finished difference Result 661 states and 909 transitions. [2019-11-25 08:53:34,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:53:34,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-25 08:53:34,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:34,058 INFO L225 Difference]: With dead ends: 661 [2019-11-25 08:53:34,058 INFO L226 Difference]: Without dead ends: 659 [2019-11-25 08:53:34,059 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:34,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-11-25 08:53:34,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2019-11-25 08:53:34,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-25 08:53:34,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 907 transitions. [2019-11-25 08:53:34,089 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 907 transitions. Word has length 106 [2019-11-25 08:53:34,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:34,090 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 907 transitions. [2019-11-25 08:53:34,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:53:34,091 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 907 transitions. [2019-11-25 08:53:34,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-25 08:53:34,093 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:34,094 INFO L410 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-25 08:53:34,094 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:34,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:34,095 INFO L82 PathProgramCache]: Analyzing trace with hash 589479754, now seen corresponding path program 1 times [2019-11-25 08:53:34,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:34,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804005706] [2019-11-25 08:53:34,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:34,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:34,168 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-25 08:53:34,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804005706] [2019-11-25 08:53:34,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:34,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:53:34,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255076514] [2019-11-25 08:53:34,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:53:34,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:34,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:53:34,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:34,175 INFO L87 Difference]: Start difference. First operand 659 states and 907 transitions. Second operand 3 states. [2019-11-25 08:53:34,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:34,345 INFO L93 Difference]: Finished difference Result 1462 states and 2068 transitions. [2019-11-25 08:53:34,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:53:34,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-11-25 08:53:34,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:34,349 INFO L225 Difference]: With dead ends: 1462 [2019-11-25 08:53:34,349 INFO L226 Difference]: Without dead ends: 809 [2019-11-25 08:53:34,350 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:34,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2019-11-25 08:53:34,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 776. [2019-11-25 08:53:34,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-11-25 08:53:34,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1096 transitions. [2019-11-25 08:53:34,372 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1096 transitions. Word has length 161 [2019-11-25 08:53:34,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:34,372 INFO L462 AbstractCegarLoop]: Abstraction has 776 states and 1096 transitions. [2019-11-25 08:53:34,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:53:34,373 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1096 transitions. [2019-11-25 08:53:34,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-25 08:53:34,376 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:34,376 INFO L410 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-25 08:53:34,376 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:34,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:34,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1596288335, now seen corresponding path program 1 times [2019-11-25 08:53:34,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:34,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232038479] [2019-11-25 08:53:34,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:34,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:34,432 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-25 08:53:34,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232038479] [2019-11-25 08:53:34,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:34,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:53:34,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103461796] [2019-11-25 08:53:34,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:53:34,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:34,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:53:34,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:34,434 INFO L87 Difference]: Start difference. First operand 776 states and 1096 transitions. Second operand 3 states. [2019-11-25 08:53:34,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:34,607 INFO L93 Difference]: Finished difference Result 1824 states and 2649 transitions. [2019-11-25 08:53:34,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:53:34,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-11-25 08:53:34,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:34,613 INFO L225 Difference]: With dead ends: 1824 [2019-11-25 08:53:34,613 INFO L226 Difference]: Without dead ends: 1006 [2019-11-25 08:53:34,614 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:34,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2019-11-25 08:53:34,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 965. [2019-11-25 08:53:34,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-11-25 08:53:34,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1348 transitions. [2019-11-25 08:53:34,639 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1348 transitions. Word has length 188 [2019-11-25 08:53:34,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:34,639 INFO L462 AbstractCegarLoop]: Abstraction has 965 states and 1348 transitions. [2019-11-25 08:53:34,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:53:34,640 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1348 transitions. [2019-11-25 08:53:34,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-11-25 08:53:34,643 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:34,643 INFO L410 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-25 08:53:34,644 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:34,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:34,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1275827432, now seen corresponding path program 1 times [2019-11-25 08:53:34,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:34,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748313653] [2019-11-25 08:53:34,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:34,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:34,704 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-25 08:53:34,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748313653] [2019-11-25 08:53:34,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:34,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:53:34,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125037810] [2019-11-25 08:53:34,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:53:34,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:34,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:53:34,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:34,706 INFO L87 Difference]: Start difference. First operand 965 states and 1348 transitions. Second operand 3 states. [2019-11-25 08:53:34,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:34,891 INFO L93 Difference]: Finished difference Result 2080 states and 2926 transitions. [2019-11-25 08:53:34,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:53:34,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-11-25 08:53:34,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:34,898 INFO L225 Difference]: With dead ends: 2080 [2019-11-25 08:53:34,898 INFO L226 Difference]: Without dead ends: 1079 [2019-11-25 08:53:34,900 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:34,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-11-25 08:53:34,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1040. [2019-11-25 08:53:34,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1040 states. [2019-11-25 08:53:34,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1444 transitions. [2019-11-25 08:53:34,933 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1444 transitions. Word has length 209 [2019-11-25 08:53:34,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:34,934 INFO L462 AbstractCegarLoop]: Abstraction has 1040 states and 1444 transitions. [2019-11-25 08:53:34,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:53:34,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1444 transitions. [2019-11-25 08:53:34,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-25 08:53:34,939 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:34,939 INFO L410 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-25 08:53:34,939 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:34,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:34,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1859847365, now seen corresponding path program 1 times [2019-11-25 08:53:34,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:34,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195486788] [2019-11-25 08:53:34,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:34,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:35,044 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-25 08:53:35,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195486788] [2019-11-25 08:53:35,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:35,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:53:35,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564249531] [2019-11-25 08:53:35,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:53:35,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:35,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:53:35,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:35,047 INFO L87 Difference]: Start difference. First operand 1040 states and 1444 transitions. Second operand 3 states. [2019-11-25 08:53:35,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:35,236 INFO L93 Difference]: Finished difference Result 2230 states and 3115 transitions. [2019-11-25 08:53:35,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:53:35,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-11-25 08:53:35,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:35,243 INFO L225 Difference]: With dead ends: 2230 [2019-11-25 08:53:35,243 INFO L226 Difference]: Without dead ends: 1160 [2019-11-25 08:53:35,245 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:35,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2019-11-25 08:53:35,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1124. [2019-11-25 08:53:35,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2019-11-25 08:53:35,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1555 transitions. [2019-11-25 08:53:35,277 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1555 transitions. Word has length 233 [2019-11-25 08:53:35,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:35,277 INFO L462 AbstractCegarLoop]: Abstraction has 1124 states and 1555 transitions. [2019-11-25 08:53:35,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:53:35,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1555 transitions. [2019-11-25 08:53:35,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-25 08:53:35,282 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:35,282 INFO L410 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-25 08:53:35,282 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:35,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:35,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1978288839, now seen corresponding path program 1 times [2019-11-25 08:53:35,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:35,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387263986] [2019-11-25 08:53:35,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:35,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:35,359 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-25 08:53:35,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387263986] [2019-11-25 08:53:35,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:35,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:53:35,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601372095] [2019-11-25 08:53:35,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:53:35,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:35,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:53:35,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:35,361 INFO L87 Difference]: Start difference. First operand 1124 states and 1555 transitions. Second operand 3 states. [2019-11-25 08:53:35,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:35,543 INFO L93 Difference]: Finished difference Result 2398 states and 3340 transitions. [2019-11-25 08:53:35,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:53:35,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-11-25 08:53:35,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:35,550 INFO L225 Difference]: With dead ends: 2398 [2019-11-25 08:53:35,551 INFO L226 Difference]: Without dead ends: 1256 [2019-11-25 08:53:35,552 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:35,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2019-11-25 08:53:35,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1217. [2019-11-25 08:53:35,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-11-25 08:53:35,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1687 transitions. [2019-11-25 08:53:35,586 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1687 transitions. Word has length 233 [2019-11-25 08:53:35,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:35,586 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 1687 transitions. [2019-11-25 08:53:35,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:53:35,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1687 transitions. [2019-11-25 08:53:35,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-11-25 08:53:35,592 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:35,593 INFO L410 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-25 08:53:35,593 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:35,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:35,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1116608197, now seen corresponding path program 1 times [2019-11-25 08:53:35,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:35,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517720800] [2019-11-25 08:53:35,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:35,704 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-25 08:53:35,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517720800] [2019-11-25 08:53:35,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:35,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:53:35,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258345024] [2019-11-25 08:53:35,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:53:35,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:35,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:53:35,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:35,707 INFO L87 Difference]: Start difference. First operand 1217 states and 1687 transitions. Second operand 3 states. [2019-11-25 08:53:35,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:35,751 INFO L93 Difference]: Finished difference Result 3630 states and 5032 transitions. [2019-11-25 08:53:35,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:53:35,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-11-25 08:53:35,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:35,765 INFO L225 Difference]: With dead ends: 3630 [2019-11-25 08:53:35,765 INFO L226 Difference]: Without dead ends: 2422 [2019-11-25 08:53:35,767 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:35,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2019-11-25 08:53:35,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2420. [2019-11-25 08:53:35,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2420 states. [2019-11-25 08:53:35,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2420 states and 3354 transitions. [2019-11-25 08:53:35,833 INFO L78 Accepts]: Start accepts. Automaton has 2420 states and 3354 transitions. Word has length 263 [2019-11-25 08:53:35,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:35,833 INFO L462 AbstractCegarLoop]: Abstraction has 2420 states and 3354 transitions. [2019-11-25 08:53:35,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:53:35,834 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 3354 transitions. [2019-11-25 08:53:35,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-11-25 08:53:35,840 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:35,840 INFO L410 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-25 08:53:35,841 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:35,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:35,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1235049671, now seen corresponding path program 1 times [2019-11-25 08:53:35,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:35,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724372259] [2019-11-25 08:53:35,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:35,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:35,964 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-25 08:53:35,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724372259] [2019-11-25 08:53:35,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:35,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:53:35,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962657600] [2019-11-25 08:53:35,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:53:35,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:35,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:53:35,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:35,966 INFO L87 Difference]: Start difference. First operand 2420 states and 3354 transitions. Second operand 3 states. [2019-11-25 08:53:36,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:36,191 INFO L93 Difference]: Finished difference Result 5143 states and 7169 transitions. [2019-11-25 08:53:36,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:53:36,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-11-25 08:53:36,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:36,206 INFO L225 Difference]: With dead ends: 5143 [2019-11-25 08:53:36,207 INFO L226 Difference]: Without dead ends: 2702 [2019-11-25 08:53:36,211 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:36,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-11-25 08:53:36,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 2630. [2019-11-25 08:53:36,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2630 states. [2019-11-25 08:53:36,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 3666 transitions. [2019-11-25 08:53:36,281 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 3666 transitions. Word has length 263 [2019-11-25 08:53:36,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:36,281 INFO L462 AbstractCegarLoop]: Abstraction has 2630 states and 3666 transitions. [2019-11-25 08:53:36,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:53:36,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 3666 transitions. [2019-11-25 08:53:36,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-11-25 08:53:36,288 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:36,289 INFO L410 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-25 08:53:36,289 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:36,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:36,289 INFO L82 PathProgramCache]: Analyzing trace with hash 2135776069, now seen corresponding path program 1 times [2019-11-25 08:53:36,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:36,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440486252] [2019-11-25 08:53:36,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:36,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:36,393 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-25 08:53:36,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440486252] [2019-11-25 08:53:36,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:36,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:53:36,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334959350] [2019-11-25 08:53:36,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:53:36,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:36,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:53:36,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:36,396 INFO L87 Difference]: Start difference. First operand 2630 states and 3666 transitions. Second operand 3 states. [2019-11-25 08:53:36,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:36,595 INFO L93 Difference]: Finished difference Result 5335 states and 7421 transitions. [2019-11-25 08:53:36,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:53:36,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2019-11-25 08:53:36,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:36,610 INFO L225 Difference]: With dead ends: 5335 [2019-11-25 08:53:36,610 INFO L226 Difference]: Without dead ends: 2696 [2019-11-25 08:53:36,613 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:36,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2696 states. [2019-11-25 08:53:36,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2696 to 2624. [2019-11-25 08:53:36,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2624 states. [2019-11-25 08:53:36,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 3630 transitions. [2019-11-25 08:53:36,686 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 3630 transitions. Word has length 298 [2019-11-25 08:53:36,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:36,687 INFO L462 AbstractCegarLoop]: Abstraction has 2624 states and 3630 transitions. [2019-11-25 08:53:36,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:53:36,687 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 3630 transitions. [2019-11-25 08:53:36,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-11-25 08:53:36,694 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:36,694 INFO L410 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-25 08:53:36,694 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:36,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:36,695 INFO L82 PathProgramCache]: Analyzing trace with hash -901475869, now seen corresponding path program 1 times [2019-11-25 08:53:36,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:36,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111247409] [2019-11-25 08:53:36,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:36,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:36,802 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-25 08:53:36,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111247409] [2019-11-25 08:53:36,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:36,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:53:36,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031352914] [2019-11-25 08:53:36,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:53:36,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:36,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:53:36,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:36,804 INFO L87 Difference]: Start difference. First operand 2624 states and 3630 transitions. Second operand 3 states. [2019-11-25 08:53:36,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:36,989 INFO L93 Difference]: Finished difference Result 5299 states and 7319 transitions. [2019-11-25 08:53:36,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:53:36,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2019-11-25 08:53:36,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:37,003 INFO L225 Difference]: With dead ends: 5299 [2019-11-25 08:53:37,003 INFO L226 Difference]: Without dead ends: 2684 [2019-11-25 08:53:37,007 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:37,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2019-11-25 08:53:37,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 2624. [2019-11-25 08:53:37,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2624 states. [2019-11-25 08:53:37,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 3576 transitions. [2019-11-25 08:53:37,081 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 3576 transitions. Word has length 307 [2019-11-25 08:53:37,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:37,081 INFO L462 AbstractCegarLoop]: Abstraction has 2624 states and 3576 transitions. [2019-11-25 08:53:37,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:53:37,082 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 3576 transitions. [2019-11-25 08:53:37,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-11-25 08:53:37,091 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:37,091 INFO L410 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-25 08:53:37,091 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:37,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:37,092 INFO L82 PathProgramCache]: Analyzing trace with hash 503398906, now seen corresponding path program 1 times [2019-11-25 08:53:37,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:37,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777928640] [2019-11-25 08:53:37,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:37,254 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-25 08:53:37,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777928640] [2019-11-25 08:53:37,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:37,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:53:37,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762474868] [2019-11-25 08:53:37,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:53:37,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:37,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:53:37,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:37,256 INFO L87 Difference]: Start difference. First operand 2624 states and 3576 transitions. Second operand 3 states. [2019-11-25 08:53:37,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:37,460 INFO L93 Difference]: Finished difference Result 5545 states and 7499 transitions. [2019-11-25 08:53:37,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:53:37,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-11-25 08:53:37,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:37,475 INFO L225 Difference]: With dead ends: 5545 [2019-11-25 08:53:37,475 INFO L226 Difference]: Without dead ends: 2930 [2019-11-25 08:53:37,478 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:37,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2019-11-25 08:53:37,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 2714. [2019-11-25 08:53:37,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2714 states. [2019-11-25 08:53:37,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2714 states and 3696 transitions. [2019-11-25 08:53:37,555 INFO L78 Accepts]: Start accepts. Automaton has 2714 states and 3696 transitions. Word has length 335 [2019-11-25 08:53:37,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:37,555 INFO L462 AbstractCegarLoop]: Abstraction has 2714 states and 3696 transitions. [2019-11-25 08:53:37,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:53:37,556 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 3696 transitions. [2019-11-25 08:53:37,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-11-25 08:53:37,564 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:37,564 INFO L410 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-25 08:53:37,564 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:37,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:37,565 INFO L82 PathProgramCache]: Analyzing trace with hash -121520003, now seen corresponding path program 1 times [2019-11-25 08:53:37,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:37,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930908647] [2019-11-25 08:53:37,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:37,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:37,711 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-25 08:53:37,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930908647] [2019-11-25 08:53:37,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:37,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:53:37,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896138873] [2019-11-25 08:53:37,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:53:37,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:37,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:53:37,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:37,713 INFO L87 Difference]: Start difference. First operand 2714 states and 3696 transitions. Second operand 3 states. [2019-11-25 08:53:37,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:37,787 INFO L93 Difference]: Finished difference Result 7734 states and 10582 transitions. [2019-11-25 08:53:37,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:53:37,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-11-25 08:53:37,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:37,812 INFO L225 Difference]: With dead ends: 7734 [2019-11-25 08:53:37,812 INFO L226 Difference]: Without dead ends: 5029 [2019-11-25 08:53:37,816 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:37,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5029 states. [2019-11-25 08:53:37,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5029 to 5027. [2019-11-25 08:53:37,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5027 states. [2019-11-25 08:53:37,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5027 states to 5027 states and 6880 transitions. [2019-11-25 08:53:37,939 INFO L78 Accepts]: Start accepts. Automaton has 5027 states and 6880 transitions. Word has length 336 [2019-11-25 08:53:37,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:37,940 INFO L462 AbstractCegarLoop]: Abstraction has 5027 states and 6880 transitions. [2019-11-25 08:53:37,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:53:37,940 INFO L276 IsEmpty]: Start isEmpty. Operand 5027 states and 6880 transitions. [2019-11-25 08:53:37,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-11-25 08:53:37,951 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:37,952 INFO L410 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-25 08:53:37,952 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:37,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:37,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1651416633, now seen corresponding path program 1 times [2019-11-25 08:53:37,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:37,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942238490] [2019-11-25 08:53:37,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:38,156 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-25 08:53:38,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942238490] [2019-11-25 08:53:38,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937472544] [2019-11-25 08:53:38,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d1a33dc-5ece-44b9-b92e-11ca29380d6e/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-25 08:53:38,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:38,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:53:38,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:53:38,462 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-25 08:53:38,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:53:38,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-25 08:53:38,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136997894] [2019-11-25 08:53:38,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:53:38,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:38,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:53:38,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:53:38,466 INFO L87 Difference]: Start difference. First operand 5027 states and 6880 transitions. Second operand 4 states. [2019-11-25 08:53:38,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:38,860 INFO L93 Difference]: Finished difference Result 9987 states and 13646 transitions. [2019-11-25 08:53:38,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:53:38,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 346 [2019-11-25 08:53:38,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:38,885 INFO L225 Difference]: With dead ends: 9987 [2019-11-25 08:53:38,885 INFO L226 Difference]: Without dead ends: 7540 [2019-11-25 08:53:38,890 INFO L630 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-25 08:53:38,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7540 states. [2019-11-25 08:53:39,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7540 to 5561. [2019-11-25 08:53:39,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5561 states. [2019-11-25 08:53:39,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5561 states to 5561 states and 7516 transitions. [2019-11-25 08:53:39,034 INFO L78 Accepts]: Start accepts. Automaton has 5561 states and 7516 transitions. Word has length 346 [2019-11-25 08:53:39,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:39,035 INFO L462 AbstractCegarLoop]: Abstraction has 5561 states and 7516 transitions. [2019-11-25 08:53:39,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:53:39,035 INFO L276 IsEmpty]: Start isEmpty. Operand 5561 states and 7516 transitions. [2019-11-25 08:53:39,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-11-25 08:53:39,045 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:39,046 INFO L410 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-25 08:53:39,251 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:53:39,251 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:39,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:39,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1397611342, now seen corresponding path program 1 times [2019-11-25 08:53:39,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:39,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697819809] [2019-11-25 08:53:39,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:39,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:39,474 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-25 08:53:39,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697819809] [2019-11-25 08:53:39,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485578799] [2019-11-25 08:53:39,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d1a33dc-5ece-44b9-b92e-11ca29380d6e/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-25 08:53:39,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:39,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:53:39,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:53:39,720 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-25 08:53:39,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:53:39,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-25 08:53:39,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612648554] [2019-11-25 08:53:39,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:53:39,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:39,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:53:39,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:53:39,724 INFO L87 Difference]: Start difference. First operand 5561 states and 7516 transitions. Second operand 4 states. [2019-11-25 08:53:40,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:40,102 INFO L93 Difference]: Finished difference Result 12544 states and 16972 transitions. [2019-11-25 08:53:40,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:53:40,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 373 [2019-11-25 08:53:40,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:40,116 INFO L225 Difference]: With dead ends: 12544 [2019-11-25 08:53:40,116 INFO L226 Difference]: Without dead ends: 6979 [2019-11-25 08:53:40,123 INFO L630 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-25 08:53:40,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6979 states. [2019-11-25 08:53:40,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6979 to 5709. [2019-11-25 08:53:40,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5709 states. [2019-11-25 08:53:40,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5709 states to 5709 states and 7634 transitions. [2019-11-25 08:53:40,259 INFO L78 Accepts]: Start accepts. Automaton has 5709 states and 7634 transitions. Word has length 373 [2019-11-25 08:53:40,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:40,260 INFO L462 AbstractCegarLoop]: Abstraction has 5709 states and 7634 transitions. [2019-11-25 08:53:40,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:53:40,260 INFO L276 IsEmpty]: Start isEmpty. Operand 5709 states and 7634 transitions. [2019-11-25 08:53:40,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-11-25 08:53:40,272 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:40,273 INFO L410 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-25 08:53:40,477 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:53:40,477 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:40,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:40,478 INFO L82 PathProgramCache]: Analyzing trace with hash -236946382, now seen corresponding path program 1 times [2019-11-25 08:53:40,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:40,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406555468] [2019-11-25 08:53:40,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:40,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:40,666 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-25 08:53:40,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406555468] [2019-11-25 08:53:40,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:40,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:53:40,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287035072] [2019-11-25 08:53:40,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:53:40,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:40,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:53:40,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:40,669 INFO L87 Difference]: Start difference. First operand 5709 states and 7634 transitions. Second operand 3 states. [2019-11-25 08:53:40,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:40,891 INFO L93 Difference]: Finished difference Result 11015 states and 14510 transitions. [2019-11-25 08:53:40,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:53:40,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 412 [2019-11-25 08:53:40,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:40,897 INFO L225 Difference]: With dead ends: 11015 [2019-11-25 08:53:40,898 INFO L226 Difference]: Without dead ends: 3069 [2019-11-25 08:53:40,907 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:40,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3069 states. [2019-11-25 08:53:40,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3069 to 2976. [2019-11-25 08:53:40,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2976 states. [2019-11-25 08:53:40,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 3983 transitions. [2019-11-25 08:53:40,985 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 3983 transitions. Word has length 412 [2019-11-25 08:53:40,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:40,985 INFO L462 AbstractCegarLoop]: Abstraction has 2976 states and 3983 transitions. [2019-11-25 08:53:40,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:53:40,985 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 3983 transitions. [2019-11-25 08:53:40,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2019-11-25 08:53:40,999 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:40,999 INFO L410 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-25 08:53:41,000 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:41,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:41,000 INFO L82 PathProgramCache]: Analyzing trace with hash -788979008, now seen corresponding path program 1 times [2019-11-25 08:53:41,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:41,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045790113] [2019-11-25 08:53:41,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:41,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:41,312 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-25 08:53:41,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045790113] [2019-11-25 08:53:41,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178785990] [2019-11-25 08:53:41,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d1a33dc-5ece-44b9-b92e-11ca29380d6e/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-25 08:53:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:41,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:53:41,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:53:41,776 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-25 08:53:41,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:53:41,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-25 08:53:41,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134203004] [2019-11-25 08:53:41,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:53:41,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:41,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:53:41,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:53:41,781 INFO L87 Difference]: Start difference. First operand 2976 states and 3983 transitions. Second operand 3 states. [2019-11-25 08:53:41,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:41,817 INFO L93 Difference]: Finished difference Result 3028 states and 4049 transitions. [2019-11-25 08:53:41,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:53:41,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 496 [2019-11-25 08:53:41,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:41,823 INFO L225 Difference]: With dead ends: 3028 [2019-11-25 08:53:41,823 INFO L226 Difference]: Without dead ends: 2531 [2019-11-25 08:53:41,824 INFO L630 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-25 08:53:41,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2531 states. [2019-11-25 08:53:41,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2531 to 2481. [2019-11-25 08:53:41,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2481 states. [2019-11-25 08:53:41,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 3319 transitions. [2019-11-25 08:53:41,876 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 3319 transitions. Word has length 496 [2019-11-25 08:53:41,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:41,877 INFO L462 AbstractCegarLoop]: Abstraction has 2481 states and 3319 transitions. [2019-11-25 08:53:41,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:53:41,877 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 3319 transitions. [2019-11-25 08:53:41,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2019-11-25 08:53:41,890 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:41,891 INFO L410 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-25 08:53:42,095 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:53:42,095 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:42,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:42,096 INFO L82 PathProgramCache]: Analyzing trace with hash 866163585, now seen corresponding path program 1 times [2019-11-25 08:53:42,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:42,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511689640] [2019-11-25 08:53:42,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:42,394 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-25 08:53:42,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511689640] [2019-11-25 08:53:42,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741814004] [2019-11-25 08:53:42,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d1a33dc-5ece-44b9-b92e-11ca29380d6e/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-25 08:53:42,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:42,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:53:42,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:53:42,717 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-25 08:53:42,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:53:42,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-25 08:53:42,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057063050] [2019-11-25 08:53:42,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:53:42,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:42,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:53:42,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:53:42,721 INFO L87 Difference]: Start difference. First operand 2481 states and 3319 transitions. Second operand 3 states. [2019-11-25 08:53:42,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:42,904 INFO L93 Difference]: Finished difference Result 5060 states and 6783 transitions. [2019-11-25 08:53:42,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:53:42,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 497 [2019-11-25 08:53:42,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:42,910 INFO L225 Difference]: With dead ends: 5060 [2019-11-25 08:53:42,910 INFO L226 Difference]: Without dead ends: 2589 [2019-11-25 08:53:42,914 INFO L630 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-25 08:53:42,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2589 states. [2019-11-25 08:53:42,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2589 to 2586. [2019-11-25 08:53:42,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2586 states. [2019-11-25 08:53:42,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2586 states to 2586 states and 3331 transitions. [2019-11-25 08:53:42,975 INFO L78 Accepts]: Start accepts. Automaton has 2586 states and 3331 transitions. Word has length 497 [2019-11-25 08:53:42,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:42,976 INFO L462 AbstractCegarLoop]: Abstraction has 2586 states and 3331 transitions. [2019-11-25 08:53:42,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:53:42,976 INFO L276 IsEmpty]: Start isEmpty. Operand 2586 states and 3331 transitions. [2019-11-25 08:53:42,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2019-11-25 08:53:42,993 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:42,994 INFO L410 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-25 08:53:43,198 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:53:43,198 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:43,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:43,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1604973917, now seen corresponding path program 2 times [2019-11-25 08:53:43,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:43,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022792198] [2019-11-25 08:53:43,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:43,622 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-25 08:53:43,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022792198] [2019-11-25 08:53:43,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112031439] [2019-11-25 08:53:43,623 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d1a33dc-5ece-44b9-b92e-11ca29380d6e/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-25 08:53:43,816 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 08:53:43,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:53:43,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 964 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:53:43,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:53:44,049 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-25 08:53:44,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:53:44,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-25 08:53:44,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241345772] [2019-11-25 08:53:44,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:53:44,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:44,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:53:44,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:53:44,052 INFO L87 Difference]: Start difference. First operand 2586 states and 3331 transitions. Second operand 4 states. [2019-11-25 08:53:44,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:44,216 INFO L93 Difference]: Finished difference Result 2848 states and 3664 transitions. [2019-11-25 08:53:44,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:53:44,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 608 [2019-11-25 08:53:44,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:44,217 INFO L225 Difference]: With dead ends: 2848 [2019-11-25 08:53:44,217 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 08:53:44,220 INFO L630 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-25 08:53:44,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 08:53:44,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 08:53:44,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 08:53:44,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 08:53:44,221 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 608 [2019-11-25 08:53:44,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:44,221 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:53:44,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:53:44,222 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:53:44,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 08:53:44,426 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:53:44,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-25 08:53:44,848 WARN L192 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 253 DAG size of output: 111 [2019-11-25 08:53:45,868 WARN L192 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2019-11-25 08:53:46,079 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 7 [2019-11-25 08:53:46,341 INFO L440 ceAbstractionStarter]: At program point L201(lines 197 514) the Hoare annotation is: (let ((.cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse0 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (not .cse0) .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (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-25 08:53:46,342 INFO L440 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-25 08:53:46,342 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 104) no Hoare annotation was computed. [2019-11-25 08:53:46,342 INFO L444 ceAbstractionStarter]: For program point L235(lines 235 251) no Hoare annotation was computed. [2019-11-25 08:53:46,342 INFO L444 ceAbstractionStarter]: For program point L235-2(lines 210 508) no Hoare annotation was computed. [2019-11-25 08:53:46,342 INFO L444 ceAbstractionStarter]: For program point L467(lines 467 479) no Hoare annotation was computed. [2019-11-25 08:53:46,342 INFO L444 ceAbstractionStarter]: For program point L434(lines 434 448) no Hoare annotation was computed. [2019-11-25 08:53:46,342 INFO L444 ceAbstractionStarter]: For program point L434-1(lines 434 448) no Hoare annotation was computed. [2019-11-25 08:53:46,342 INFO L444 ceAbstractionStarter]: For program point L467-2(lines 467 479) no Hoare annotation was computed. [2019-11-25 08:53:46,342 INFO L444 ceAbstractionStarter]: For program point L335(lines 335 338) no Hoare annotation was computed. [2019-11-25 08:53:46,342 INFO L444 ceAbstractionStarter]: For program point L269(lines 269 271) no Hoare annotation was computed. [2019-11-25 08:53:46,343 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 512) no Hoare annotation was computed. [2019-11-25 08:53:46,343 INFO L444 ceAbstractionStarter]: For program point L269-2(lines 210 508) no Hoare annotation was computed. [2019-11-25 08:53:46,343 INFO L444 ceAbstractionStarter]: For program point L170(lines 170 523) no Hoare annotation was computed. [2019-11-25 08:53:46,343 INFO L444 ceAbstractionStarter]: For program point L137(lines 137 534) no Hoare annotation was computed. [2019-11-25 08:53:46,343 INFO L444 ceAbstractionStarter]: For program point L501(lines 501 503) no Hoare annotation was computed. [2019-11-25 08:53:46,343 INFO L440 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 (not .cse0) .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= 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-25 08:53:46,343 INFO L440 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-25 08:53:46,343 INFO L444 ceAbstractionStarter]: For program point L568(lines 568 570) no Hoare annotation was computed. [2019-11-25 08:53:46,343 INFO L444 ceAbstractionStarter]: For program point L568-2(lines 568 570) no Hoare annotation was computed. [2019-11-25 08:53:46,343 INFO L444 ceAbstractionStarter]: For program point L370(lines 370 372) no Hoare annotation was computed. [2019-11-25 08:53:46,343 INFO L444 ceAbstractionStarter]: For program point L404(lines 404 406) no Hoare annotation was computed. [2019-11-25 08:53:46,344 INFO L444 ceAbstractionStarter]: For program point L206(lines 206 511) no Hoare annotation was computed. [2019-11-25 08:53:46,344 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 522) no Hoare annotation was computed. [2019-11-25 08:53:46,344 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 533) no Hoare annotation was computed. [2019-11-25 08:53:46,344 INFO L444 ceAbstractionStarter]: For program point L107-1(lines 84 574) no Hoare annotation was computed. [2019-11-25 08:53:46,344 INFO L444 ceAbstractionStarter]: For program point L438(lines 438 444) no Hoare annotation was computed. [2019-11-25 08:53:46,344 INFO L447 ceAbstractionStarter]: At program point L207(lines 206 511) the Hoare annotation is: true [2019-11-25 08:53:46,344 INFO L440 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 4) .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2))) [2019-11-25 08:53:46,344 INFO L444 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-11-25 08:53:46,344 INFO L444 ceAbstractionStarter]: For program point L241(lines 241 244) no Hoare annotation was computed. [2019-11-25 08:53:46,344 INFO L444 ceAbstractionStarter]: For program point L473(lines 473 476) no Hoare annotation was computed. [2019-11-25 08:53:46,344 INFO L447 ceAbstractionStarter]: At program point L209(lines 208 511) the Hoare annotation is: true [2019-11-25 08:53:46,345 INFO L444 ceAbstractionStarter]: For program point L176(lines 176 521) no Hoare annotation was computed. [2019-11-25 08:53:46,345 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 532) no Hoare annotation was computed. [2019-11-25 08:53:46,345 INFO L444 ceAbstractionStarter]: For program point L110(lines 110 543) no Hoare annotation was computed. [2019-11-25 08:53:46,345 INFO L447 ceAbstractionStarter]: At program point L573(lines 10 575) the Hoare annotation is: true [2019-11-25 08:53:46,345 INFO L444 ceAbstractionStarter]: For program point L309(lines 309 319) no Hoare annotation was computed. [2019-11-25 08:53:46,345 INFO L444 ceAbstractionStarter]: For program point L309-2(lines 309 319) no Hoare annotation was computed. [2019-11-25 08:53:46,345 INFO L440 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-25 08:53:46,345 INFO L440 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-25 08:53:46,345 INFO L444 ceAbstractionStarter]: For program point L343(lines 343 345) no Hoare annotation was computed. [2019-11-25 08:53:46,346 INFO L440 ceAbstractionStarter]: At program point L509(lines 107 562) the Hoare annotation is: (let ((.cse8 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (let ((.cse4 (<= ULTIMATE.start_ssl3_connect_~s__state~0 3)) (.cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse3 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse12 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse7 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse1 (not .cse8)) (.cse10 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse9 (= 4400 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse6 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2))) (or (and .cse0 (= 4368 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse1 .cse2 .cse3 .cse0) (and .cse4 .cse5) (and .cse6 .cse7 .cse8 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse7 .cse8 .cse5 .cse9) (and .cse0 .cse4 .cse8) (and .cse10 .cse11 .cse12 .cse8 .cse5) (and .cse2 .cse3 .cse12 .cse8 .cse5) (and (= 4416 ULTIMATE.start_ssl3_connect_~s__state~0) .cse7 .cse8) (and .cse1 .cse10 .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse11) (and .cse0 (= 4384 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse0 .cse8 .cse9) (and (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) .cse6 .cse0)))) [2019-11-25 08:53:46,346 INFO L444 ceAbstractionStarter]: For program point L410(lines 410 414) no Hoare annotation was computed. [2019-11-25 08:53:46,346 INFO L440 ceAbstractionStarter]: At program point L344(lines 84 574) the Hoare annotation is: false [2019-11-25 08:53:46,346 INFO L444 ceAbstractionStarter]: For program point L410-2(lines 210 508) no Hoare annotation was computed. [2019-11-25 08:53:46,346 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 520) no Hoare annotation was computed. [2019-11-25 08:53:46,346 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 531) no Hoare annotation was computed. [2019-11-25 08:53:46,346 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 542) no Hoare annotation was computed. [2019-11-25 08:53:46,346 INFO L444 ceAbstractionStarter]: For program point L246(lines 246 249) no Hoare annotation was computed. [2019-11-25 08:53:46,346 INFO L440 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-25 08:53:46,346 INFO L444 ceAbstractionStarter]: For program point L544(lines 544 560) no Hoare annotation was computed. [2019-11-25 08:53:46,346 INFO L444 ceAbstractionStarter]: For program point L379(lines 379 381) no Hoare annotation was computed. [2019-11-25 08:53:46,347 INFO L444 ceAbstractionStarter]: For program point L346(lines 346 348) no Hoare annotation was computed. [2019-11-25 08:53:46,347 INFO L444 ceAbstractionStarter]: For program point L313(lines 313 315) no Hoare annotation was computed. [2019-11-25 08:53:46,347 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 282) no Hoare annotation was computed. [2019-11-25 08:53:46,347 INFO L444 ceAbstractionStarter]: For program point L313-2(lines 311 319) no Hoare annotation was computed. [2019-11-25 08:53:46,347 INFO L444 ceAbstractionStarter]: For program point L545(lines 545 559) no Hoare annotation was computed. [2019-11-25 08:53:46,347 INFO L440 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-25 08:53:46,347 INFO L444 ceAbstractionStarter]: For program point L182(lines 182 519) no Hoare annotation was computed. [2019-11-25 08:53:46,347 INFO L444 ceAbstractionStarter]: For program point L149(lines 149 530) no Hoare annotation was computed. [2019-11-25 08:53:46,347 INFO L444 ceAbstractionStarter]: For program point L116(lines 116 541) no Hoare annotation was computed. [2019-11-25 08:53:46,347 INFO L444 ceAbstractionStarter]: For program point L546(lines 546 551) no Hoare annotation was computed. [2019-11-25 08:53:46,347 INFO L444 ceAbstractionStarter]: For program point L546-2(lines 545 559) no Hoare annotation was computed. [2019-11-25 08:53:46,348 INFO L440 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-25 08:53:46,348 INFO L444 ceAbstractionStarter]: For program point L548(lines 548 550) no Hoare annotation was computed. [2019-11-25 08:53:46,348 INFO L444 ceAbstractionStarter]: For program point L383(lines 383 388) no Hoare annotation was computed. [2019-11-25 08:53:46,348 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-25 08:53:46,348 INFO L444 ceAbstractionStarter]: For program point L383-2(lines 383 388) no Hoare annotation was computed. [2019-11-25 08:53:46,348 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 518) no Hoare annotation was computed. [2019-11-25 08:53:46,348 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 529) no Hoare annotation was computed. [2019-11-25 08:53:46,348 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 540) no Hoare annotation was computed. [2019-11-25 08:53:46,349 INFO L440 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-25 08:53:46,349 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 484 486) no Hoare annotation was computed. [2019-11-25 08:53:46,349 INFO L444 ceAbstractionStarter]: For program point L220(lines 220 222) no Hoare annotation was computed. [2019-11-25 08:53:46,349 INFO L444 ceAbstractionStarter]: For program point L220-2(lines 220 222) no Hoare annotation was computed. [2019-11-25 08:53:46,349 INFO L447 ceAbstractionStarter]: At program point L584(lines 576 586) the Hoare annotation is: true [2019-11-25 08:53:46,349 INFO L444 ceAbstractionStarter]: For program point L419(lines 419 422) no Hoare annotation was computed. [2019-11-25 08:53:46,349 INFO L444 ceAbstractionStarter]: For program point L188(lines 188 517) no Hoare annotation was computed. [2019-11-25 08:53:46,349 INFO L444 ceAbstractionStarter]: For program point L155(lines 155 528) no Hoare annotation was computed. [2019-11-25 08:53:46,349 INFO L444 ceAbstractionStarter]: For program point L122(lines 122 539) no Hoare annotation was computed. [2019-11-25 08:53:46,349 INFO L444 ceAbstractionStarter]: For program point L288(lines 288 294) no Hoare annotation was computed. [2019-11-25 08:53:46,349 INFO L440 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) .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)))) [2019-11-25 08:53:46,350 INFO L444 ceAbstractionStarter]: For program point L553(lines 553 557) no Hoare annotation was computed. [2019-11-25 08:53:46,350 INFO L444 ceAbstractionStarter]: For program point L454(lines 454 456) no Hoare annotation was computed. [2019-11-25 08:53:46,350 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 357) no Hoare annotation was computed. [2019-11-25 08:53:46,350 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-25 08:53:46,351 INFO L444 ceAbstractionStarter]: For program point L257(lines 257 260) no Hoare annotation was computed. [2019-11-25 08:53:46,351 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 516) no Hoare annotation was computed. [2019-11-25 08:53:46,351 INFO L444 ceAbstractionStarter]: For program point L158(lines 158 527) no Hoare annotation was computed. [2019-11-25 08:53:46,352 INFO L444 ceAbstractionStarter]: For program point L125(lines 125 538) no Hoare annotation was computed. [2019-11-25 08:53:46,352 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 293) no Hoare annotation was computed. [2019-11-25 08:53:46,352 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 228) no Hoare annotation was computed. [2019-11-25 08:53:46,352 INFO L444 ceAbstractionStarter]: For program point L291-2(lines 210 508) no Hoare annotation was computed. [2019-11-25 08:53:46,352 INFO L440 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-25 08:53:46,352 INFO L444 ceAbstractionStarter]: For program point L93(lines 93 99) no Hoare annotation was computed. [2019-11-25 08:53:46,353 INFO L444 ceAbstractionStarter]: For program point L490(lines 490 492) no Hoare annotation was computed. [2019-11-25 08:53:46,353 INFO L444 ceAbstractionStarter]: For program point L457(lines 457 461) no Hoare annotation was computed. [2019-11-25 08:53:46,353 INFO L444 ceAbstractionStarter]: For program point L490-2(lines 490 492) no Hoare annotation was computed. [2019-11-25 08:53:46,353 INFO L444 ceAbstractionStarter]: For program point L457-2(lines 457 461) no Hoare annotation was computed. [2019-11-25 08:53:46,353 INFO L444 ceAbstractionStarter]: For program point L358(lines 358 362) no Hoare annotation was computed. [2019-11-25 08:53:46,353 INFO L444 ceAbstractionStarter]: For program point L358-2(lines 358 362) no Hoare annotation was computed. [2019-11-25 08:53:46,353 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-25 08:53:46,353 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 515) no Hoare annotation was computed. [2019-11-25 08:53:46,354 INFO L444 ceAbstractionStarter]: For program point L161(lines 161 526) no Hoare annotation was computed. [2019-11-25 08:53:46,354 INFO L444 ceAbstractionStarter]: For program point L128(lines 128 537) no Hoare annotation was computed. [2019-11-25 08:53:46,354 INFO L444 ceAbstractionStarter]: For program point L327(lines 327 329) no Hoare annotation was computed. [2019-11-25 08:53:46,354 INFO L444 ceAbstractionStarter]: For program point L327-2(lines 210 508) no Hoare annotation was computed. [2019-11-25 08:53:46,354 INFO L440 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 .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)))) [2019-11-25 08:53:46,355 INFO L440 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-25 08:53:46,355 INFO L444 ceAbstractionStarter]: For program point L96(lines 96 98) no Hoare annotation was computed. [2019-11-25 08:53:46,355 INFO L444 ceAbstractionStarter]: For program point L96-2(lines 93 99) no Hoare annotation was computed. [2019-11-25 08:53:46,355 INFO L444 ceAbstractionStarter]: For program point L427(lines 427 429) no Hoare annotation was computed. [2019-11-25 08:53:46,355 INFO L444 ceAbstractionStarter]: For program point L394(lines 394 396) no Hoare annotation was computed. [2019-11-25 08:53:46,355 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 514) no Hoare annotation was computed. [2019-11-25 08:53:46,355 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 525) no Hoare annotation was computed. [2019-11-25 08:53:46,356 INFO L444 ceAbstractionStarter]: For program point L131(lines 131 536) no Hoare annotation was computed. [2019-11-25 08:53:46,356 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 572) no Hoare annotation was computed. [2019-11-25 08:53:46,356 INFO L444 ceAbstractionStarter]: For program point L496(lines 496 498) no Hoare annotation was computed. [2019-11-25 08:53:46,356 INFO L444 ceAbstractionStarter]: For program point L496-2(lines 496 498) no Hoare annotation was computed. [2019-11-25 08:53:46,356 INFO L444 ceAbstractionStarter]: For program point L298(lines 298 302) no Hoare annotation was computed. [2019-11-25 08:53:46,356 INFO L444 ceAbstractionStarter]: For program point L298-2(lines 298 302) no Hoare annotation was computed. [2019-11-25 08:53:46,356 INFO L447 ceAbstractionStarter]: At program point L563(lines 106 564) the Hoare annotation is: true [2019-11-25 08:53:46,357 INFO L444 ceAbstractionStarter]: For program point L200(lines 200 513) no Hoare annotation was computed. [2019-11-25 08:53:46,357 INFO L444 ceAbstractionStarter]: For program point L167(lines 167 524) no Hoare annotation was computed. [2019-11-25 08:53:46,357 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 535) no Hoare annotation was computed. [2019-11-25 08:53:46,357 INFO L444 ceAbstractionStarter]: For program point L101(lines 101 105) no Hoare annotation was computed. [2019-11-25 08:53:46,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:53:46 BoogieIcfgContainer [2019-11-25 08:53:46,396 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:53:46,396 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:53:46,396 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:53:46,397 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:53:46,397 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:53:31" (3/4) ... [2019-11-25 08:53:46,400 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 08:53:46,425 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-25 08:53:46,426 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 08:53:46,579 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8d1a33dc-5ece-44b9-b92e-11ca29380d6e/bin/uautomizer/witness.graphml [2019-11-25 08:53:46,579 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:53:46,581 INFO L168 Benchmark]: Toolchain (without parser) took 16065.82 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 944.7 MB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:53:46,581 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:53:46,582 INFO L168 Benchmark]: CACSL2BoogieTranslator took 442.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 184.0 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -225.5 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-25 08:53:46,582 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:53:46,582 INFO L168 Benchmark]: Boogie Preprocessor took 35.46 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:53:46,583 INFO L168 Benchmark]: RCFGBuilder took 726.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 57.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:53:46,583 INFO L168 Benchmark]: TraceAbstraction took 14619.17 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 947.4 MB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -991.5 MB). Peak memory consumption was 961.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:53:46,584 INFO L168 Benchmark]: Witness Printer took 183.15 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:53:46,586 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 442.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 184.0 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -225.5 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.46 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 726.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 57.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14619.17 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 947.4 MB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -991.5 MB). Peak memory consumption was 961.2 MB. Max. memory is 11.5 GB. * Witness Printer took 183.15 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 32.7 MB). Peak memory consumption was 32.7 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: (((!(0 == s__hit) && 4560 <= s__state) && s__state <= 4560) && 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) - 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) || (((!(0 == s__hit) && 4560 <= s__state) && s__state <= 4560) && blastFlag <= 2)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state)) || (((blastFlag <= 4 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4400 == s__state)) || ((blastFlag <= 2 && s__state <= 3) && 0 == s__hit)) || ((((s__state <= 4352 && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((((4560 <= s__state && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((4416 == s__state && blastFlag <= 4) && 0 == s__hit)) || ((((!(0 == s__hit) && s__state <= 4352) && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state)) || (blastFlag <= 2 && 4384 == s__state)) || ((blastFlag <= 2 && 0 == s__hit) && 4400 == s__state)) || ((4512 <= s__state && s__state <= 4528) && blastFlag <= 2) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((!(0 == s__hit) && s__state <= 4352) && blastFlag <= 2) && 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 <= 4 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) || (((blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: ((((s__state <= 4560 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4432 <= s__state) || (((s__state <= 4560 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state)) || ((4512 <= s__state && s__state <= 4560) && blastFlag <= 2) - 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: 14.5s, OverallIterations: 25, TraceHistogramMax: 21, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.9s, HoareTripleCheckerStatistics: 4490 SDtfs, 2114 SDslu, 2318 SDs, 0 SdLazy, 2460 SolverSat, 611 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2400 GetRequests, 2365 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s 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.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 4032 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 155 NumberOfFragments, 425 HoareAnnotationTreeSize, 22 FomulaSimplifications, 31460 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 22 FomulaSimplificationsInter, 24851 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.1s 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...