./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_clnt_2.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_10c4e6d5-612b-4121-aa2b-fe98fa4d0d64/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_10c4e6d5-612b-4121-aa2b-fe98fa4d0d64/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_10c4e6d5-612b-4121-aa2b-fe98fa4d0d64/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_10c4e6d5-612b-4121-aa2b-fe98fa4d0d64/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_clnt_2.cil-2.c -s /tmp/vcloud-vcloud-master/worker/working_dir_10c4e6d5-612b-4121-aa2b-fe98fa4d0d64/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_10c4e6d5-612b-4121-aa2b-fe98fa4d0d64/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 3a89f3efa36fac9644afad22cbb4a1df6ecb6a58 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:01:40,226 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:01:40,228 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:01:40,236 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:01:40,237 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:01:40,237 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:01:40,238 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:01:40,240 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:01:40,241 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:01:40,241 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:01:40,242 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:01:40,243 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:01:40,243 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:01:40,244 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:01:40,245 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:01:40,246 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:01:40,248 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:01:40,249 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:01:40,250 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:01:40,252 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:01:40,260 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:01:40,261 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:01:40,262 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:01:40,263 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:01:40,265 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:01:40,265 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:01:40,266 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:01:40,266 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:01:40,267 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:01:40,269 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:01:40,269 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:01:40,270 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:01:40,271 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:01:40,272 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:01:40,273 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:01:40,273 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:01:40,273 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:01:40,274 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:01:40,274 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:01:40,275 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:01:40,275 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:01:40,276 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_10c4e6d5-612b-4121-aa2b-fe98fa4d0d64/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 09:01:40,291 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:01:40,291 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:01:40,292 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:01:40,292 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:01:40,292 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:01:40,292 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:01:40,292 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:01:40,293 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:01:40,293 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:01:40,293 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:01:40,293 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 09:01:40,293 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 09:01:40,293 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 09:01:40,293 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:01:40,293 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:01:40,294 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:01:40,294 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 09:01:40,294 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:01:40,294 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:01:40,294 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 09:01:40,294 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 09:01:40,294 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 09:01:40,295 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:01:40,295 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 09:01:40,296 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 09:01:40,296 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:01:40,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 09:01:40,296 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 09:01:40,296 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/working_dir_10c4e6d5-612b-4121-aa2b-fe98fa4d0d64/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 -> 3a89f3efa36fac9644afad22cbb4a1df6ecb6a58 [2019-10-22 09:01:40,332 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:01:40,349 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:01:40,352 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:01:40,355 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:01:40,355 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:01:40,356 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_10c4e6d5-612b-4121-aa2b-fe98fa4d0d64/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_clnt_2.cil-2.c [2019-10-22 09:01:40,404 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_10c4e6d5-612b-4121-aa2b-fe98fa4d0d64/bin/uautomizer/data/c205d1898/6bdfed68f1e54d99ac565c5f5f07e7f5/FLAGebdf7efe8 [2019-10-22 09:01:40,829 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:01:40,829 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_10c4e6d5-612b-4121-aa2b-fe98fa4d0d64/sv-benchmarks/c/ssh-simplified/s3_clnt_2.cil-2.c [2019-10-22 09:01:40,837 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_10c4e6d5-612b-4121-aa2b-fe98fa4d0d64/bin/uautomizer/data/c205d1898/6bdfed68f1e54d99ac565c5f5f07e7f5/FLAGebdf7efe8 [2019-10-22 09:01:40,848 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_10c4e6d5-612b-4121-aa2b-fe98fa4d0d64/bin/uautomizer/data/c205d1898/6bdfed68f1e54d99ac565c5f5f07e7f5 [2019-10-22 09:01:40,850 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:01:40,851 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:01:40,852 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:40,852 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:01:40,856 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:01:40,857 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:40" (1/1) ... [2019-10-22 09:01:40,859 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fb5fa4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:40, skipping insertion in model container [2019-10-22 09:01:40,860 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:40" (1/1) ... [2019-10-22 09:01:40,867 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:01:40,915 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:01:41,159 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:41,163 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:01:41,237 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:41,253 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:01:41,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:41 WrapperNode [2019-10-22 09:01:41,253 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:41,254 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:41,254 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:01:41,254 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:01:41,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:41" (1/1) ... [2019-10-22 09:01:41,267 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:41" (1/1) ... [2019-10-22 09:01:41,313 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:41,318 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:01:41,318 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:01:41,318 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:01:41,328 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:41" (1/1) ... [2019-10-22 09:01:41,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:41" (1/1) ... [2019-10-22 09:01:41,331 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:41" (1/1) ... [2019-10-22 09:01:41,331 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:41" (1/1) ... [2019-10-22 09:01:41,337 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:41" (1/1) ... [2019-10-22 09:01:41,348 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:41" (1/1) ... [2019-10-22 09:01:41,349 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:41" (1/1) ... [2019-10-22 09:01:41,360 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:01:41,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:01:41,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:01:41,361 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:01:41,362 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10c4e6d5-612b-4121-aa2b-fe98fa4d0d64/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-10-22 09:01:41,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:01:41,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:01:41,642 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 09:01:42,132 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-10-22 09:01:42,132 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-10-22 09:01:42,134 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:01:42,134 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 09:01:42,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:42 BoogieIcfgContainer [2019-10-22 09:01:42,135 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:01:42,136 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 09:01:42,136 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 09:01:42,139 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 09:01:42,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 09:01:40" (1/3) ... [2019-10-22 09:01:42,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38764bef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:01:42, skipping insertion in model container [2019-10-22 09:01:42,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:41" (2/3) ... [2019-10-22 09:01:42,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38764bef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:01:42, skipping insertion in model container [2019-10-22 09:01:42,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:42" (3/3) ... [2019-10-22 09:01:42,143 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.cil-2.c [2019-10-22 09:01:42,152 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 09:01:42,159 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 09:01:42,170 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 09:01:42,193 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 09:01:42,193 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 09:01:42,193 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 09:01:42,194 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:01:42,194 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:01:42,194 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 09:01:42,194 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:01:42,194 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 09:01:42,209 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2019-10-22 09:01:42,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 09:01:42,215 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:42,216 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:42,218 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:42,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:42,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1449576961, now seen corresponding path program 1 times [2019-10-22 09:01:42,230 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:42,230 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635251754] [2019-10-22 09:01:42,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:42,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:42,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:42,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:42,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:42,381 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635251754] [2019-10-22 09:01:42,381 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:42,382 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:01:42,382 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199921970] [2019-10-22 09:01:42,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:42,386 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:42,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:42,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:42,398 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 3 states. [2019-10-22 09:01:42,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:42,549 INFO L93 Difference]: Finished difference Result 251 states and 426 transitions. [2019-10-22 09:01:42,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:42,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-22 09:01:42,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:42,564 INFO L225 Difference]: With dead ends: 251 [2019-10-22 09:01:42,564 INFO L226 Difference]: Without dead ends: 114 [2019-10-22 09:01:42,568 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:42,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-10-22 09:01:42,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-10-22 09:01:42,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-10-22 09:01:42,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 171 transitions. [2019-10-22 09:01:42,628 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 171 transitions. Word has length 23 [2019-10-22 09:01:42,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:42,628 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 171 transitions. [2019-10-22 09:01:42,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:42,629 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 171 transitions. [2019-10-22 09:01:42,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 09:01:42,630 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:42,630 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:42,630 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:42,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:42,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1395170557, now seen corresponding path program 1 times [2019-10-22 09:01:42,631 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:42,631 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276566947] [2019-10-22 09:01:42,639 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:42,639 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:42,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:42,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:42,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:42,740 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276566947] [2019-10-22 09:01:42,740 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:42,740 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:42,740 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191498967] [2019-10-22 09:01:42,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:42,742 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:42,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:42,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:42,743 INFO L87 Difference]: Start difference. First operand 114 states and 171 transitions. Second operand 3 states. [2019-10-22 09:01:42,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:42,934 INFO L93 Difference]: Finished difference Result 238 states and 361 transitions. [2019-10-22 09:01:42,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:42,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-22 09:01:42,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:42,936 INFO L225 Difference]: With dead ends: 238 [2019-10-22 09:01:42,936 INFO L226 Difference]: Without dead ends: 133 [2019-10-22 09:01:42,937 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:42,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-10-22 09:01:42,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2019-10-22 09:01:42,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-10-22 09:01:42,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 191 transitions. [2019-10-22 09:01:42,948 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 191 transitions. Word has length 36 [2019-10-22 09:01:42,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:42,948 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 191 transitions. [2019-10-22 09:01:42,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:42,948 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 191 transitions. [2019-10-22 09:01:42,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-22 09:01:42,949 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:42,950 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:42,950 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:42,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:42,950 INFO L82 PathProgramCache]: Analyzing trace with hash -134115002, now seen corresponding path program 1 times [2019-10-22 09:01:42,950 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:42,951 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786908294] [2019-10-22 09:01:42,951 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:42,951 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:42,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:42,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:43,040 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 09:01:43,043 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786908294] [2019-10-22 09:01:43,044 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:43,044 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:43,044 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763657861] [2019-10-22 09:01:43,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:43,045 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:43,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:43,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:43,045 INFO L87 Difference]: Start difference. First operand 129 states and 191 transitions. Second operand 3 states. [2019-10-22 09:01:43,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:43,163 INFO L93 Difference]: Finished difference Result 270 states and 405 transitions. [2019-10-22 09:01:43,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:43,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-10-22 09:01:43,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:43,165 INFO L225 Difference]: With dead ends: 270 [2019-10-22 09:01:43,165 INFO L226 Difference]: Without dead ends: 150 [2019-10-22 09:01:43,166 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:43,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-10-22 09:01:43,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2019-10-22 09:01:43,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-10-22 09:01:43,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 213 transitions. [2019-10-22 09:01:43,175 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 213 transitions. Word has length 50 [2019-10-22 09:01:43,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:43,176 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 213 transitions. [2019-10-22 09:01:43,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:43,176 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 213 transitions. [2019-10-22 09:01:43,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-22 09:01:43,177 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:43,178 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:43,178 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:43,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:43,178 INFO L82 PathProgramCache]: Analyzing trace with hash -121422705, now seen corresponding path program 1 times [2019-10-22 09:01:43,178 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:43,179 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406153618] [2019-10-22 09:01:43,179 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:43,179 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:43,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:43,239 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-22 09:01:43,239 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406153618] [2019-10-22 09:01:43,240 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:43,240 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:43,240 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9167529] [2019-10-22 09:01:43,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:43,241 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:43,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:43,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:43,241 INFO L87 Difference]: Start difference. First operand 146 states and 213 transitions. Second operand 3 states. [2019-10-22 09:01:43,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:43,414 INFO L93 Difference]: Finished difference Result 334 states and 502 transitions. [2019-10-22 09:01:43,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:43,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-10-22 09:01:43,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:43,417 INFO L225 Difference]: With dead ends: 334 [2019-10-22 09:01:43,417 INFO L226 Difference]: Without dead ends: 196 [2019-10-22 09:01:43,418 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:43,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-10-22 09:01:43,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 187. [2019-10-22 09:01:43,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-10-22 09:01:43,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 263 transitions. [2019-10-22 09:01:43,430 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 263 transitions. Word has length 67 [2019-10-22 09:01:43,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:43,430 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 263 transitions. [2019-10-22 09:01:43,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:43,431 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 263 transitions. [2019-10-22 09:01:43,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-22 09:01:43,433 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:43,433 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:43,433 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:43,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:43,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1926861039, now seen corresponding path program 1 times [2019-10-22 09:01:43,434 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:43,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711726063] [2019-10-22 09:01:43,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:43,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:43,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:43,510 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-22 09:01:43,511 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711726063] [2019-10-22 09:01:43,511 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:43,511 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:43,512 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770807719] [2019-10-22 09:01:43,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:43,513 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:43,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:43,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:43,514 INFO L87 Difference]: Start difference. First operand 187 states and 263 transitions. Second operand 3 states. [2019-10-22 09:01:43,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:43,648 INFO L93 Difference]: Finished difference Result 389 states and 554 transitions. [2019-10-22 09:01:43,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:43,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-10-22 09:01:43,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:43,650 INFO L225 Difference]: With dead ends: 389 [2019-10-22 09:01:43,651 INFO L226 Difference]: Without dead ends: 211 [2019-10-22 09:01:43,651 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:43,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-10-22 09:01:43,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2019-10-22 09:01:43,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-10-22 09:01:43,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 287 transitions. [2019-10-22 09:01:43,670 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 287 transitions. Word has length 67 [2019-10-22 09:01:43,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:43,671 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 287 transitions. [2019-10-22 09:01:43,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:43,671 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 287 transitions. [2019-10-22 09:01:43,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 09:01:43,672 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:43,673 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:43,673 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:43,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:43,673 INFO L82 PathProgramCache]: Analyzing trace with hash 398996882, now seen corresponding path program 1 times [2019-10-22 09:01:43,674 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:43,674 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331491598] [2019-10-22 09:01:43,674 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:43,674 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:43,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:43,783 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-22 09:01:43,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331491598] [2019-10-22 09:01:43,783 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:43,784 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:43,784 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388592216] [2019-10-22 09:01:43,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:43,784 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:43,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:43,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:43,785 INFO L87 Difference]: Start difference. First operand 206 states and 287 transitions. Second operand 3 states. [2019-10-22 09:01:43,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:43,903 INFO L93 Difference]: Finished difference Result 427 states and 603 transitions. [2019-10-22 09:01:43,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:43,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-10-22 09:01:43,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:43,905 INFO L225 Difference]: With dead ends: 427 [2019-10-22 09:01:43,905 INFO L226 Difference]: Without dead ends: 230 [2019-10-22 09:01:43,905 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:43,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-10-22 09:01:43,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2019-10-22 09:01:43,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-10-22 09:01:43,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 313 transitions. [2019-10-22 09:01:43,913 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 313 transitions. Word has length 84 [2019-10-22 09:01:43,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:43,913 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 313 transitions. [2019-10-22 09:01:43,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:43,914 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 313 transitions. [2019-10-22 09:01:43,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-22 09:01:43,915 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:43,915 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:43,915 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:43,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:43,916 INFO L82 PathProgramCache]: Analyzing trace with hash 90409290, now seen corresponding path program 1 times [2019-10-22 09:01:43,916 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:43,916 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164972587] [2019-10-22 09:01:43,916 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:43,916 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:43,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:43,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:43,960 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-22 09:01:43,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164972587] [2019-10-22 09:01:43,960 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:43,961 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:43,961 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242124480] [2019-10-22 09:01:43,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:43,961 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:43,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:43,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:43,962 INFO L87 Difference]: Start difference. First operand 227 states and 313 transitions. Second operand 3 states. [2019-10-22 09:01:44,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:44,002 INFO L93 Difference]: Finished difference Result 661 states and 912 transitions. [2019-10-22 09:01:44,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:44,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-10-22 09:01:44,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:44,006 INFO L225 Difference]: With dead ends: 661 [2019-10-22 09:01:44,006 INFO L226 Difference]: Without dead ends: 443 [2019-10-22 09:01:44,006 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:44,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-10-22 09:01:44,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2019-10-22 09:01:44,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-10-22 09:01:44,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 609 transitions. [2019-10-22 09:01:44,022 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 609 transitions. Word has length 104 [2019-10-22 09:01:44,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:44,023 INFO L462 AbstractCegarLoop]: Abstraction has 443 states and 609 transitions. [2019-10-22 09:01:44,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:44,023 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 609 transitions. [2019-10-22 09:01:44,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-22 09:01:44,024 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:44,024 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:44,024 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:44,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:44,025 INFO L82 PathProgramCache]: Analyzing trace with hash 935055156, now seen corresponding path program 1 times [2019-10-22 09:01:44,025 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:44,025 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551613249] [2019-10-22 09:01:44,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:44,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:44,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:44,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:44,085 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-22 09:01:44,088 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551613249] [2019-10-22 09:01:44,088 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:44,088 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:44,088 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318312021] [2019-10-22 09:01:44,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:44,089 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:44,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:44,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:44,089 INFO L87 Difference]: Start difference. First operand 443 states and 609 transitions. Second operand 3 states. [2019-10-22 09:01:44,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:44,125 INFO L93 Difference]: Finished difference Result 661 states and 909 transitions. [2019-10-22 09:01:44,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:44,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-10-22 09:01:44,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:44,128 INFO L225 Difference]: With dead ends: 661 [2019-10-22 09:01:44,128 INFO L226 Difference]: Without dead ends: 659 [2019-10-22 09:01:44,128 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:44,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-10-22 09:01:44,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2019-10-22 09:01:44,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-10-22 09:01:44,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 907 transitions. [2019-10-22 09:01:44,152 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 907 transitions. Word has length 106 [2019-10-22 09:01:44,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:44,153 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 907 transitions. [2019-10-22 09:01:44,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:44,153 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 907 transitions. [2019-10-22 09:01:44,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-22 09:01:44,156 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:44,156 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-10-22 09:01:44,156 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:44,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:44,157 INFO L82 PathProgramCache]: Analyzing trace with hash -365763014, now seen corresponding path program 1 times [2019-10-22 09:01:44,157 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:44,157 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143955909] [2019-10-22 09:01:44,157 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:44,157 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:44,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:44,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:44,241 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 311 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-10-22 09:01:44,242 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143955909] [2019-10-22 09:01:44,243 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:44,243 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:44,243 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618612561] [2019-10-22 09:01:44,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:44,243 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:44,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:44,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:44,244 INFO L87 Difference]: Start difference. First operand 659 states and 907 transitions. Second operand 3 states. [2019-10-22 09:01:44,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:44,395 INFO L93 Difference]: Finished difference Result 1462 states and 2068 transitions. [2019-10-22 09:01:44,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:44,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-10-22 09:01:44,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:44,398 INFO L225 Difference]: With dead ends: 1462 [2019-10-22 09:01:44,398 INFO L226 Difference]: Without dead ends: 809 [2019-10-22 09:01:44,399 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:44,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2019-10-22 09:01:44,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 776. [2019-10-22 09:01:44,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-10-22 09:01:44,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1096 transitions. [2019-10-22 09:01:44,415 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1096 transitions. Word has length 175 [2019-10-22 09:01:44,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:44,416 INFO L462 AbstractCegarLoop]: Abstraction has 776 states and 1096 transitions. [2019-10-22 09:01:44,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:44,416 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1096 transitions. [2019-10-22 09:01:44,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-10-22 09:01:44,418 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:44,418 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:44,419 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:44,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:44,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1933345798, now seen corresponding path program 2 times [2019-10-22 09:01:44,419 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:44,419 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446163905] [2019-10-22 09:01:44,420 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:44,420 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:44,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:44,466 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-10-22 09:01:44,466 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446163905] [2019-10-22 09:01:44,466 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:44,466 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:44,467 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022035247] [2019-10-22 09:01:44,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:44,467 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:44,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:44,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:44,468 INFO L87 Difference]: Start difference. First operand 776 states and 1096 transitions. Second operand 3 states. [2019-10-22 09:01:44,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:44,619 INFO L93 Difference]: Finished difference Result 1824 states and 2649 transitions. [2019-10-22 09:01:44,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:44,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-10-22 09:01:44,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:44,623 INFO L225 Difference]: With dead ends: 1824 [2019-10-22 09:01:44,623 INFO L226 Difference]: Without dead ends: 1006 [2019-10-22 09:01:44,624 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:44,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2019-10-22 09:01:44,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 965. [2019-10-22 09:01:44,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-10-22 09:01:44,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1348 transitions. [2019-10-22 09:01:44,656 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1348 transitions. Word has length 188 [2019-10-22 09:01:44,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:44,656 INFO L462 AbstractCegarLoop]: Abstraction has 965 states and 1348 transitions. [2019-10-22 09:01:44,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:44,656 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1348 transitions. [2019-10-22 09:01:44,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-22 09:01:44,659 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:44,659 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:44,659 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:44,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:44,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1781023665, now seen corresponding path program 1 times [2019-10-22 09:01:44,660 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:44,660 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070750912] [2019-10-22 09:01:44,660 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:44,660 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:44,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:44,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:44,713 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-10-22 09:01:44,713 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070750912] [2019-10-22 09:01:44,713 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:44,714 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:44,714 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325327963] [2019-10-22 09:01:44,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:44,714 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:44,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:44,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:44,715 INFO L87 Difference]: Start difference. First operand 965 states and 1348 transitions. Second operand 3 states. [2019-10-22 09:01:44,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:44,845 INFO L93 Difference]: Finished difference Result 2080 states and 2926 transitions. [2019-10-22 09:01:44,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:44,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-10-22 09:01:44,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:44,849 INFO L225 Difference]: With dead ends: 2080 [2019-10-22 09:01:44,849 INFO L226 Difference]: Without dead ends: 1079 [2019-10-22 09:01:44,850 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:44,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-10-22 09:01:44,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1040. [2019-10-22 09:01:44,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1040 states. [2019-10-22 09:01:44,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1444 transitions. [2019-10-22 09:01:44,869 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1444 transitions. Word has length 209 [2019-10-22 09:01:44,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:44,870 INFO L462 AbstractCegarLoop]: Abstraction has 1040 states and 1444 transitions. [2019-10-22 09:01:44,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:44,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1444 transitions. [2019-10-22 09:01:44,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-22 09:01:44,873 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:44,873 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:44,873 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:44,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:44,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1647744508, now seen corresponding path program 1 times [2019-10-22 09:01:44,873 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:44,873 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344717358] [2019-10-22 09:01:44,874 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:44,874 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:44,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:44,939 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-10-22 09:01:44,939 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344717358] [2019-10-22 09:01:44,939 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:44,939 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:44,940 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320009207] [2019-10-22 09:01:44,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:44,940 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:44,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:44,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:44,940 INFO L87 Difference]: Start difference. First operand 1040 states and 1444 transitions. Second operand 3 states. [2019-10-22 09:01:45,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:45,077 INFO L93 Difference]: Finished difference Result 2230 states and 3115 transitions. [2019-10-22 09:01:45,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:45,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-10-22 09:01:45,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:45,082 INFO L225 Difference]: With dead ends: 2230 [2019-10-22 09:01:45,082 INFO L226 Difference]: Without dead ends: 1160 [2019-10-22 09:01:45,083 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:45,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2019-10-22 09:01:45,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1124. [2019-10-22 09:01:45,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2019-10-22 09:01:45,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1555 transitions. [2019-10-22 09:01:45,112 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1555 transitions. Word has length 233 [2019-10-22 09:01:45,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:45,113 INFO L462 AbstractCegarLoop]: Abstraction has 1124 states and 1555 transitions. [2019-10-22 09:01:45,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:45,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1555 transitions. [2019-10-22 09:01:45,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-22 09:01:45,116 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:45,116 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:45,116 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:45,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:45,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1766185982, now seen corresponding path program 1 times [2019-10-22 09:01:45,117 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:45,117 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560440685] [2019-10-22 09:01:45,117 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:45,117 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:45,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:45,193 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-10-22 09:01:45,193 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560440685] [2019-10-22 09:01:45,194 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:45,194 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:45,194 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640465051] [2019-10-22 09:01:45,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:45,194 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:45,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:45,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:45,195 INFO L87 Difference]: Start difference. First operand 1124 states and 1555 transitions. Second operand 3 states. [2019-10-22 09:01:45,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:45,335 INFO L93 Difference]: Finished difference Result 2398 states and 3340 transitions. [2019-10-22 09:01:45,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:45,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-10-22 09:01:45,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:45,341 INFO L225 Difference]: With dead ends: 2398 [2019-10-22 09:01:45,341 INFO L226 Difference]: Without dead ends: 1256 [2019-10-22 09:01:45,342 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:45,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2019-10-22 09:01:45,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1217. [2019-10-22 09:01:45,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-10-22 09:01:45,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1687 transitions. [2019-10-22 09:01:45,369 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1687 transitions. Word has length 233 [2019-10-22 09:01:45,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:45,369 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 1687 transitions. [2019-10-22 09:01:45,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:45,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1687 transitions. [2019-10-22 09:01:45,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-10-22 09:01:45,373 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:45,373 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:45,373 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:45,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:45,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1276246012, now seen corresponding path program 1 times [2019-10-22 09:01:45,373 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:45,373 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58753815] [2019-10-22 09:01:45,374 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:45,374 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:45,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:45,453 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 622 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2019-10-22 09:01:45,453 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58753815] [2019-10-22 09:01:45,453 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:45,453 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:45,453 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106326901] [2019-10-22 09:01:45,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:45,454 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:45,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:45,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:45,454 INFO L87 Difference]: Start difference. First operand 1217 states and 1687 transitions. Second operand 3 states. [2019-10-22 09:01:45,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:45,485 INFO L93 Difference]: Finished difference Result 3630 states and 5032 transitions. [2019-10-22 09:01:45,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:45,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-10-22 09:01:45,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:45,491 INFO L225 Difference]: With dead ends: 3630 [2019-10-22 09:01:45,492 INFO L226 Difference]: Without dead ends: 2422 [2019-10-22 09:01:45,493 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:45,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2019-10-22 09:01:45,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2420. [2019-10-22 09:01:45,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2420 states. [2019-10-22 09:01:45,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2420 states and 3354 transitions. [2019-10-22 09:01:45,548 INFO L78 Accepts]: Start accepts. Automaton has 2420 states and 3354 transitions. Word has length 263 [2019-10-22 09:01:45,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:45,549 INFO L462 AbstractCegarLoop]: Abstraction has 2420 states and 3354 transitions. [2019-10-22 09:01:45,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:45,549 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 3354 transitions. [2019-10-22 09:01:45,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-10-22 09:01:45,554 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:45,554 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:45,554 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:45,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:45,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1394687486, now seen corresponding path program 1 times [2019-10-22 09:01:45,555 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:45,555 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531997322] [2019-10-22 09:01:45,555 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:45,555 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:45,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:45,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:45,625 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2019-10-22 09:01:45,625 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531997322] [2019-10-22 09:01:45,625 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:45,626 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:45,626 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673332907] [2019-10-22 09:01:45,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:45,627 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:45,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:45,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:45,627 INFO L87 Difference]: Start difference. First operand 2420 states and 3354 transitions. Second operand 3 states. [2019-10-22 09:01:45,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:45,773 INFO L93 Difference]: Finished difference Result 5143 states and 7169 transitions. [2019-10-22 09:01:45,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:45,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-10-22 09:01:45,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:45,781 INFO L225 Difference]: With dead ends: 5143 [2019-10-22 09:01:45,781 INFO L226 Difference]: Without dead ends: 2702 [2019-10-22 09:01:45,783 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:45,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-10-22 09:01:45,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 2630. [2019-10-22 09:01:45,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2630 states. [2019-10-22 09:01:45,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 3666 transitions. [2019-10-22 09:01:45,860 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 3666 transitions. Word has length 263 [2019-10-22 09:01:45,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:45,860 INFO L462 AbstractCegarLoop]: Abstraction has 2630 states and 3666 transitions. [2019-10-22 09:01:45,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:45,860 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 3666 transitions. [2019-10-22 09:01:45,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-10-22 09:01:45,866 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:45,867 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:45,867 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:45,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:45,867 INFO L82 PathProgramCache]: Analyzing trace with hash -777084420, now seen corresponding path program 1 times [2019-10-22 09:01:45,867 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:45,867 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522467984] [2019-10-22 09:01:45,868 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:45,868 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:45,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:45,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:45,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1169 backedges. 629 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2019-10-22 09:01:45,951 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522467984] [2019-10-22 09:01:45,951 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:45,954 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:45,954 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58880460] [2019-10-22 09:01:45,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:45,954 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:45,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:45,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:45,955 INFO L87 Difference]: Start difference. First operand 2630 states and 3666 transitions. Second operand 3 states. [2019-10-22 09:01:46,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:46,091 INFO L93 Difference]: Finished difference Result 5335 states and 7421 transitions. [2019-10-22 09:01:46,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:46,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2019-10-22 09:01:46,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:46,099 INFO L225 Difference]: With dead ends: 5335 [2019-10-22 09:01:46,099 INFO L226 Difference]: Without dead ends: 2696 [2019-10-22 09:01:46,101 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:46,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2696 states. [2019-10-22 09:01:46,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2696 to 2624. [2019-10-22 09:01:46,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2624 states. [2019-10-22 09:01:46,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 3630 transitions. [2019-10-22 09:01:46,157 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 3630 transitions. Word has length 298 [2019-10-22 09:01:46,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:46,157 INFO L462 AbstractCegarLoop]: Abstraction has 2624 states and 3630 transitions. [2019-10-22 09:01:46,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:46,157 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 3630 transitions. [2019-10-22 09:01:46,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-10-22 09:01:46,163 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:46,163 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 09:01:46,164 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:46,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:46,165 INFO L82 PathProgramCache]: Analyzing trace with hash -844895981, now seen corresponding path program 1 times [2019-10-22 09:01:46,165 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:46,165 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094474914] [2019-10-22 09:01:46,165 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,165 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:46,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:46,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 663 proven. 0 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-10-22 09:01:46,269 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094474914] [2019-10-22 09:01:46,270 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:46,270 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:46,271 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504096278] [2019-10-22 09:01:46,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:46,271 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:46,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:46,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:46,272 INFO L87 Difference]: Start difference. First operand 2624 states and 3630 transitions. Second operand 3 states. [2019-10-22 09:01:46,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:46,410 INFO L93 Difference]: Finished difference Result 5299 states and 7319 transitions. [2019-10-22 09:01:46,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:46,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2019-10-22 09:01:46,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:46,418 INFO L225 Difference]: With dead ends: 5299 [2019-10-22 09:01:46,418 INFO L226 Difference]: Without dead ends: 2684 [2019-10-22 09:01:46,421 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:46,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2019-10-22 09:01:46,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 2624. [2019-10-22 09:01:46,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2624 states. [2019-10-22 09:01:46,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 3576 transitions. [2019-10-22 09:01:46,495 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 3576 transitions. Word has length 321 [2019-10-22 09:01:46,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:46,495 INFO L462 AbstractCegarLoop]: Abstraction has 2624 states and 3576 transitions. [2019-10-22 09:01:46,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:46,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 3576 transitions. [2019-10-22 09:01:46,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-10-22 09:01:46,501 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:46,501 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:46,501 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:46,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:46,502 INFO L82 PathProgramCache]: Analyzing trace with hash 798876465, now seen corresponding path program 1 times [2019-10-22 09:01:46,502 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:46,502 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993462951] [2019-10-22 09:01:46,502 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,502 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:46,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 731 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-22 09:01:46,596 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993462951] [2019-10-22 09:01:46,596 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:46,596 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:46,596 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101026618] [2019-10-22 09:01:46,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:46,597 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:46,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:46,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:46,597 INFO L87 Difference]: Start difference. First operand 2624 states and 3576 transitions. Second operand 3 states. [2019-10-22 09:01:46,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:46,733 INFO L93 Difference]: Finished difference Result 5545 states and 7499 transitions. [2019-10-22 09:01:46,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:46,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-10-22 09:01:46,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:46,741 INFO L225 Difference]: With dead ends: 5545 [2019-10-22 09:01:46,741 INFO L226 Difference]: Without dead ends: 2930 [2019-10-22 09:01:46,744 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:46,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2019-10-22 09:01:46,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 2714. [2019-10-22 09:01:46,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2714 states. [2019-10-22 09:01:46,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2714 states and 3696 transitions. [2019-10-22 09:01:46,800 INFO L78 Accepts]: Start accepts. Automaton has 2714 states and 3696 transitions. Word has length 335 [2019-10-22 09:01:46,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:46,800 INFO L462 AbstractCegarLoop]: Abstraction has 2714 states and 3696 transitions. [2019-10-22 09:01:46,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:46,800 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 3696 transitions. [2019-10-22 09:01:46,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-10-22 09:01:46,806 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:46,806 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:46,806 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:46,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:46,807 INFO L82 PathProgramCache]: Analyzing trace with hash 668596020, now seen corresponding path program 1 times [2019-10-22 09:01:46,807 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:46,807 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849609393] [2019-10-22 09:01:46,807 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,807 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:46,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:46,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 871 proven. 0 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2019-10-22 09:01:46,978 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849609393] [2019-10-22 09:01:46,978 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:46,978 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:46,979 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716365963] [2019-10-22 09:01:46,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:46,979 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:46,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:46,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:46,980 INFO L87 Difference]: Start difference. First operand 2714 states and 3696 transitions. Second operand 3 states. [2019-10-22 09:01:47,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:47,035 INFO L93 Difference]: Finished difference Result 7734 states and 10582 transitions. [2019-10-22 09:01:47,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:47,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-10-22 09:01:47,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:47,052 INFO L225 Difference]: With dead ends: 7734 [2019-10-22 09:01:47,056 INFO L226 Difference]: Without dead ends: 5029 [2019-10-22 09:01:47,059 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:47,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5029 states. [2019-10-22 09:01:47,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5029 to 5027. [2019-10-22 09:01:47,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5027 states. [2019-10-22 09:01:47,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5027 states to 5027 states and 6880 transitions. [2019-10-22 09:01:47,162 INFO L78 Accepts]: Start accepts. Automaton has 5027 states and 6880 transitions. Word has length 336 [2019-10-22 09:01:47,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:47,162 INFO L462 AbstractCegarLoop]: Abstraction has 5027 states and 6880 transitions. [2019-10-22 09:01:47,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:47,162 INFO L276 IsEmpty]: Start isEmpty. Operand 5027 states and 6880 transitions. [2019-10-22 09:01:47,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-10-22 09:01:47,170 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:47,171 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 09:01:47,171 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:47,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:47,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1546862455, now seen corresponding path program 1 times [2019-10-22 09:01:47,171 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:47,172 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109893343] [2019-10-22 09:01:47,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:47,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:47,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-10-22 09:01:47,310 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109893343] [2019-10-22 09:01:47,310 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554943839] [2019-10-22 09:01:47,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10c4e6d5-612b-4121-aa2b-fe98fa4d0d64/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-10-22 09:01:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:47,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 09:01:47,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:47,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-10-22 09:01:47,564 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:01:47,564 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-22 09:01:47,564 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976865911] [2019-10-22 09:01:47,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:47,565 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:47,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:47,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:47,566 INFO L87 Difference]: Start difference. First operand 5027 states and 6880 transitions. Second operand 4 states. [2019-10-22 09:01:48,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:48,157 INFO L93 Difference]: Finished difference Result 9987 states and 13646 transitions. [2019-10-22 09:01:48,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:01:48,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 360 [2019-10-22 09:01:48,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:48,187 INFO L225 Difference]: With dead ends: 9987 [2019-10-22 09:01:48,188 INFO L226 Difference]: Without dead ends: 7540 [2019-10-22 09:01:48,192 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 362 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-10-22 09:01:48,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7540 states. [2019-10-22 09:01:48,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7540 to 5561. [2019-10-22 09:01:48,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5561 states. [2019-10-22 09:01:48,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5561 states to 5561 states and 7516 transitions. [2019-10-22 09:01:48,369 INFO L78 Accepts]: Start accepts. Automaton has 5561 states and 7516 transitions. Word has length 360 [2019-10-22 09:01:48,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:48,369 INFO L462 AbstractCegarLoop]: Abstraction has 5561 states and 7516 transitions. [2019-10-22 09:01:48,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:48,370 INFO L276 IsEmpty]: Start isEmpty. Operand 5561 states and 7516 transitions. [2019-10-22 09:01:48,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-10-22 09:01:48,384 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:48,384 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:48,585 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:48,586 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:48,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:48,586 INFO L82 PathProgramCache]: Analyzing trace with hash 774755817, now seen corresponding path program 2 times [2019-10-22 09:01:48,586 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:48,586 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875600831] [2019-10-22 09:01:48,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:48,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:48,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:48,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:48,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-22 09:01:48,753 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875600831] [2019-10-22 09:01:48,757 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940393797] [2019-10-22 09:01:48,757 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10c4e6d5-612b-4121-aa2b-fe98fa4d0d64/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-10-22 09:01:48,868 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 09:01:48,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:01:48,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 09:01:48,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:48,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-22 09:01:48,982 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:01:48,982 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-22 09:01:48,982 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44641574] [2019-10-22 09:01:48,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:48,983 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:48,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:48,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:48,984 INFO L87 Difference]: Start difference. First operand 5561 states and 7516 transitions. Second operand 4 states. [2019-10-22 09:01:49,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:49,380 INFO L93 Difference]: Finished difference Result 12544 states and 16972 transitions. [2019-10-22 09:01:49,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:49,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 373 [2019-10-22 09:01:49,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:49,392 INFO L225 Difference]: With dead ends: 12544 [2019-10-22 09:01:49,392 INFO L226 Difference]: Without dead ends: 6979 [2019-10-22 09:01:49,397 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:49,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6979 states. [2019-10-22 09:01:49,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6979 to 5709. [2019-10-22 09:01:49,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5709 states. [2019-10-22 09:01:49,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5709 states to 5709 states and 7634 transitions. [2019-10-22 09:01:49,542 INFO L78 Accepts]: Start accepts. Automaton has 5709 states and 7634 transitions. Word has length 373 [2019-10-22 09:01:49,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:49,543 INFO L462 AbstractCegarLoop]: Abstraction has 5709 states and 7634 transitions. [2019-10-22 09:01:49,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:49,543 INFO L276 IsEmpty]: Start isEmpty. Operand 5709 states and 7634 transitions. [2019-10-22 09:01:49,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-10-22 09:01:49,554 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:49,554 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:49,755 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:49,755 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:49,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:49,756 INFO L82 PathProgramCache]: Analyzing trace with hash 256545513, now seen corresponding path program 1 times [2019-10-22 09:01:49,756 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:49,756 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113388366] [2019-10-22 09:01:49,756 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:49,756 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:49,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:49,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-10-22 09:01:49,879 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113388366] [2019-10-22 09:01:49,879 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:49,879 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:49,879 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170755749] [2019-10-22 09:01:49,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:49,880 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:49,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:49,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:49,880 INFO L87 Difference]: Start difference. First operand 5709 states and 7634 transitions. Second operand 3 states. [2019-10-22 09:01:50,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:50,055 INFO L93 Difference]: Finished difference Result 11015 states and 14510 transitions. [2019-10-22 09:01:50,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:50,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 412 [2019-10-22 09:01:50,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:50,062 INFO L225 Difference]: With dead ends: 11015 [2019-10-22 09:01:50,062 INFO L226 Difference]: Without dead ends: 3069 [2019-10-22 09:01:50,068 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:50,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3069 states. [2019-10-22 09:01:50,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3069 to 2976. [2019-10-22 09:01:50,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2976 states. [2019-10-22 09:01:50,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 3983 transitions. [2019-10-22 09:01:50,125 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 3983 transitions. Word has length 412 [2019-10-22 09:01:50,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:50,125 INFO L462 AbstractCegarLoop]: Abstraction has 2976 states and 3983 transitions. [2019-10-22 09:01:50,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:50,125 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 3983 transitions. [2019-10-22 09:01:50,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2019-10-22 09:01:50,134 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:50,134 INFO L380 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:50,135 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:50,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:50,135 INFO L82 PathProgramCache]: Analyzing trace with hash 930203824, now seen corresponding path program 1 times [2019-10-22 09:01:50,135 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:50,135 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141977862] [2019-10-22 09:01:50,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:50,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:50,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:50,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:50,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1648 proven. 14 refuted. 0 times theorem prover too weak. 1236 trivial. 0 not checked. [2019-10-22 09:01:50,398 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141977862] [2019-10-22 09:01:50,398 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769064031] [2019-10-22 09:01:50,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10c4e6d5-612b-4121-aa2b-fe98fa4d0d64/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-10-22 09:01:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:50,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 09:01:50,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:50,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1075 proven. 0 refuted. 0 times theorem prover too weak. 1823 trivial. 0 not checked. [2019-10-22 09:01:50,778 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 09:01:50,778 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-22 09:01:50,778 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607457537] [2019-10-22 09:01:50,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:50,779 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:50,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:50,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:50,780 INFO L87 Difference]: Start difference. First operand 2976 states and 3983 transitions. Second operand 3 states. [2019-10-22 09:01:50,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:50,809 INFO L93 Difference]: Finished difference Result 3028 states and 4049 transitions. [2019-10-22 09:01:50,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:50,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 510 [2019-10-22 09:01:50,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:50,814 INFO L225 Difference]: With dead ends: 3028 [2019-10-22 09:01:50,814 INFO L226 Difference]: Without dead ends: 2531 [2019-10-22 09:01:50,815 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 510 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:50,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2531 states. [2019-10-22 09:01:50,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2531 to 2481. [2019-10-22 09:01:50,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2481 states. [2019-10-22 09:01:50,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 3319 transitions. [2019-10-22 09:01:50,863 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 3319 transitions. Word has length 510 [2019-10-22 09:01:50,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:50,864 INFO L462 AbstractCegarLoop]: Abstraction has 2481 states and 3319 transitions. [2019-10-22 09:01:50,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:50,864 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 3319 transitions. [2019-10-22 09:01:50,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2019-10-22 09:01:50,873 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:50,873 INFO L380 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 16, 16, 14, 14, 13, 13, 12, 12, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-22 09:01:51,074 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:51,075 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:51,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:51,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1673743471, now seen corresponding path program 1 times [2019-10-22 09:01:51,076 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:51,076 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467166230] [2019-10-22 09:01:51,076 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:51,076 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:51,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:51,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2784 backedges. 1623 proven. 14 refuted. 0 times theorem prover too weak. 1147 trivial. 0 not checked. [2019-10-22 09:01:51,291 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467166230] [2019-10-22 09:01:51,291 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433717352] [2019-10-22 09:01:51,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10c4e6d5-612b-4121-aa2b-fe98fa4d0d64/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:51,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:51,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 827 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:51,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:51,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2784 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 2506 trivial. 0 not checked. [2019-10-22 09:01:51,518 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 09:01:51,518 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-22 09:01:51,518 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489455250] [2019-10-22 09:01:51,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:51,520 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:51,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:51,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:51,521 INFO L87 Difference]: Start difference. First operand 2481 states and 3319 transitions. Second operand 3 states. [2019-10-22 09:01:51,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:51,652 INFO L93 Difference]: Finished difference Result 5060 states and 6783 transitions. [2019-10-22 09:01:51,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:51,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 511 [2019-10-22 09:01:51,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:51,657 INFO L225 Difference]: With dead ends: 5060 [2019-10-22 09:01:51,657 INFO L226 Difference]: Without dead ends: 2589 [2019-10-22 09:01:51,659 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 511 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:51,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2589 states. [2019-10-22 09:01:51,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2589 to 2586. [2019-10-22 09:01:51,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2586 states. [2019-10-22 09:01:51,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2586 states to 2586 states and 3331 transitions. [2019-10-22 09:01:51,708 INFO L78 Accepts]: Start accepts. Automaton has 2586 states and 3331 transitions. Word has length 511 [2019-10-22 09:01:51,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:51,711 INFO L462 AbstractCegarLoop]: Abstraction has 2586 states and 3331 transitions. [2019-10-22 09:01:51,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:51,711 INFO L276 IsEmpty]: Start isEmpty. Operand 2586 states and 3331 transitions. [2019-10-22 09:01:51,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2019-10-22 09:01:51,723 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:51,723 INFO L380 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 21, 19, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-22 09:01:51,924 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:51,924 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:51,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:51,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1058434925, now seen corresponding path program 2 times [2019-10-22 09:01:51,925 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:51,925 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116904603] [2019-10-22 09:01:51,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:51,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:51,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:52,249 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2019-10-22 09:01:52,249 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116904603] [2019-10-22 09:01:52,249 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083060168] [2019-10-22 09:01:52,249 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10c4e6d5-612b-4121-aa2b-fe98fa4d0d64/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:52,390 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 09:01:52,390 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:01:52,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 978 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 09:01:52,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:52,548 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2019-10-22 09:01:52,548 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:01:52,548 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-22 09:01:52,548 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808440258] [2019-10-22 09:01:52,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:52,549 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:52,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:52,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:52,550 INFO L87 Difference]: Start difference. First operand 2586 states and 3331 transitions. Second operand 4 states. [2019-10-22 09:01:52,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:52,702 INFO L93 Difference]: Finished difference Result 2848 states and 3664 transitions. [2019-10-22 09:01:52,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:52,703 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 622 [2019-10-22 09:01:52,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:52,703 INFO L225 Difference]: With dead ends: 2848 [2019-10-22 09:01:52,703 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 09:01:52,705 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 624 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-10-22 09:01:52,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 09:01:52,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 09:01:52,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 09:01:52,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 09:01:52,706 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 622 [2019-10-22 09:01:52,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:52,706 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:01:52,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:52,706 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:01:52,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 09:01:52,909 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:52,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 09:01:53,327 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 253 DAG size of output: 111 [2019-10-22 09:01:54,211 WARN L191 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2019-10-22 09:01:54,330 INFO L443 ceAbstractionStarter]: For program point L432(lines 432 434) no Hoare annotation was computed. [2019-10-22 09:01:54,330 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 335) no Hoare annotation was computed. [2019-10-22 09:01:54,330 INFO L446 ceAbstractionStarter]: At program point L201(lines 200 488) the Hoare annotation is: true [2019-10-22 09:01:54,330 INFO L443 ceAbstractionStarter]: For program point L168(lines 168 498) no Hoare annotation was computed. [2019-10-22 09:01:54,330 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 509) no Hoare annotation was computed. [2019-10-22 09:01:54,330 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 520) no Hoare annotation was computed. [2019-10-22 09:01:54,330 INFO L439 ceAbstractionStarter]: At program point L169(lines 165 499) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-10-22 09:01:54,330 INFO L439 ceAbstractionStarter]: At program point L103(lines 102 520) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (= 12292 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-10-22 09:01:54,331 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 469) no Hoare annotation was computed. [2019-10-22 09:01:54,331 INFO L443 ceAbstractionStarter]: For program point L467-2(lines 467 469) no Hoare annotation was computed. [2019-10-22 09:01:54,331 INFO L443 ceAbstractionStarter]: For program point L435(lines 435 439) no Hoare annotation was computed. [2019-10-22 09:01:54,331 INFO L443 ceAbstractionStarter]: For program point L435-2(lines 435 439) no Hoare annotation was computed. [2019-10-22 09:01:54,331 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 340) no Hoare annotation was computed. [2019-10-22 09:01:54,331 INFO L443 ceAbstractionStarter]: For program point L270(lines 270 272) no Hoare annotation was computed. [2019-10-22 09:01:54,331 INFO L443 ceAbstractionStarter]: For program point L336-2(lines 336 340) no Hoare annotation was computed. [2019-10-22 09:01:54,331 INFO L443 ceAbstractionStarter]: For program point L270-2(lines 202 485) no Hoare annotation was computed. [2019-10-22 09:01:54,332 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 497) no Hoare annotation was computed. [2019-10-22 09:01:54,332 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 508) no Hoare annotation was computed. [2019-10-22 09:01:54,332 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 519) no Hoare annotation was computed. [2019-10-22 09:01:54,332 INFO L439 ceAbstractionStarter]: At program point L139(lines 135 509) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) [2019-10-22 09:01:54,332 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 307) no Hoare annotation was computed. [2019-10-22 09:01:54,332 INFO L443 ceAbstractionStarter]: For program point L239(lines 239 242) no Hoare annotation was computed. [2019-10-22 09:01:54,332 INFO L443 ceAbstractionStarter]: For program point L305-2(lines 202 485) no Hoare annotation was computed. [2019-10-22 09:01:54,332 INFO L443 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2019-10-22 09:01:54,332 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 374) no Hoare annotation was computed. [2019-10-22 09:01:54,332 INFO L439 ceAbstractionStarter]: At program point L207(lines 105 519) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) [2019-10-22 09:01:54,332 INFO L443 ceAbstractionStarter]: For program point L174(lines 174 496) no Hoare annotation was computed. [2019-10-22 09:01:54,333 INFO L443 ceAbstractionStarter]: For program point L141(lines 141 507) no Hoare annotation was computed. [2019-10-22 09:01:54,333 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 518) no Hoare annotation was computed. [2019-10-22 09:01:54,333 INFO L439 ceAbstractionStarter]: At program point L175(lines 171 497) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-10-22 09:01:54,333 INFO L443 ceAbstractionStarter]: For program point L473(lines 473 475) no Hoare annotation was computed. [2019-10-22 09:01:54,333 INFO L443 ceAbstractionStarter]: For program point L473-2(lines 473 475) no Hoare annotation was computed. [2019-10-22 09:01:54,333 INFO L446 ceAbstractionStarter]: At program point L540(lines 98 541) the Hoare annotation is: true [2019-10-22 09:01:54,333 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 280) no Hoare annotation was computed. [2019-10-22 09:01:54,333 INFO L443 ceAbstractionStarter]: For program point L276-2(lines 276 280) no Hoare annotation was computed. [2019-10-22 09:01:54,333 INFO L443 ceAbstractionStarter]: For program point L177(lines 177 495) no Hoare annotation was computed. [2019-10-22 09:01:54,333 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 506) no Hoare annotation was computed. [2019-10-22 09:01:54,333 INFO L443 ceAbstractionStarter]: For program point L111(lines 111 517) no Hoare annotation was computed. [2019-10-22 09:01:54,334 INFO L439 ceAbstractionStarter]: At program point L145(lines 141 507) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4448) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-10-22 09:01:54,334 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 214) no Hoare annotation was computed. [2019-10-22 09:01:54,334 INFO L443 ceAbstractionStarter]: For program point L212-2(lines 212 214) no Hoare annotation was computed. [2019-10-22 09:01:54,334 INFO L443 ceAbstractionStarter]: For program point L180(lines 180 494) no Hoare annotation was computed. [2019-10-22 09:01:54,334 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 505) no Hoare annotation was computed. [2019-10-22 09:01:54,334 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 516) no Hoare annotation was computed. [2019-10-22 09:01:54,334 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 480) no Hoare annotation was computed. [2019-10-22 09:01:54,334 INFO L443 ceAbstractionStarter]: For program point L445(lines 445 456) no Hoare annotation was computed. [2019-10-22 09:01:54,334 INFO L443 ceAbstractionStarter]: For program point L412(lines 412 426) no Hoare annotation was computed. [2019-10-22 09:01:54,334 INFO L443 ceAbstractionStarter]: For program point L412-1(lines 412 426) no Hoare annotation was computed. [2019-10-22 09:01:54,334 INFO L443 ceAbstractionStarter]: For program point L445-2(lines 445 456) no Hoare annotation was computed. [2019-10-22 09:01:54,334 INFO L443 ceAbstractionStarter]: For program point L313(lines 313 316) no Hoare annotation was computed. [2019-10-22 09:01:54,335 INFO L439 ceAbstractionStarter]: At program point L181(lines 177 495) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (and (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2))))) [2019-10-22 09:01:54,335 INFO L443 ceAbstractionStarter]: For program point L545(lines 545 547) no Hoare annotation was computed. [2019-10-22 09:01:54,335 INFO L443 ceAbstractionStarter]: For program point L545-2(lines 545 547) no Hoare annotation was computed. [2019-10-22 09:01:54,335 INFO L443 ceAbstractionStarter]: For program point L348(lines 348 350) no Hoare annotation was computed. [2019-10-22 09:01:54,337 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 493) no Hoare annotation was computed. [2019-10-22 09:01:54,337 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 504) no Hoare annotation was computed. [2019-10-22 09:01:54,337 INFO L443 ceAbstractionStarter]: For program point L117(lines 117 515) no Hoare annotation was computed. [2019-10-22 09:01:54,337 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2019-10-22 09:01:54,337 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 220) no Hoare annotation was computed. [2019-10-22 09:01:54,337 INFO L439 ceAbstractionStarter]: At program point L151(lines 147 505) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4464) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-10-22 09:01:54,337 INFO L443 ceAbstractionStarter]: For program point L85(lines 85 91) no Hoare annotation was computed. [2019-10-22 09:01:54,338 INFO L443 ceAbstractionStarter]: For program point L416(lines 416 422) no Hoare annotation was computed. [2019-10-22 09:01:54,338 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 09:01:54,338 INFO L443 ceAbstractionStarter]: For program point L251(lines 251 257) no Hoare annotation was computed. [2019-10-22 09:01:54,338 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 453) no Hoare annotation was computed. [2019-10-22 09:01:54,338 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 492) no Hoare annotation was computed. [2019-10-22 09:01:54,338 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 503) no Hoare annotation was computed. [2019-10-22 09:01:54,338 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 514) no Hoare annotation was computed. [2019-10-22 09:01:54,338 INFO L446 ceAbstractionStarter]: At program point L550(lines 11 552) the Hoare annotation is: true [2019-10-22 09:01:54,338 INFO L439 ceAbstractionStarter]: At program point L187(lines 183 493) the Hoare annotation is: (let ((.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse2 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560))) (or (and (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2) (and (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 .cse2) .cse0))) [2019-10-22 09:01:54,338 INFO L439 ceAbstractionStarter]: At program point L121(lines 117 515) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-10-22 09:01:54,338 INFO L443 ceAbstractionStarter]: For program point L88(lines 88 90) no Hoare annotation was computed. [2019-10-22 09:01:54,339 INFO L443 ceAbstractionStarter]: For program point L88-2(lines 85 91) no Hoare annotation was computed. [2019-10-22 09:01:54,339 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 297) no Hoare annotation was computed. [2019-10-22 09:01:54,339 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 256) no Hoare annotation was computed. [2019-10-22 09:01:54,339 INFO L443 ceAbstractionStarter]: For program point L287-2(lines 287 297) no Hoare annotation was computed. [2019-10-22 09:01:54,339 INFO L443 ceAbstractionStarter]: For program point L254-2(lines 202 485) no Hoare annotation was computed. [2019-10-22 09:01:54,339 INFO L439 ceAbstractionStarter]: At program point L486(lines 99 539) the Hoare annotation is: (let ((.cse4 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (let ((.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse2 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse6 (not .cse4)) (.cse12 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse10 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse11 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse3 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse9 (= 4400 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse8 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse7 (<= ULTIMATE.start_ssl3_connect_~s__state~0 3)) (.cse5 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560))) (or (and .cse0 (= 4368 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse2) (and .cse0 .cse7 .cse4) (and .cse8 .cse4 .cse5 .cse9) (and .cse6 .cse10 .cse11 .cse0) (and .cse12 .cse8 .cse4 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (and (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) .cse12 .cse0) (and .cse10 .cse11 .cse3 .cse4 .cse5) (and (= ULTIMATE.start_ssl3_connect_~s__state~0 4384) .cse0) (and .cse0 .cse4 .cse9) (and (= 4416 ULTIMATE.start_ssl3_connect_~s__state~0) .cse8 .cse4) (and .cse7 .cse5)))) [2019-10-22 09:01:54,339 INFO L443 ceAbstractionStarter]: For program point L321(lines 321 323) no Hoare annotation was computed. [2019-10-22 09:01:54,339 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 491) no Hoare annotation was computed. [2019-10-22 09:01:54,339 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 502) no Hoare annotation was computed. [2019-10-22 09:01:54,340 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 513) no Hoare annotation was computed. [2019-10-22 09:01:54,340 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 392) no Hoare annotation was computed. [2019-10-22 09:01:54,340 INFO L439 ceAbstractionStarter]: At program point L322(lines 76 551) the Hoare annotation is: false [2019-10-22 09:01:54,340 INFO L443 ceAbstractionStarter]: For program point L388-2(lines 202 485) no Hoare annotation was computed. [2019-10-22 09:01:54,340 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 09:01:54,340 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 234) no Hoare annotation was computed. [2019-10-22 09:01:54,340 INFO L443 ceAbstractionStarter]: For program point L223-2(lines 202 485) no Hoare annotation was computed. [2019-10-22 09:01:54,340 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 537) no Hoare annotation was computed. [2019-10-22 09:01:54,340 INFO L443 ceAbstractionStarter]: For program point L522(lines 522 536) no Hoare annotation was computed. [2019-10-22 09:01:54,340 INFO L443 ceAbstractionStarter]: For program point L357(lines 357 359) no Hoare annotation was computed. [2019-10-22 09:01:54,340 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2019-10-22 09:01:54,340 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 293) no Hoare annotation was computed. [2019-10-22 09:01:54,341 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 228) no Hoare annotation was computed. [2019-10-22 09:01:54,341 INFO L443 ceAbstractionStarter]: For program point L291-2(lines 289 297) no Hoare annotation was computed. [2019-10-22 09:01:54,341 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 490) no Hoare annotation was computed. [2019-10-22 09:01:54,341 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 501) no Hoare annotation was computed. [2019-10-22 09:01:54,341 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 512) no Hoare annotation was computed. [2019-10-22 09:01:54,341 INFO L443 ceAbstractionStarter]: For program point L93(lines 93 97) no Hoare annotation was computed. [2019-10-22 09:01:54,341 INFO L443 ceAbstractionStarter]: For program point L523(lines 523 528) no Hoare annotation was computed. [2019-10-22 09:01:54,341 INFO L443 ceAbstractionStarter]: For program point L523-2(lines 522 536) no Hoare annotation was computed. [2019-10-22 09:01:54,341 INFO L439 ceAbstractionStarter]: At program point L193(lines 189 491) the Hoare annotation is: (let ((.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and (not .cse2) .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)))) [2019-10-22 09:01:54,341 INFO L439 ceAbstractionStarter]: At program point L127(lines 123 513) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-10-22 09:01:54,341 INFO L443 ceAbstractionStarter]: For program point L94(lines 94 96) no Hoare annotation was computed. [2019-10-22 09:01:54,341 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 09:01:54,342 INFO L443 ceAbstractionStarter]: For program point L525(lines 525 527) no Hoare annotation was computed. [2019-10-22 09:01:54,342 INFO L443 ceAbstractionStarter]: For program point L195(lines 195 489) no Hoare annotation was computed. [2019-10-22 09:01:54,342 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 500) no Hoare annotation was computed. [2019-10-22 09:01:54,342 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 511) no Hoare annotation was computed. [2019-10-22 09:01:54,342 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 366) no Hoare annotation was computed. [2019-10-22 09:01:54,342 INFO L443 ceAbstractionStarter]: For program point L361-2(lines 361 366) no Hoare annotation was computed. [2019-10-22 09:01:54,342 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 232) no Hoare annotation was computed. [2019-10-22 09:01:54,342 INFO L439 ceAbstractionStarter]: At program point L196(lines 195 489) the Hoare annotation is: (let ((.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.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) .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (not .cse2) .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse1))) [2019-10-22 09:01:54,342 INFO L439 ceAbstractionStarter]: At program point L163(lines 153 503) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4480) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-10-22 09:01:54,342 INFO L443 ceAbstractionStarter]: For program point L461-1(lines 461 463) no Hoare annotation was computed. [2019-10-22 09:01:54,342 INFO L443 ceAbstractionStarter]: For program point L263(lines 263 265) no Hoare annotation was computed. [2019-10-22 09:01:54,343 INFO L446 ceAbstractionStarter]: At program point L561(lines 553 563) the Hoare annotation is: true [2019-10-22 09:01:54,343 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 488) no Hoare annotation was computed. [2019-10-22 09:01:54,343 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 499) no Hoare annotation was computed. [2019-10-22 09:01:54,343 INFO L443 ceAbstractionStarter]: For program point L132(lines 132 510) no Hoare annotation was computed. [2019-10-22 09:01:54,343 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 76 551) no Hoare annotation was computed. [2019-10-22 09:01:54,345 INFO L443 ceAbstractionStarter]: For program point L397(lines 397 400) no Hoare annotation was computed. [2019-10-22 09:01:54,345 INFO L446 ceAbstractionStarter]: At program point L199(lines 198 488) the Hoare annotation is: true [2019-10-22 09:01:54,345 INFO L439 ceAbstractionStarter]: At program point L133(lines 129 511) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)))) [2019-10-22 09:01:54,345 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-22 09:01:54,345 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 549) no Hoare annotation was computed. [2019-10-22 09:01:54,345 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 534) no Hoare annotation was computed. [2019-10-22 09:01:54,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 09:01:54 BoogieIcfgContainer [2019-10-22 09:01:54,378 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 09:01:54,379 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:01:54,379 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:01:54,379 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:01:54,379 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:42" (3/4) ... [2019-10-22 09:01:54,383 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 09:01:54,396 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-10-22 09:01:54,398 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 09:01:54,471 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_10c4e6d5-612b-4121-aa2b-fe98fa4d0d64/bin/uautomizer/witness.graphml [2019-10-22 09:01:54,473 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:01:54,474 INFO L168 Benchmark]: Toolchain (without parser) took 13623.51 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.0 GB). Free memory was 944.7 MB in the beginning and 1.8 GB in the end (delta: -858.5 MB). Peak memory consumption was 163.8 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:54,475 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:54,475 INFO L168 Benchmark]: CACSL2BoogieTranslator took 401.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -191.8 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:54,475 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.84 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-10-22 09:01:54,475 INFO L168 Benchmark]: Boogie Preprocessor took 42.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:54,475 INFO L168 Benchmark]: RCFGBuilder took 774.64 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: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:54,476 INFO L168 Benchmark]: TraceAbstraction took 12242.10 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 875.0 MB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -753.2 MB). Peak memory consumption was 878.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:54,476 INFO L168 Benchmark]: Witness Printer took 94.72 ms. Allocated memory is still 2.1 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:54,477 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 401.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -191.8 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.84 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 42.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 774.64 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: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12242.10 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 875.0 MB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -753.2 MB). Peak memory consumption was 878.0 MB. Max. memory is 11.5 GB. * Witness Printer took 94.72 ms. Allocated memory is still 2.1 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 549]: 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: 105]: Loop Invariant Derived loop invariant: s__state <= 4560 && blastFlag <= 2 - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: ((s__state <= 4512 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit) || ((((blastFlag <= 4 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: (((4512 <= s__state && s__state <= 4560) && blastFlag <= 2) || (((s__state <= 4560 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4432 <= s__state)) || (((blastFlag <= 4 && 0 == s__hit) && 4432 <= s__state) && s__state <= 4560) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: ((blastFlag <= 4 && s__state <= 4448) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: blastFlag <= 2 && 12292 == s__state - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((s__state <= 4512 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state) || (4512 <= s__state && s__state <= 4528 && blastFlag <= 2) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((blastFlag <= 4 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit - InvariantResult [Line: 189]: Loop Invariant Derived loop invariant: ((((4560 <= s__state && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) || (((!(0 == s__hit) && 4560 <= s__state) && s__state <= 4560) && blastFlag <= 2) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((s__state <= 4464 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 553]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((blastFlag <= 2 && 4368 == s__state) || ((((s__state <= 4352 && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((((blastFlag <= 2 && !(0 == s__hit)) && s__state <= 4352) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state)) || ((blastFlag <= 2 && s__state <= 3) && 0 == s__hit)) || (((blastFlag <= 4 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4400 == s__state)) || (((!(0 == s__hit) && 4560 <= s__state) && s__state <= 4560) && blastFlag <= 2)) || (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state)) || ((4512 <= s__state && s__state <= 4528) && blastFlag <= 2)) || ((((4560 <= s__state && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || (s__state == 4384 && blastFlag <= 2)) || ((blastFlag <= 2 && 0 == s__hit) && 4400 == s__state)) || ((4416 == s__state && blastFlag <= 4) && 0 == s__hit)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((s__state <= 4480 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 195]: 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) || ((((blastFlag <= 2 && !(0 == s__hit)) && s__state <= 4352) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 127 locations, 1 error locations. Result: SAFE, OverallTime: 12.1s, OverallIterations: 25, TraceHistogramMax: 22, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, HoareTripleCheckerStatistics: 4490 SDtfs, 2115 SDslu, 2318 SDs, 0 SdLazy, 2460 SolverSat, 611 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2456 GetRequests, 2421 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5709occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 4032 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 155 NumberOfFragments, 427 HoareAnnotationTreeSize, 22 FomulaSimplifications, 29279 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 22 FomulaSimplificationsInter, 24849 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 8555 NumberOfCodeBlocks, 8555 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 8525 ConstructedInterpolants, 0 QuantifiedInterpolants, 4552471 SizeOfPredicates, 7 NumberOfNonLiveVariables, 3948 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 30 InterpolantComputations, 22 PerfectInterpolantSequences, 38935/39021 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...