./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_clnt_4.cil-1.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_0b02af7f-3347-4106-8bdb-bb7efe29454f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0b02af7f-3347-4106-8bdb-bb7efe29454f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0b02af7f-3347-4106-8bdb-bb7efe29454f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0b02af7f-3347-4106-8bdb-bb7efe29454f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_clnt_4.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_0b02af7f-3347-4106-8bdb-bb7efe29454f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0b02af7f-3347-4106-8bdb-bb7efe29454f/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 4e02aecb828ddbcb4cc0dcb3053661f316d65cc9 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:51:26,153 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:51:26,155 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:51:26,170 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:51:26,171 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:51:26,172 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:51:26,174 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:51:26,176 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:51:26,178 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:51:26,179 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:51:26,180 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:51:26,181 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:51:26,181 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:51:26,182 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:51:26,183 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:51:26,184 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:51:26,185 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:51:26,190 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:51:26,192 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:51:26,197 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:51:26,200 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:51:26,201 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:51:26,202 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:51:26,203 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:51:26,205 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:51:26,206 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:51:26,206 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:51:26,206 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:51:26,207 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:51:26,208 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:51:26,210 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:51:26,211 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:51:26,212 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:51:26,213 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:51:26,216 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:51:26,216 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:51:26,217 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:51:26,217 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:51:26,217 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:51:26,218 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:51:26,218 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:51:26,219 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0b02af7f-3347-4106-8bdb-bb7efe29454f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:51:26,233 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:51:26,234 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:51:26,235 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:51:26,235 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:51:26,235 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:51:26,235 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:51:26,235 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:51:26,236 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:51:26,236 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:51:26,236 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:51:26,236 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:51:26,236 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:51:26,236 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:51:26,237 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:51:26,237 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:51:26,237 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:51:26,237 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:51:26,237 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:51:26,237 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:51:26,238 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:51:26,238 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:51:26,238 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:51:26,238 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:51:26,239 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:51:26,239 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:51:26,239 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:51:26,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:51:26,239 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:51:26,239 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_0b02af7f-3347-4106-8bdb-bb7efe29454f/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 -> 4e02aecb828ddbcb4cc0dcb3053661f316d65cc9 [2019-11-25 08:51:26,385 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:51:26,405 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:51:26,408 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:51:26,409 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:51:26,409 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:51:26,410 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0b02af7f-3347-4106-8bdb-bb7efe29454f/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_clnt_4.cil-1.c [2019-11-25 08:51:26,459 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0b02af7f-3347-4106-8bdb-bb7efe29454f/bin/uautomizer/data/1b32c3e18/11bd8ec6d4554ea49d9ea26f877ee45a/FLAGa904d69bc [2019-11-25 08:51:26,851 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:51:26,851 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0b02af7f-3347-4106-8bdb-bb7efe29454f/sv-benchmarks/c/ssh-simplified/s3_clnt_4.cil-1.c [2019-11-25 08:51:26,866 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0b02af7f-3347-4106-8bdb-bb7efe29454f/bin/uautomizer/data/1b32c3e18/11bd8ec6d4554ea49d9ea26f877ee45a/FLAGa904d69bc [2019-11-25 08:51:27,205 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0b02af7f-3347-4106-8bdb-bb7efe29454f/bin/uautomizer/data/1b32c3e18/11bd8ec6d4554ea49d9ea26f877ee45a [2019-11-25 08:51:27,207 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:51:27,208 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:51:27,209 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:51:27,209 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:51:27,212 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:51:27,213 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:51:27" (1/1) ... [2019-11-25 08:51:27,215 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5475574e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:27, skipping insertion in model container [2019-11-25 08:51:27,215 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:51:27" (1/1) ... [2019-11-25 08:51:27,220 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:51:27,278 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:51:27,571 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:51:27,575 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:51:27,634 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:51:27,664 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:51:27,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:27 WrapperNode [2019-11-25 08:51:27,668 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:51:27,668 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:51:27,669 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:51:27,669 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:51:27,675 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:51:27" (1/1) ... [2019-11-25 08:51:27,683 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:51:27" (1/1) ... [2019-11-25 08:51:27,721 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:51:27,721 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:51:27,722 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:51:27,722 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:51:27,730 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:27" (1/1) ... [2019-11-25 08:51:27,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:27" (1/1) ... [2019-11-25 08:51:27,734 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:27" (1/1) ... [2019-11-25 08:51:27,734 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:27" (1/1) ... [2019-11-25 08:51:27,742 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:27" (1/1) ... [2019-11-25 08:51:27,752 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:27" (1/1) ... [2019-11-25 08:51:27,755 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:27" (1/1) ... [2019-11-25 08:51:27,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:51:27,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:51:27,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:51:27,760 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:51:27,761 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b02af7f-3347-4106-8bdb-bb7efe29454f/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:51:27,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:51:27,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:51:27,942 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 08:51:28,535 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-25 08:51:28,536 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-25 08:51:28,537 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:51:28,537 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-25 08:51:28,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:51:28 BoogieIcfgContainer [2019-11-25 08:51:28,538 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:51:28,539 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:51:28,539 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:51:28,542 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:51:28,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:51:27" (1/3) ... [2019-11-25 08:51:28,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c5a316f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:51:28, skipping insertion in model container [2019-11-25 08:51:28,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:27" (2/3) ... [2019-11-25 08:51:28,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c5a316f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:51:28, skipping insertion in model container [2019-11-25 08:51:28,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:51:28" (3/3) ... [2019-11-25 08:51:28,545 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_4.cil-1.c [2019-11-25 08:51:28,554 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:51:28,560 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:51:28,570 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:51:28,593 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:51:28,593 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:51:28,594 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:51:28,594 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:51:28,594 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:51:28,594 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:51:28,594 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:51:28,595 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:51:28,611 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2019-11-25 08:51:28,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-25 08:51:28,617 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:51:28,618 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:51:28,618 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:51:28,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:28,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1449576961, now seen corresponding path program 1 times [2019-11-25 08:51:28,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:28,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137870623] [2019-11-25 08:51:28,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:28,791 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:51:28,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137870623] [2019-11-25 08:51:28,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:51:28,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:51:28,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018128022] [2019-11-25 08:51:28,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:51:28,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:51:28,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:51:28,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:51:28,816 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 3 states. [2019-11-25 08:51:29,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:51:29,029 INFO L93 Difference]: Finished difference Result 251 states and 426 transitions. [2019-11-25 08:51:29,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:51:29,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-25 08:51:29,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:51:29,046 INFO L225 Difference]: With dead ends: 251 [2019-11-25 08:51:29,046 INFO L226 Difference]: Without dead ends: 114 [2019-11-25 08:51:29,051 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:51:29,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-25 08:51:29,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-11-25 08:51:29,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-25 08:51:29,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 171 transitions. [2019-11-25 08:51:29,115 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 171 transitions. Word has length 23 [2019-11-25 08:51:29,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:51:29,116 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 171 transitions. [2019-11-25 08:51:29,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:51:29,120 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 171 transitions. [2019-11-25 08:51:29,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-25 08:51:29,122 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:51:29,122 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:51:29,122 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:51:29,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:29,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1395170557, now seen corresponding path program 1 times [2019-11-25 08:51:29,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:29,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653705582] [2019-11-25 08:51:29,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:29,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:29,237 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:51:29,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653705582] [2019-11-25 08:51:29,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:51:29,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:51:29,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872270690] [2019-11-25 08:51:29,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:51:29,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:51:29,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:51:29,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:51:29,240 INFO L87 Difference]: Start difference. First operand 114 states and 171 transitions. Second operand 3 states. [2019-11-25 08:51:29,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:51:29,381 INFO L93 Difference]: Finished difference Result 237 states and 359 transitions. [2019-11-25 08:51:29,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:51:29,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-25 08:51:29,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:51:29,383 INFO L225 Difference]: With dead ends: 237 [2019-11-25 08:51:29,383 INFO L226 Difference]: Without dead ends: 132 [2019-11-25 08:51:29,384 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:51:29,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-25 08:51:29,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2019-11-25 08:51:29,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-25 08:51:29,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 191 transitions. [2019-11-25 08:51:29,397 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 191 transitions. Word has length 36 [2019-11-25 08:51:29,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:51:29,397 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 191 transitions. [2019-11-25 08:51:29,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:51:29,398 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 191 transitions. [2019-11-25 08:51:29,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-25 08:51:29,399 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:51:29,400 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:51:29,400 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:51:29,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:29,401 INFO L82 PathProgramCache]: Analyzing trace with hash -462623258, now seen corresponding path program 1 times [2019-11-25 08:51:29,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:29,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309758919] [2019-11-25 08:51:29,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:29,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:29,477 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:51:29,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309758919] [2019-11-25 08:51:29,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:51:29,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:51:29,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127125187] [2019-11-25 08:51:29,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:51:29,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:51:29,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:51:29,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:51:29,480 INFO L87 Difference]: Start difference. First operand 129 states and 191 transitions. Second operand 3 states. [2019-11-25 08:51:29,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:51:29,624 INFO L93 Difference]: Finished difference Result 270 states and 405 transitions. [2019-11-25 08:51:29,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:51:29,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-25 08:51:29,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:51:29,627 INFO L225 Difference]: With dead ends: 270 [2019-11-25 08:51:29,627 INFO L226 Difference]: Without dead ends: 150 [2019-11-25 08:51:29,628 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:51:29,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-25 08:51:29,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2019-11-25 08:51:29,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-25 08:51:29,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 213 transitions. [2019-11-25 08:51:29,639 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 213 transitions. Word has length 50 [2019-11-25 08:51:29,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:51:29,640 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 213 transitions. [2019-11-25 08:51:29,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:51:29,644 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 213 transitions. [2019-11-25 08:51:29,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-25 08:51:29,653 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:51:29,653 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:51:29,653 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:51:29,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:29,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1168366188, now seen corresponding path program 1 times [2019-11-25 08:51:29,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:29,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616768819] [2019-11-25 08:51:29,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:29,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:29,786 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:51:29,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616768819] [2019-11-25 08:51:29,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:51:29,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:51:29,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544540916] [2019-11-25 08:51:29,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:51:29,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:51:29,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:51:29,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:51:29,794 INFO L87 Difference]: Start difference. First operand 146 states and 213 transitions. Second operand 3 states. [2019-11-25 08:51:30,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:51:30,002 INFO L93 Difference]: Finished difference Result 334 states and 502 transitions. [2019-11-25 08:51:30,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:51:30,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-25 08:51:30,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:51:30,005 INFO L225 Difference]: With dead ends: 334 [2019-11-25 08:51:30,005 INFO L226 Difference]: Without dead ends: 196 [2019-11-25 08:51:30,006 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:51:30,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-25 08:51:30,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 187. [2019-11-25 08:51:30,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-11-25 08:51:30,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 263 transitions. [2019-11-25 08:51:30,031 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 263 transitions. Word has length 67 [2019-11-25 08:51:30,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:51:30,034 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 263 transitions. [2019-11-25 08:51:30,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:51:30,034 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 263 transitions. [2019-11-25 08:51:30,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-25 08:51:30,038 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:51:30,038 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:51:30,038 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:51:30,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:30,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1321162774, now seen corresponding path program 1 times [2019-11-25 08:51:30,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:30,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602218729] [2019-11-25 08:51:30,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:30,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:30,129 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:51:30,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602218729] [2019-11-25 08:51:30,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:51:30,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:51:30,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513915376] [2019-11-25 08:51:30,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:51:30,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:51:30,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:51:30,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:51:30,133 INFO L87 Difference]: Start difference. First operand 187 states and 263 transitions. Second operand 3 states. [2019-11-25 08:51:30,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:51:30,280 INFO L93 Difference]: Finished difference Result 390 states and 556 transitions. [2019-11-25 08:51:30,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:51:30,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-25 08:51:30,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:51:30,282 INFO L225 Difference]: With dead ends: 390 [2019-11-25 08:51:30,282 INFO L226 Difference]: Without dead ends: 212 [2019-11-25 08:51:30,284 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:51:30,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-11-25 08:51:30,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 206. [2019-11-25 08:51:30,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-25 08:51:30,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 287 transitions. [2019-11-25 08:51:30,300 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 287 transitions. Word has length 67 [2019-11-25 08:51:30,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:51:30,304 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 287 transitions. [2019-11-25 08:51:30,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:51:30,305 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 287 transitions. [2019-11-25 08:51:30,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-25 08:51:30,306 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:51:30,306 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:51:30,306 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:51:30,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:30,307 INFO L82 PathProgramCache]: Analyzing trace with hash -136835443, now seen corresponding path program 1 times [2019-11-25 08:51:30,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:30,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222452225] [2019-11-25 08:51:30,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:30,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:30,416 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:51:30,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222452225] [2019-11-25 08:51:30,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:51:30,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:51:30,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721967357] [2019-11-25 08:51:30,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:51:30,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:51:30,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:51:30,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:51:30,421 INFO L87 Difference]: Start difference. First operand 206 states and 287 transitions. Second operand 3 states. [2019-11-25 08:51:30,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:51:30,559 INFO L93 Difference]: Finished difference Result 427 states and 603 transitions. [2019-11-25 08:51:30,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:51:30,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-25 08:51:30,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:51:30,561 INFO L225 Difference]: With dead ends: 427 [2019-11-25 08:51:30,562 INFO L226 Difference]: Without dead ends: 230 [2019-11-25 08:51:30,562 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:51:30,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-25 08:51:30,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2019-11-25 08:51:30,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-11-25 08:51:30,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 313 transitions. [2019-11-25 08:51:30,572 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 313 transitions. Word has length 84 [2019-11-25 08:51:30,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:51:30,572 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 313 transitions. [2019-11-25 08:51:30,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:51:30,572 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 313 transitions. [2019-11-25 08:51:30,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-25 08:51:30,573 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:51:30,574 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:51:30,574 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:51:30,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:30,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1324345659, now seen corresponding path program 1 times [2019-11-25 08:51:30,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:30,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311014239] [2019-11-25 08:51:30,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:30,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:30,625 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:51:30,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311014239] [2019-11-25 08:51:30,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:51:30,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:51:30,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535418125] [2019-11-25 08:51:30,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:51:30,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:51:30,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:51:30,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:51:30,627 INFO L87 Difference]: Start difference. First operand 227 states and 313 transitions. Second operand 3 states. [2019-11-25 08:51:30,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:51:30,664 INFO L93 Difference]: Finished difference Result 661 states and 912 transitions. [2019-11-25 08:51:30,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:51:30,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-25 08:51:30,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:51:30,668 INFO L225 Difference]: With dead ends: 661 [2019-11-25 08:51:30,668 INFO L226 Difference]: Without dead ends: 443 [2019-11-25 08:51:30,669 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:51:30,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-11-25 08:51:30,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2019-11-25 08:51:30,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-11-25 08:51:30,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 609 transitions. [2019-11-25 08:51:30,682 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 609 transitions. Word has length 104 [2019-11-25 08:51:30,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:51:30,683 INFO L462 AbstractCegarLoop]: Abstraction has 443 states and 609 transitions. [2019-11-25 08:51:30,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:51:30,683 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 609 transitions. [2019-11-25 08:51:30,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-25 08:51:30,685 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:51:30,685 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:51:30,686 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:51:30,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:30,686 INFO L82 PathProgramCache]: Analyzing trace with hash -606282988, now seen corresponding path program 1 times [2019-11-25 08:51:30,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:30,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594849616] [2019-11-25 08:51:30,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:30,735 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:51:30,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594849616] [2019-11-25 08:51:30,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:51:30,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:51:30,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290401510] [2019-11-25 08:51:30,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:51:30,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:51:30,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:51:30,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:51:30,737 INFO L87 Difference]: Start difference. First operand 443 states and 609 transitions. Second operand 3 states. [2019-11-25 08:51:30,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:51:30,775 INFO L93 Difference]: Finished difference Result 661 states and 909 transitions. [2019-11-25 08:51:30,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:51:30,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-25 08:51:30,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:51:30,780 INFO L225 Difference]: With dead ends: 661 [2019-11-25 08:51:30,780 INFO L226 Difference]: Without dead ends: 659 [2019-11-25 08:51:30,780 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:51:30,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-11-25 08:51:30,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2019-11-25 08:51:30,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-25 08:51:30,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 907 transitions. [2019-11-25 08:51:30,798 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 907 transitions. Word has length 106 [2019-11-25 08:51:30,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:51:30,799 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 907 transitions. [2019-11-25 08:51:30,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:51:30,799 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 907 transitions. [2019-11-25 08:51:30,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-25 08:51:30,801 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:51:30,802 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:51:30,802 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:51:30,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:30,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1653094939, now seen corresponding path program 1 times [2019-11-25 08:51:30,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:30,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446726403] [2019-11-25 08:51:30,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:30,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:30,857 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-25 08:51:30,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446726403] [2019-11-25 08:51:30,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:51:30,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:51:30,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787338648] [2019-11-25 08:51:30,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:51:30,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:51:30,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:51:30,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:51:30,860 INFO L87 Difference]: Start difference. First operand 659 states and 907 transitions. Second operand 3 states. [2019-11-25 08:51:31,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:51:31,049 INFO L93 Difference]: Finished difference Result 1462 states and 2068 transitions. [2019-11-25 08:51:31,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:51:31,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-11-25 08:51:31,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:51:31,054 INFO L225 Difference]: With dead ends: 1462 [2019-11-25 08:51:31,055 INFO L226 Difference]: Without dead ends: 809 [2019-11-25 08:51:31,056 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:51:31,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2019-11-25 08:51:31,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 776. [2019-11-25 08:51:31,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-11-25 08:51:31,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1096 transitions. [2019-11-25 08:51:31,076 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1096 transitions. Word has length 146 [2019-11-25 08:51:31,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:51:31,077 INFO L462 AbstractCegarLoop]: Abstraction has 776 states and 1096 transitions. [2019-11-25 08:51:31,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:51:31,077 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1096 transitions. [2019-11-25 08:51:31,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-25 08:51:31,080 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:51:31,080 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 4, 4, 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] [2019-11-25 08:51:31,080 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:51:31,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:31,080 INFO L82 PathProgramCache]: Analyzing trace with hash 285230582, now seen corresponding path program 1 times [2019-11-25 08:51:31,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:31,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313543114] [2019-11-25 08:51:31,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:31,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:31,138 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-25 08:51:31,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313543114] [2019-11-25 08:51:31,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:51:31,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:51:31,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869324540] [2019-11-25 08:51:31,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:51:31,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:51:31,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:51:31,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:51:31,140 INFO L87 Difference]: Start difference. First operand 776 states and 1096 transitions. Second operand 3 states. [2019-11-25 08:51:31,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:51:31,270 INFO L93 Difference]: Finished difference Result 1623 states and 2286 transitions. [2019-11-25 08:51:31,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:51:31,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-11-25 08:51:31,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:51:31,276 INFO L225 Difference]: With dead ends: 1623 [2019-11-25 08:51:31,276 INFO L226 Difference]: Without dead ends: 856 [2019-11-25 08:51:31,277 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:51:31,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2019-11-25 08:51:31,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 845. [2019-11-25 08:51:31,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2019-11-25 08:51:31,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1180 transitions. [2019-11-25 08:51:31,299 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1180 transitions. Word has length 182 [2019-11-25 08:51:31,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:51:31,300 INFO L462 AbstractCegarLoop]: Abstraction has 845 states and 1180 transitions. [2019-11-25 08:51:31,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:51:31,300 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1180 transitions. [2019-11-25 08:51:31,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-11-25 08:51:31,303 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:51:31,303 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:31,303 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:51:31,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:31,304 INFO L82 PathProgramCache]: Analyzing trace with hash 742481215, now seen corresponding path program 1 times [2019-11-25 08:51:31,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:31,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402294978] [2019-11-25 08:51:31,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:31,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:31,393 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2019-11-25 08:51:31,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402294978] [2019-11-25 08:51:31,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:51:31,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:51:31,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106918090] [2019-11-25 08:51:31,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:51:31,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:51:31,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:51:31,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:51:31,395 INFO L87 Difference]: Start difference. First operand 845 states and 1180 transitions. Second operand 3 states. [2019-11-25 08:51:31,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:51:31,535 INFO L93 Difference]: Finished difference Result 1765 states and 2467 transitions. [2019-11-25 08:51:31,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:51:31,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2019-11-25 08:51:31,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:51:31,541 INFO L225 Difference]: With dead ends: 1765 [2019-11-25 08:51:31,541 INFO L226 Difference]: Without dead ends: 929 [2019-11-25 08:51:31,542 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:51:31,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2019-11-25 08:51:31,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 920. [2019-11-25 08:51:31,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 920 states. [2019-11-25 08:51:31,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1270 transitions. [2019-11-25 08:51:31,565 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1270 transitions. Word has length 203 [2019-11-25 08:51:31,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:51:31,566 INFO L462 AbstractCegarLoop]: Abstraction has 920 states and 1270 transitions. [2019-11-25 08:51:31,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:51:31,566 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1270 transitions. [2019-11-25 08:51:31,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-11-25 08:51:31,570 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:51:31,570 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 6, 6, 4, 4, 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] [2019-11-25 08:51:31,570 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:51:31,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:31,570 INFO L82 PathProgramCache]: Analyzing trace with hash 884333740, now seen corresponding path program 1 times [2019-11-25 08:51:31,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:31,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080372761] [2019-11-25 08:51:31,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:31,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:31,646 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 411 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2019-11-25 08:51:31,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080372761] [2019-11-25 08:51:31,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:51:31,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:51:31,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154285648] [2019-11-25 08:51:31,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:51:31,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:51:31,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:51:31,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:51:31,648 INFO L87 Difference]: Start difference. First operand 920 states and 1270 transitions. Second operand 3 states. [2019-11-25 08:51:31,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:51:31,781 INFO L93 Difference]: Finished difference Result 1921 states and 2656 transitions. [2019-11-25 08:51:31,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:51:31,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2019-11-25 08:51:31,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:51:31,787 INFO L225 Difference]: With dead ends: 1921 [2019-11-25 08:51:31,787 INFO L226 Difference]: Without dead ends: 1010 [2019-11-25 08:51:31,789 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:51:31,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2019-11-25 08:51:31,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 1004. [2019-11-25 08:51:31,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1004 states. [2019-11-25 08:51:31,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1369 transitions. [2019-11-25 08:51:31,812 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1369 transitions. Word has length 227 [2019-11-25 08:51:31,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:51:31,812 INFO L462 AbstractCegarLoop]: Abstraction has 1004 states and 1369 transitions. [2019-11-25 08:51:31,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:51:31,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1369 transitions. [2019-11-25 08:51:31,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-11-25 08:51:31,816 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:51:31,816 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 6, 6, 4, 4, 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] [2019-11-25 08:51:31,816 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:51:31,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:31,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1915374638, now seen corresponding path program 1 times [2019-11-25 08:51:31,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:31,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083511002] [2019-11-25 08:51:31,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:31,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:31,889 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 411 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2019-11-25 08:51:31,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083511002] [2019-11-25 08:51:31,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:51:31,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:51:31,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850321210] [2019-11-25 08:51:31,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:51:31,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:51:31,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:51:31,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:51:31,891 INFO L87 Difference]: Start difference. First operand 1004 states and 1369 transitions. Second operand 3 states. [2019-11-25 08:51:32,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:51:32,044 INFO L93 Difference]: Finished difference Result 2101 states and 2881 transitions. [2019-11-25 08:51:32,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:51:32,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2019-11-25 08:51:32,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:51:32,052 INFO L225 Difference]: With dead ends: 2101 [2019-11-25 08:51:32,052 INFO L226 Difference]: Without dead ends: 1106 [2019-11-25 08:51:32,054 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:51:32,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-11-25 08:51:32,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1097. [2019-11-25 08:51:32,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1097 states. [2019-11-25 08:51:32,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1477 transitions. [2019-11-25 08:51:32,085 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1477 transitions. Word has length 227 [2019-11-25 08:51:32,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:51:32,085 INFO L462 AbstractCegarLoop]: Abstraction has 1097 states and 1477 transitions. [2019-11-25 08:51:32,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:51:32,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1477 transitions. [2019-11-25 08:51:32,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-11-25 08:51:32,091 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:51:32,091 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:32,091 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:51:32,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:32,092 INFO L82 PathProgramCache]: Analyzing trace with hash -50346324, now seen corresponding path program 1 times [2019-11-25 08:51:32,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:32,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28801601] [2019-11-25 08:51:32,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:32,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:32,194 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 530 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-11-25 08:51:32,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28801601] [2019-11-25 08:51:32,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:51:32,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:51:32,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995847079] [2019-11-25 08:51:32,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:51:32,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:51:32,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:51:32,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:51:32,196 INFO L87 Difference]: Start difference. First operand 1097 states and 1477 transitions. Second operand 3 states. [2019-11-25 08:51:32,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:51:32,234 INFO L93 Difference]: Finished difference Result 3270 states and 4402 transitions. [2019-11-25 08:51:32,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:51:32,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 257 [2019-11-25 08:51:32,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:51:32,246 INFO L225 Difference]: With dead ends: 3270 [2019-11-25 08:51:32,246 INFO L226 Difference]: Without dead ends: 2182 [2019-11-25 08:51:32,248 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:51:32,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2019-11-25 08:51:32,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 2180. [2019-11-25 08:51:32,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2180 states. [2019-11-25 08:51:32,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 2934 transitions. [2019-11-25 08:51:32,305 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 2934 transitions. Word has length 257 [2019-11-25 08:51:32,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:51:32,306 INFO L462 AbstractCegarLoop]: Abstraction has 2180 states and 2934 transitions. [2019-11-25 08:51:32,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:51:32,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 2934 transitions. [2019-11-25 08:51:32,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-11-25 08:51:32,311 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:51:32,312 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:32,312 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:51:32,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:32,312 INFO L82 PathProgramCache]: Analyzing trace with hash 980694574, now seen corresponding path program 1 times [2019-11-25 08:51:32,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:32,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198156619] [2019-11-25 08:51:32,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:32,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:32,398 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 485 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-11-25 08:51:32,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198156619] [2019-11-25 08:51:32,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:51:32,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:51:32,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147994898] [2019-11-25 08:51:32,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:51:32,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:51:32,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:51:32,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:51:32,400 INFO L87 Difference]: Start difference. First operand 2180 states and 2934 transitions. Second operand 3 states. [2019-11-25 08:51:32,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:51:32,569 INFO L93 Difference]: Finished difference Result 4576 states and 6206 transitions. [2019-11-25 08:51:32,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:51:32,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 257 [2019-11-25 08:51:32,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:51:32,582 INFO L225 Difference]: With dead ends: 4576 [2019-11-25 08:51:32,583 INFO L226 Difference]: Without dead ends: 2405 [2019-11-25 08:51:32,585 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:51:32,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2405 states. [2019-11-25 08:51:32,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2405 to 2393. [2019-11-25 08:51:32,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2393 states. [2019-11-25 08:51:32,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2393 states to 2393 states and 3177 transitions. [2019-11-25 08:51:32,644 INFO L78 Accepts]: Start accepts. Automaton has 2393 states and 3177 transitions. Word has length 257 [2019-11-25 08:51:32,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:51:32,644 INFO L462 AbstractCegarLoop]: Abstraction has 2393 states and 3177 transitions. [2019-11-25 08:51:32,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:51:32,645 INFO L276 IsEmpty]: Start isEmpty. Operand 2393 states and 3177 transitions. [2019-11-25 08:51:32,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-11-25 08:51:32,650 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:51:32,651 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 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] [2019-11-25 08:51:32,651 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:51:32,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:32,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1095007574, now seen corresponding path program 1 times [2019-11-25 08:51:32,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:32,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407134972] [2019-11-25 08:51:32,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:32,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1015 backedges. 555 proven. 0 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2019-11-25 08:51:32,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407134972] [2019-11-25 08:51:32,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:51:32,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:51:32,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169341714] [2019-11-25 08:51:32,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:51:32,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:51:32,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:51:32,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:51:32,787 INFO L87 Difference]: Start difference. First operand 2393 states and 3177 transitions. Second operand 3 states. [2019-11-25 08:51:32,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:51:32,946 INFO L93 Difference]: Finished difference Result 4888 states and 6509 transitions. [2019-11-25 08:51:32,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:51:32,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 281 [2019-11-25 08:51:32,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:51:32,960 INFO L225 Difference]: With dead ends: 4888 [2019-11-25 08:51:32,961 INFO L226 Difference]: Without dead ends: 2504 [2019-11-25 08:51:32,963 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:51:32,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2504 states. [2019-11-25 08:51:33,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2504 to 2492. [2019-11-25 08:51:33,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2492 states. [2019-11-25 08:51:33,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2492 states to 2492 states and 3291 transitions. [2019-11-25 08:51:33,037 INFO L78 Accepts]: Start accepts. Automaton has 2492 states and 3291 transitions. Word has length 281 [2019-11-25 08:51:33,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:51:33,037 INFO L462 AbstractCegarLoop]: Abstraction has 2492 states and 3291 transitions. [2019-11-25 08:51:33,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:51:33,038 INFO L276 IsEmpty]: Start isEmpty. Operand 2492 states and 3291 transitions. [2019-11-25 08:51:33,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-11-25 08:51:33,044 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:51:33,044 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:33,044 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:51:33,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:33,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1021889644, now seen corresponding path program 1 times [2019-11-25 08:51:33,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:33,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751475993] [2019-11-25 08:51:33,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:33,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:33,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 442 proven. 0 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2019-11-25 08:51:33,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751475993] [2019-11-25 08:51:33,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:51:33,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:51:33,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142584044] [2019-11-25 08:51:33,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:51:33,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:51:33,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:51:33,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:51:33,141 INFO L87 Difference]: Start difference. First operand 2492 states and 3291 transitions. Second operand 3 states. [2019-11-25 08:51:33,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:51:33,338 INFO L93 Difference]: Finished difference Result 5275 states and 7097 transitions. [2019-11-25 08:51:33,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:51:33,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2019-11-25 08:51:33,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:51:33,354 INFO L225 Difference]: With dead ends: 5275 [2019-11-25 08:51:33,354 INFO L226 Difference]: Without dead ends: 2792 [2019-11-25 08:51:33,357 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:51:33,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2792 states. [2019-11-25 08:51:33,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2792 to 2732. [2019-11-25 08:51:33,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2732 states. [2019-11-25 08:51:33,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2732 states to 2732 states and 3573 transitions. [2019-11-25 08:51:33,425 INFO L78 Accepts]: Start accepts. Automaton has 2732 states and 3573 transitions. Word has length 292 [2019-11-25 08:51:33,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:51:33,426 INFO L462 AbstractCegarLoop]: Abstraction has 2732 states and 3573 transitions. [2019-11-25 08:51:33,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:51:33,426 INFO L276 IsEmpty]: Start isEmpty. Operand 2732 states and 3573 transitions. [2019-11-25 08:51:33,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-11-25 08:51:33,433 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:51:33,434 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, 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] [2019-11-25 08:51:33,434 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:51:33,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:33,434 INFO L82 PathProgramCache]: Analyzing trace with hash -229308938, now seen corresponding path program 1 times [2019-11-25 08:51:33,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:33,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48459132] [2019-11-25 08:51:33,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:33,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:33,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1171 backedges. 631 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2019-11-25 08:51:33,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48459132] [2019-11-25 08:51:33,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:51:33,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:51:33,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173664636] [2019-11-25 08:51:33,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:51:33,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:51:33,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:51:33,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:51:33,568 INFO L87 Difference]: Start difference. First operand 2732 states and 3573 transitions. Second operand 3 states. [2019-11-25 08:51:33,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:51:33,799 INFO L93 Difference]: Finished difference Result 5539 states and 7235 transitions. [2019-11-25 08:51:33,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:51:33,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2019-11-25 08:51:33,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:51:33,814 INFO L225 Difference]: With dead ends: 5539 [2019-11-25 08:51:33,815 INFO L226 Difference]: Without dead ends: 2798 [2019-11-25 08:51:33,818 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:51:33,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2798 states. [2019-11-25 08:51:33,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2798 to 2726. [2019-11-25 08:51:33,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2726 states. [2019-11-25 08:51:33,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2726 states to 2726 states and 3537 transitions. [2019-11-25 08:51:33,890 INFO L78 Accepts]: Start accepts. Automaton has 2726 states and 3537 transitions. Word has length 300 [2019-11-25 08:51:33,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:51:33,891 INFO L462 AbstractCegarLoop]: Abstraction has 2726 states and 3537 transitions. [2019-11-25 08:51:33,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:51:33,891 INFO L276 IsEmpty]: Start isEmpty. Operand 2726 states and 3537 transitions. [2019-11-25 08:51:33,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-11-25 08:51:33,898 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:51:33,899 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:33,899 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:51:33,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:33,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1736108088, now seen corresponding path program 1 times [2019-11-25 08:51:33,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:33,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762932221] [2019-11-25 08:51:33,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:34,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 657 proven. 14 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2019-11-25 08:51:34,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762932221] [2019-11-25 08:51:34,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197064383] [2019-11-25 08:51:34,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b02af7f-3347-4106-8bdb-bb7efe29454f/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:51:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:34,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:51:34,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:51:34,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 657 proven. 14 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2019-11-25 08:51:34,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:51:34,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-25 08:51:34,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241550231] [2019-11-25 08:51:34,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:51:34,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:51:34,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:51:34,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:51:34,305 INFO L87 Difference]: Start difference. First operand 2726 states and 3537 transitions. Second operand 4 states. [2019-11-25 08:51:34,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:51:34,729 INFO L93 Difference]: Finished difference Result 8268 states and 10711 transitions. [2019-11-25 08:51:34,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:51:34,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 331 [2019-11-25 08:51:34,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:51:34,758 INFO L225 Difference]: With dead ends: 8268 [2019-11-25 08:51:34,758 INFO L226 Difference]: Without dead ends: 5545 [2019-11-25 08:51:34,762 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 333 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:51:34,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5545 states. [2019-11-25 08:51:34,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5545 to 3572. [2019-11-25 08:51:34,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3572 states. [2019-11-25 08:51:34,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3572 states to 3572 states and 4587 transitions. [2019-11-25 08:51:34,886 INFO L78 Accepts]: Start accepts. Automaton has 3572 states and 4587 transitions. Word has length 331 [2019-11-25 08:51:34,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:51:34,886 INFO L462 AbstractCegarLoop]: Abstraction has 3572 states and 4587 transitions. [2019-11-25 08:51:34,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:51:34,887 INFO L276 IsEmpty]: Start isEmpty. Operand 3572 states and 4587 transitions. [2019-11-25 08:51:34,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-11-25 08:51:34,896 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:51:34,896 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:35,101 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:51:35,102 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:51:35,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:35,102 INFO L82 PathProgramCache]: Analyzing trace with hash 619319881, now seen corresponding path program 1 times [2019-11-25 08:51:35,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:35,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376032950] [2019-11-25 08:51:35,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:35,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:35,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 770 proven. 0 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2019-11-25 08:51:35,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376032950] [2019-11-25 08:51:35,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:51:35,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:51:35,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290837729] [2019-11-25 08:51:35,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:51:35,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:51:35,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:51:35,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:51:35,266 INFO L87 Difference]: Start difference. First operand 3572 states and 4587 transitions. Second operand 3 states. [2019-11-25 08:51:35,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:51:35,361 INFO L93 Difference]: Finished difference Result 9456 states and 12199 transitions. [2019-11-25 08:51:35,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:51:35,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-11-25 08:51:35,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:51:35,387 INFO L225 Difference]: With dead ends: 9456 [2019-11-25 08:51:35,387 INFO L226 Difference]: Without dead ends: 5893 [2019-11-25 08:51:35,393 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:51:35,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5893 states. [2019-11-25 08:51:35,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5893 to 5591. [2019-11-25 08:51:35,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5591 states. [2019-11-25 08:51:35,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5591 states to 5591 states and 7204 transitions. [2019-11-25 08:51:35,526 INFO L78 Accepts]: Start accepts. Automaton has 5591 states and 7204 transitions. Word has length 332 [2019-11-25 08:51:35,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:51:35,526 INFO L462 AbstractCegarLoop]: Abstraction has 5591 states and 7204 transitions. [2019-11-25 08:51:35,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:51:35,526 INFO L276 IsEmpty]: Start isEmpty. Operand 5591 states and 7204 transitions. [2019-11-25 08:51:35,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-11-25 08:51:35,536 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:51:35,537 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, 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] [2019-11-25 08:51:35,537 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:51:35,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:35,537 INFO L82 PathProgramCache]: Analyzing trace with hash -319778261, now seen corresponding path program 1 times [2019-11-25 08:51:35,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:35,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217438271] [2019-11-25 08:51:35,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:35,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:35,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1422 backedges. 733 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-25 08:51:35,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217438271] [2019-11-25 08:51:35,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:51:35,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:51:35,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664911926] [2019-11-25 08:51:35,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:51:35,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:51:35,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:51:35,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:51:35,687 INFO L87 Difference]: Start difference. First operand 5591 states and 7204 transitions. Second operand 3 states. [2019-11-25 08:51:35,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:51:35,959 INFO L93 Difference]: Finished difference Result 11779 states and 15109 transitions. [2019-11-25 08:51:35,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:51:35,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 337 [2019-11-25 08:51:35,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:51:35,975 INFO L225 Difference]: With dead ends: 11779 [2019-11-25 08:51:35,975 INFO L226 Difference]: Without dead ends: 6197 [2019-11-25 08:51:35,983 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:51:35,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6197 states. [2019-11-25 08:51:36,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6197 to 5765. [2019-11-25 08:51:36,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5765 states. [2019-11-25 08:51:36,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5765 states to 5765 states and 7438 transitions. [2019-11-25 08:51:36,155 INFO L78 Accepts]: Start accepts. Automaton has 5765 states and 7438 transitions. Word has length 337 [2019-11-25 08:51:36,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:51:36,155 INFO L462 AbstractCegarLoop]: Abstraction has 5765 states and 7438 transitions. [2019-11-25 08:51:36,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:51:36,156 INFO L276 IsEmpty]: Start isEmpty. Operand 5765 states and 7438 transitions. [2019-11-25 08:51:36,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-11-25 08:51:36,169 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:51:36,170 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, 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:51:36,170 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:51:36,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:36,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1517002467, now seen corresponding path program 1 times [2019-11-25 08:51:36,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:36,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350246454] [2019-11-25 08:51:36,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:36,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 957 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-25 08:51:36,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350246454] [2019-11-25 08:51:36,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257685832] [2019-11-25 08:51:36,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b02af7f-3347-4106-8bdb-bb7efe29454f/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:51:36,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:36,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:51:36,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:51:36,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 957 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-25 08:51:36,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:51:36,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-25 08:51:36,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87002298] [2019-11-25 08:51:36,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:51:36,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:51:36,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:51:36,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:51:36,677 INFO L87 Difference]: Start difference. First operand 5765 states and 7438 transitions. Second operand 4 states. [2019-11-25 08:51:37,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:51:37,085 INFO L93 Difference]: Finished difference Result 13053 states and 16776 transitions. [2019-11-25 08:51:37,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:51:37,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 375 [2019-11-25 08:51:37,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:51:37,101 INFO L225 Difference]: With dead ends: 13053 [2019-11-25 08:51:37,101 INFO L226 Difference]: Without dead ends: 7284 [2019-11-25 08:51:37,109 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 377 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:51:37,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7284 states. [2019-11-25 08:51:37,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7284 to 5912. [2019-11-25 08:51:37,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5912 states. [2019-11-25 08:51:37,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5912 states to 5912 states and 7555 transitions. [2019-11-25 08:51:37,276 INFO L78 Accepts]: Start accepts. Automaton has 5912 states and 7555 transitions. Word has length 375 [2019-11-25 08:51:37,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:51:37,277 INFO L462 AbstractCegarLoop]: Abstraction has 5912 states and 7555 transitions. [2019-11-25 08:51:37,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:51:37,277 INFO L276 IsEmpty]: Start isEmpty. Operand 5912 states and 7555 transitions. [2019-11-25 08:51:37,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2019-11-25 08:51:37,290 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:51:37,290 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, 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] [2019-11-25 08:51:37,494 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:51:37,495 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:51:37,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:37,495 INFO L82 PathProgramCache]: Analyzing trace with hash 934852515, now seen corresponding path program 1 times [2019-11-25 08:51:37,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:37,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706618115] [2019-11-25 08:51:37,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:37,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1972 backedges. 887 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-11-25 08:51:37,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706618115] [2019-11-25 08:51:37,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:51:37,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:51:37,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852415002] [2019-11-25 08:51:37,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:51:37,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:51:37,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:51:37,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:51:37,732 INFO L87 Difference]: Start difference. First operand 5912 states and 7555 transitions. Second operand 3 states. [2019-11-25 08:51:37,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:51:37,938 INFO L93 Difference]: Finished difference Result 11428 states and 14363 transitions. [2019-11-25 08:51:37,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:51:37,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 414 [2019-11-25 08:51:37,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:51:37,945 INFO L225 Difference]: With dead ends: 11428 [2019-11-25 08:51:37,945 INFO L226 Difference]: Without dead ends: 3254 [2019-11-25 08:51:37,953 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:51:37,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3254 states. [2019-11-25 08:51:38,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3254 to 3162. [2019-11-25 08:51:38,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3162 states. [2019-11-25 08:51:38,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3162 states to 3162 states and 3995 transitions. [2019-11-25 08:51:38,033 INFO L78 Accepts]: Start accepts. Automaton has 3162 states and 3995 transitions. Word has length 414 [2019-11-25 08:51:38,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:51:38,033 INFO L462 AbstractCegarLoop]: Abstraction has 3162 states and 3995 transitions. [2019-11-25 08:51:38,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:51:38,034 INFO L276 IsEmpty]: Start isEmpty. Operand 3162 states and 3995 transitions. [2019-11-25 08:51:38,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2019-11-25 08:51:38,045 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:51:38,046 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 16, 16, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:38,046 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:51:38,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:38,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1275695783, now seen corresponding path program 1 times [2019-11-25 08:51:38,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:38,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391584685] [2019-11-25 08:51:38,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:38,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1481 proven. 14 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2019-11-25 08:51:38,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391584685] [2019-11-25 08:51:38,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539580382] [2019-11-25 08:51:38,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b02af7f-3347-4106-8bdb-bb7efe29454f/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:51:38,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:38,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:51:38,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:51:38,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1481 proven. 14 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2019-11-25 08:51:38,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:51:38,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-25 08:51:38,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687420460] [2019-11-25 08:51:38,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:51:38,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:51:38,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:51:38,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:51:38,717 INFO L87 Difference]: Start difference. First operand 3162 states and 3995 transitions. Second operand 4 states. [2019-11-25 08:51:38,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:51:38,921 INFO L93 Difference]: Finished difference Result 3822 states and 4839 transitions. [2019-11-25 08:51:38,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:51:38,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 481 [2019-11-25 08:51:38,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:51:38,922 INFO L225 Difference]: With dead ends: 3822 [2019-11-25 08:51:38,922 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 08:51:38,926 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 483 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:51:38,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 08:51:38,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 08:51:38,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 08:51:38,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 08:51:38,927 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 481 [2019-11-25 08:51:38,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:51:38,927 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:51:38,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:51:38,927 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:51:38,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 08:51:39,131 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:51:39,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-25 08:51:39,595 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 283 DAG size of output: 84 [2019-11-25 08:51:40,516 WARN L192 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 46 [2019-11-25 08:51:40,620 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 17 [2019-11-25 08:51:40,638 INFO L440 ceAbstractionStarter]: At program point L168(lines 164 498) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1))) [2019-11-25 08:51:40,639 INFO L440 ceAbstractionStarter]: At program point L102(lines 101 519) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (= 12292 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-25 08:51:40,639 INFO L444 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2019-11-25 08:51:40,639 INFO L444 ceAbstractionStarter]: For program point L466-2(lines 466 468) no Hoare annotation was computed. [2019-11-25 08:51:40,639 INFO L444 ceAbstractionStarter]: For program point L434(lines 434 438) no Hoare annotation was computed. [2019-11-25 08:51:40,639 INFO L444 ceAbstractionStarter]: For program point L434-2(lines 434 438) no Hoare annotation was computed. [2019-11-25 08:51:40,639 INFO L444 ceAbstractionStarter]: For program point L335(lines 335 339) no Hoare annotation was computed. [2019-11-25 08:51:40,639 INFO L444 ceAbstractionStarter]: For program point L335-2(lines 335 339) no Hoare annotation was computed. [2019-11-25 08:51:40,639 INFO L444 ceAbstractionStarter]: For program point L170(lines 170 496) no Hoare annotation was computed. [2019-11-25 08:51:40,639 INFO L444 ceAbstractionStarter]: For program point L137(lines 137 507) no Hoare annotation was computed. [2019-11-25 08:51:40,639 INFO L444 ceAbstractionStarter]: For program point L104(lines 104 518) no Hoare annotation was computed. [2019-11-25 08:51:40,639 INFO L440 ceAbstractionStarter]: At program point L138(lines 134 508) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) [2019-11-25 08:51:40,640 INFO L444 ceAbstractionStarter]: For program point L304(lines 304 306) no Hoare annotation was computed. [2019-11-25 08:51:40,640 INFO L444 ceAbstractionStarter]: For program point L271(lines 271 275) no Hoare annotation was computed. [2019-11-25 08:51:40,640 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 241) no Hoare annotation was computed. [2019-11-25 08:51:40,640 INFO L444 ceAbstractionStarter]: For program point L304-2(lines 201 484) no Hoare annotation was computed. [2019-11-25 08:51:40,640 INFO L444 ceAbstractionStarter]: For program point L271-2(lines 271 275) no Hoare annotation was computed. [2019-11-25 08:51:40,640 INFO L444 ceAbstractionStarter]: For program point L404(lines 404 406) no Hoare annotation was computed. [2019-11-25 08:51:40,640 INFO L444 ceAbstractionStarter]: For program point L371(lines 371 373) no Hoare annotation was computed. [2019-11-25 08:51:40,640 INFO L440 ceAbstractionStarter]: At program point L206(lines 104 518) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) [2019-11-25 08:51:40,640 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 495) no Hoare annotation was computed. [2019-11-25 08:51:40,640 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 506) no Hoare annotation was computed. [2019-11-25 08:51:40,640 INFO L444 ceAbstractionStarter]: For program point L107(lines 107 517) no Hoare annotation was computed. [2019-11-25 08:51:40,641 INFO L440 ceAbstractionStarter]: At program point L174(lines 170 496) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1))) [2019-11-25 08:51:40,641 INFO L444 ceAbstractionStarter]: For program point L472(lines 472 474) no Hoare annotation was computed. [2019-11-25 08:51:40,641 INFO L444 ceAbstractionStarter]: For program point L472-2(lines 472 474) no Hoare annotation was computed. [2019-11-25 08:51:40,641 INFO L447 ceAbstractionStarter]: At program point L539(lines 97 540) the Hoare annotation is: true [2019-11-25 08:51:40,641 INFO L444 ceAbstractionStarter]: For program point L176(lines 176 494) no Hoare annotation was computed. [2019-11-25 08:51:40,641 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 505) no Hoare annotation was computed. [2019-11-25 08:51:40,641 INFO L444 ceAbstractionStarter]: For program point L110(lines 110 516) no Hoare annotation was computed. [2019-11-25 08:51:40,641 INFO L440 ceAbstractionStarter]: At program point L144(lines 140 506) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1))) [2019-11-25 08:51:40,641 INFO L444 ceAbstractionStarter]: For program point L211(lines 211 213) no Hoare annotation was computed. [2019-11-25 08:51:40,641 INFO L444 ceAbstractionStarter]: For program point L211-2(lines 211 213) no Hoare annotation was computed. [2019-11-25 08:51:40,641 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 493) no Hoare annotation was computed. [2019-11-25 08:51:40,641 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 504) no Hoare annotation was computed. [2019-11-25 08:51:40,641 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 515) no Hoare annotation was computed. [2019-11-25 08:51:40,642 INFO L444 ceAbstractionStarter]: For program point L477(lines 477 479) no Hoare annotation was computed. [2019-11-25 08:51:40,642 INFO L444 ceAbstractionStarter]: For program point L444(lines 444 455) no Hoare annotation was computed. [2019-11-25 08:51:40,642 INFO L444 ceAbstractionStarter]: For program point L411(lines 411 425) no Hoare annotation was computed. [2019-11-25 08:51:40,642 INFO L444 ceAbstractionStarter]: For program point L411-1(lines 411 425) no Hoare annotation was computed. [2019-11-25 08:51:40,642 INFO L444 ceAbstractionStarter]: For program point L444-2(lines 444 455) no Hoare annotation was computed. [2019-11-25 08:51:40,642 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 315) no Hoare annotation was computed. [2019-11-25 08:51:40,642 INFO L440 ceAbstractionStarter]: At program point L180(lines 176 494) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1))) [2019-11-25 08:51:40,642 INFO L444 ceAbstractionStarter]: For program point L544(lines 544 546) no Hoare annotation was computed. [2019-11-25 08:51:40,642 INFO L444 ceAbstractionStarter]: For program point L544-2(lines 544 546) no Hoare annotation was computed. [2019-11-25 08:51:40,642 INFO L444 ceAbstractionStarter]: For program point L347(lines 347 349) no Hoare annotation was computed. [2019-11-25 08:51:40,642 INFO L444 ceAbstractionStarter]: For program point L182(lines 182 492) no Hoare annotation was computed. [2019-11-25 08:51:40,642 INFO L444 ceAbstractionStarter]: For program point L149(lines 149 503) no Hoare annotation was computed. [2019-11-25 08:51:40,642 INFO L444 ceAbstractionStarter]: For program point L116(lines 116 514) no Hoare annotation was computed. [2019-11-25 08:51:40,643 INFO L444 ceAbstractionStarter]: For program point L381(lines 381 383) no Hoare annotation was computed. [2019-11-25 08:51:40,643 INFO L444 ceAbstractionStarter]: For program point L282(lines 282 296) no Hoare annotation was computed. [2019-11-25 08:51:40,643 INFO L444 ceAbstractionStarter]: For program point L216(lines 216 219) no Hoare annotation was computed. [2019-11-25 08:51:40,643 INFO L444 ceAbstractionStarter]: For program point L282-2(lines 282 296) no Hoare annotation was computed. [2019-11-25 08:51:40,643 INFO L440 ceAbstractionStarter]: At program point L150(lines 146 504) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1))) [2019-11-25 08:51:40,643 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 90) no Hoare annotation was computed. [2019-11-25 08:51:40,643 INFO L444 ceAbstractionStarter]: For program point L415(lines 415 421) no Hoare annotation was computed. [2019-11-25 08:51:40,643 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 252) no Hoare annotation was computed. [2019-11-25 08:51:40,643 INFO L444 ceAbstractionStarter]: For program point L250-2(lines 201 484) no Hoare annotation was computed. [2019-11-25 08:51:40,643 INFO L444 ceAbstractionStarter]: For program point L449(lines 449 452) no Hoare annotation was computed. [2019-11-25 08:51:40,643 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-25 08:51:40,643 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 491) no Hoare annotation was computed. [2019-11-25 08:51:40,643 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 502) no Hoare annotation was computed. [2019-11-25 08:51:40,644 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 513) no Hoare annotation was computed. [2019-11-25 08:51:40,644 INFO L447 ceAbstractionStarter]: At program point L549(lines 10 551) the Hoare annotation is: true [2019-11-25 08:51:40,644 INFO L440 ceAbstractionStarter]: At program point L186(lines 182 492) the Hoare annotation is: (let ((.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse2 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse2))) [2019-11-25 08:51:40,648 INFO L440 ceAbstractionStarter]: At program point L120(lines 116 514) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-25 08:51:40,648 INFO L444 ceAbstractionStarter]: For program point L87(lines 87 89) no Hoare annotation was computed. [2019-11-25 08:51:40,649 INFO L444 ceAbstractionStarter]: For program point L87-2(lines 84 90) no Hoare annotation was computed. [2019-11-25 08:51:40,649 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 292) no Hoare annotation was computed. [2019-11-25 08:51:40,649 INFO L440 ceAbstractionStarter]: At program point L485(lines 98 538) the Hoare annotation is: (let ((.cse7 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse8 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse9 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 3)) (.cse5 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse6 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse3 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse4 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse10 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse11 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (= 4368 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse2) (and (= 4416 ULTIMATE.start_ssl3_connect_~s__state~0) .cse7 .cse6) (and .cse8 .cse7 .cse6 .cse9) (and .cse0 (= 4384 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse8 .cse0 .cse9) (and .cse0 .cse1 .cse6) (and .cse0 .cse6 (= 4400 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse10 .cse11 .cse5 .cse6 .cse2) (and .cse3 .cse4 .cse0) (and .cse10 .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse11))) [2019-11-25 08:51:40,649 INFO L444 ceAbstractionStarter]: For program point L320(lines 320 322) no Hoare annotation was computed. [2019-11-25 08:51:40,649 INFO L444 ceAbstractionStarter]: For program point L188(lines 188 490) no Hoare annotation was computed. [2019-11-25 08:51:40,650 INFO L444 ceAbstractionStarter]: For program point L155(lines 155 501) no Hoare annotation was computed. [2019-11-25 08:51:40,650 INFO L444 ceAbstractionStarter]: For program point L122(lines 122 512) no Hoare annotation was computed. [2019-11-25 08:51:40,650 INFO L444 ceAbstractionStarter]: For program point L387(lines 387 391) no Hoare annotation was computed. [2019-11-25 08:51:40,650 INFO L440 ceAbstractionStarter]: At program point L321(lines 75 550) the Hoare annotation is: false [2019-11-25 08:51:40,650 INFO L444 ceAbstractionStarter]: For program point L387-2(lines 201 484) no Hoare annotation was computed. [2019-11-25 08:51:40,650 INFO L444 ceAbstractionStarter]: For program point L222(lines 222 233) no Hoare annotation was computed. [2019-11-25 08:51:40,650 INFO L444 ceAbstractionStarter]: For program point L222-2(lines 201 484) no Hoare annotation was computed. [2019-11-25 08:51:40,650 INFO L444 ceAbstractionStarter]: For program point L520(lines 520 536) no Hoare annotation was computed. [2019-11-25 08:51:40,651 INFO L444 ceAbstractionStarter]: For program point L289(lines 289 291) no Hoare annotation was computed. [2019-11-25 08:51:40,651 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-25 08:51:40,651 INFO L444 ceAbstractionStarter]: For program point L289-2(lines 284 296) no Hoare annotation was computed. [2019-11-25 08:51:40,651 INFO L444 ceAbstractionStarter]: For program point L521(lines 521 535) no Hoare annotation was computed. [2019-11-25 08:51:40,652 INFO L444 ceAbstractionStarter]: For program point L356(lines 356 358) no Hoare annotation was computed. [2019-11-25 08:51:40,652 INFO L444 ceAbstractionStarter]: For program point L323(lines 323 325) no Hoare annotation was computed. [2019-11-25 08:51:40,652 INFO L444 ceAbstractionStarter]: For program point L224(lines 224 227) no Hoare annotation was computed. [2019-11-25 08:51:40,654 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 489) no Hoare annotation was computed. [2019-11-25 08:51:40,654 INFO L444 ceAbstractionStarter]: For program point L158(lines 158 500) no Hoare annotation was computed. [2019-11-25 08:51:40,654 INFO L444 ceAbstractionStarter]: For program point L125(lines 125 511) no Hoare annotation was computed. [2019-11-25 08:51:40,654 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 96) no Hoare annotation was computed. [2019-11-25 08:51:40,655 INFO L444 ceAbstractionStarter]: For program point L522(lines 522 527) no Hoare annotation was computed. [2019-11-25 08:51:40,655 INFO L444 ceAbstractionStarter]: For program point L522-2(lines 521 535) no Hoare annotation was computed. [2019-11-25 08:51:40,655 INFO L444 ceAbstractionStarter]: For program point L258(lines 258 260) no Hoare annotation was computed. [2019-11-25 08:51:40,655 INFO L440 ceAbstractionStarter]: At program point L192(lines 188 490) the Hoare annotation is: (let ((.cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)))) [2019-11-25 08:51:40,655 INFO L440 ceAbstractionStarter]: At program point L126(lines 122 512) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-25 08:51:40,655 INFO L444 ceAbstractionStarter]: For program point L93(lines 93 95) no Hoare annotation was computed. [2019-11-25 08:51:40,656 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-25 08:51:40,656 INFO L444 ceAbstractionStarter]: For program point L524(lines 524 526) no Hoare annotation was computed. [2019-11-25 08:51:40,656 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 488) no Hoare annotation was computed. [2019-11-25 08:51:40,656 INFO L444 ceAbstractionStarter]: For program point L161(lines 161 499) no Hoare annotation was computed. [2019-11-25 08:51:40,656 INFO L444 ceAbstractionStarter]: For program point L128(lines 128 510) no Hoare annotation was computed. [2019-11-25 08:51:40,656 INFO L444 ceAbstractionStarter]: For program point L360(lines 360 365) no Hoare annotation was computed. [2019-11-25 08:51:40,656 INFO L444 ceAbstractionStarter]: For program point L360-2(lines 360 365) no Hoare annotation was computed. [2019-11-25 08:51:40,656 INFO L444 ceAbstractionStarter]: For program point L228(lines 228 231) no Hoare annotation was computed. [2019-11-25 08:51:40,657 INFO L440 ceAbstractionStarter]: At program point L195(lines 194 488) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse1))) [2019-11-25 08:51:40,657 INFO L440 ceAbstractionStarter]: At program point L162(lines 152 502) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1))) [2019-11-25 08:51:40,657 INFO L444 ceAbstractionStarter]: For program point L460-1(lines 460 462) no Hoare annotation was computed. [2019-11-25 08:51:40,657 INFO L447 ceAbstractionStarter]: At program point L560(lines 552 562) the Hoare annotation is: true [2019-11-25 08:51:40,657 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 487) no Hoare annotation was computed. [2019-11-25 08:51:40,657 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 498) no Hoare annotation was computed. [2019-11-25 08:51:40,658 INFO L444 ceAbstractionStarter]: For program point L131(lines 131 509) no Hoare annotation was computed. [2019-11-25 08:51:40,658 INFO L444 ceAbstractionStarter]: For program point L98-1(lines 75 550) no Hoare annotation was computed. [2019-11-25 08:51:40,658 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 548) no Hoare annotation was computed. [2019-11-25 08:51:40,658 INFO L444 ceAbstractionStarter]: For program point L396(lines 396 399) no Hoare annotation was computed. [2019-11-25 08:51:40,658 INFO L447 ceAbstractionStarter]: At program point L198(lines 197 487) the Hoare annotation is: true [2019-11-25 08:51:40,658 INFO L440 ceAbstractionStarter]: At program point L132(lines 128 510) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) [2019-11-25 08:51:40,658 INFO L444 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-25 08:51:40,659 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 533) no Hoare annotation was computed. [2019-11-25 08:51:40,659 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 267) no Hoare annotation was computed. [2019-11-25 08:51:40,659 INFO L444 ceAbstractionStarter]: For program point L265-2(lines 201 484) no Hoare annotation was computed. [2019-11-25 08:51:40,659 INFO L444 ceAbstractionStarter]: For program point L431(lines 431 433) no Hoare annotation was computed. [2019-11-25 08:51:40,659 INFO L444 ceAbstractionStarter]: For program point L332(lines 332 334) no Hoare annotation was computed. [2019-11-25 08:51:40,659 INFO L447 ceAbstractionStarter]: At program point L200(lines 199 487) the Hoare annotation is: true [2019-11-25 08:51:40,659 INFO L444 ceAbstractionStarter]: For program point L167(lines 167 497) no Hoare annotation was computed. [2019-11-25 08:51:40,659 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 508) no Hoare annotation was computed. [2019-11-25 08:51:40,660 INFO L444 ceAbstractionStarter]: For program point L101(lines 101 519) no Hoare annotation was computed. [2019-11-25 08:51:40,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:51:40 BoogieIcfgContainer [2019-11-25 08:51:40,700 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:51:40,701 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:51:40,701 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:51:40,701 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:51:40,708 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:51:28" (3/4) ... [2019-11-25 08:51:40,711 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 08:51:40,736 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-25 08:51:40,737 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 08:51:40,880 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0b02af7f-3347-4106-8bdb-bb7efe29454f/bin/uautomizer/witness.graphml [2019-11-25 08:51:40,880 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:51:40,881 INFO L168 Benchmark]: Toolchain (without parser) took 13673.20 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 680.0 MB). Free memory was 950.1 MB in the beginning and 1.2 GB in the end (delta: -289.1 MB). Peak memory consumption was 390.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:51:40,882 INFO L168 Benchmark]: CDTParser took 0.19 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:51:40,882 INFO L168 Benchmark]: CACSL2BoogieTranslator took 459.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -192.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:51:40,883 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:51:40,883 INFO L168 Benchmark]: Boogie Preprocessor took 38.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:51:40,883 INFO L168 Benchmark]: RCFGBuilder took 778.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 55.9 MB). Peak memory consumption was 55.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:51:40,884 INFO L168 Benchmark]: TraceAbstraction took 12161.42 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 536.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -184.3 MB). Peak memory consumption was 352.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:51:40,884 INFO L168 Benchmark]: Witness Printer took 179.27 ms. Allocated memory is still 1.7 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:51:40,886 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.19 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 459.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -192.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 778.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 55.9 MB). Peak memory consumption was 55.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12161.42 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 536.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -184.3 MB). Peak memory consumption was 352.5 MB. Max. memory is 11.5 GB. * Witness Printer took 179.27 ms. Allocated memory is still 1.7 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 548]: 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: 182]: Loop Invariant Derived loop invariant: ((((s__state <= 4560 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state) || (((s__state <= 4560 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4432 <= s__state)) || ((s__state <= 4560 && blastFlag <= 2) && 4432 <= s__state) - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state) || ((s__state <= 4528 && blastFlag <= 2) && 4432 <= s__state) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: blastFlag <= 2 && 12292 == s__state - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state) || ((s__state <= 4528 && blastFlag <= 2) && 4432 <= s__state) - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: (s__state <= 4528 && blastFlag <= 2) && 4352 <= s__state - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state) || ((s__state <= 4528 && blastFlag <= 2) && 4432 <= s__state) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((s__state <= 4528 && blastFlag <= 4) && 4352 <= s__state) && 0 == s__hit - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: ((((4560 <= s__state && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) || ((4560 <= s__state && s__state <= 4560) && blastFlag <= 2) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state) || ((s__state <= 4528 && blastFlag <= 2) && 4432 <= s__state) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state) || ((s__state <= 4528 && blastFlag <= 2) && 4432 <= s__state) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (s__state <= 4528 && blastFlag <= 2) && 4352 <= s__state - InvariantResult [Line: 552]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: ((((s__state <= 4352 && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) || (((s__state <= 4352 && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state) - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: s__state <= 4560 && blastFlag <= 2 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: (((((((((((blastFlag <= 2 && 4368 == s__state) || (s__state <= 3 && 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)) || (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state)) || (blastFlag <= 2 && 4384 == s__state)) || ((s__state <= 4528 && blastFlag <= 2) && 4432 <= s__state)) || ((blastFlag <= 2 && s__state <= 3) && 0 == s__hit)) || ((blastFlag <= 2 && 0 == s__hit) && 4400 == 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)) || ((4560 <= s__state && s__state <= 4560) && blastFlag <= 2)) || (((s__state <= 4352 && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state) - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state) || ((s__state <= 4528 && blastFlag <= 2) && 4432 <= s__state) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: ((s__state <= 4528 && blastFlag <= 2) && 4352 <= s__state) && 0 == s__hit - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 127 locations, 1 error locations. Result: SAFE, OverallTime: 12.0s, OverallIterations: 24, TraceHistogramMax: 18, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, HoareTripleCheckerStatistics: 4515 SDtfs, 1551 SDslu, 2498 SDs, 0 SdLazy, 2467 SolverSat, 458 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1264 GetRequests, 1234 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5912occurred in iteration=22, 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, 24 MinimizatonAttempts, 4422 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 177 NumberOfFragments, 434 HoareAnnotationTreeSize, 22 FomulaSimplifications, 10346 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 22 FomulaSimplificationsInter, 1463 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 6366 NumberOfCodeBlocks, 6366 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 6339 ConstructedInterpolants, 0 QuantifiedInterpolants, 2477651 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2052 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 27 InterpolantComputations, 21 PerfectInterpolantSequences, 23271/23337 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...