./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d703ebdf-b093-4e4e-aa37-15280b382a02/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d703ebdf-b093-4e4e-aa37-15280b382a02/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d703ebdf-b093-4e4e-aa37-15280b382a02/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d703ebdf-b093-4e4e-aa37-15280b382a02/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_d703ebdf-b093-4e4e-aa37-15280b382a02/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d703ebdf-b093-4e4e-aa37-15280b382a02/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 bb19220a89a4de9b41ceda2b5f420af7272fc928 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 03:12:18,213 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 03:12:18,215 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 03:12:18,231 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 03:12:18,231 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 03:12:18,233 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 03:12:18,235 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 03:12:18,244 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 03:12:18,249 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 03:12:18,254 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 03:12:18,256 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 03:12:18,257 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 03:12:18,257 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 03:12:18,259 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 03:12:18,261 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 03:12:18,262 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 03:12:18,263 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 03:12:18,264 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 03:12:18,267 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 03:12:18,271 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 03:12:18,275 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 03:12:18,277 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 03:12:18,281 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 03:12:18,281 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 03:12:18,285 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 03:12:18,285 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 03:12:18,286 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 03:12:18,287 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 03:12:18,288 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 03:12:18,289 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 03:12:18,289 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 03:12:18,290 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 03:12:18,291 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 03:12:18,292 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 03:12:18,293 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 03:12:18,293 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 03:12:18,293 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 03:12:18,294 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 03:12:18,294 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 03:12:18,295 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 03:12:18,296 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 03:12:18,297 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d703ebdf-b093-4e4e-aa37-15280b382a02/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 03:12:18,324 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 03:12:18,325 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 03:12:18,327 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 03:12:18,327 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 03:12:18,327 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 03:12:18,328 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 03:12:18,328 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 03:12:18,328 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 03:12:18,328 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 03:12:18,329 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 03:12:18,330 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 03:12:18,330 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 03:12:18,330 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 03:12:18,331 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 03:12:18,331 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 03:12:18,331 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 03:12:18,331 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 03:12:18,332 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 03:12:18,332 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 03:12:18,332 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 03:12:18,332 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 03:12:18,333 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 03:12:18,333 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 03:12:18,333 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 03:12:18,333 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 03:12:18,334 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 03:12:18,334 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 03:12:18,334 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 03:12:18,334 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_d703ebdf-b093-4e4e-aa37-15280b382a02/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 -> bb19220a89a4de9b41ceda2b5f420af7272fc928 [2019-11-20 03:12:18,515 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 03:12:18,527 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 03:12:18,530 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 03:12:18,532 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 03:12:18,532 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 03:12:18,533 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d703ebdf-b093-4e4e-aa37-15280b382a02/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c [2019-11-20 03:12:18,597 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d703ebdf-b093-4e4e-aa37-15280b382a02/bin/uautomizer/data/dfac707f3/82cfef30adae46b89b61c6dacee81b19/FLAGb0b66a414 [2019-11-20 03:12:19,030 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 03:12:19,031 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d703ebdf-b093-4e4e-aa37-15280b382a02/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c [2019-11-20 03:12:19,051 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d703ebdf-b093-4e4e-aa37-15280b382a02/bin/uautomizer/data/dfac707f3/82cfef30adae46b89b61c6dacee81b19/FLAGb0b66a414 [2019-11-20 03:12:19,313 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d703ebdf-b093-4e4e-aa37-15280b382a02/bin/uautomizer/data/dfac707f3/82cfef30adae46b89b61c6dacee81b19 [2019-11-20 03:12:19,316 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 03:12:19,317 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 03:12:19,319 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 03:12:19,319 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 03:12:19,323 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 03:12:19,324 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:12:19" (1/1) ... [2019-11-20 03:12:19,326 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7003991e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:12:19, skipping insertion in model container [2019-11-20 03:12:19,326 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:12:19" (1/1) ... [2019-11-20 03:12:19,334 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 03:12:19,393 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 03:12:19,716 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:12:19,720 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 03:12:19,784 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:12:19,797 INFO L192 MainTranslator]: Completed translation [2019-11-20 03:12:19,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:12:19 WrapperNode [2019-11-20 03:12:19,798 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 03:12:19,799 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 03:12:19,799 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 03:12:19,799 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 03:12:19,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:12:19" (1/1) ... [2019-11-20 03:12:19,817 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:12:19" (1/1) ... [2019-11-20 03:12:19,862 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 03:12:19,863 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 03:12:19,863 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 03:12:19,863 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 03:12:19,871 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:12:19" (1/1) ... [2019-11-20 03:12:19,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:12:19" (1/1) ... [2019-11-20 03:12:19,875 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:12:19" (1/1) ... [2019-11-20 03:12:19,875 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:12:19" (1/1) ... [2019-11-20 03:12:19,899 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:12:19" (1/1) ... [2019-11-20 03:12:19,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:12:19" (1/1) ... [2019-11-20 03:12:19,908 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:12:19" (1/1) ... [2019-11-20 03:12:19,912 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 03:12:19,913 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 03:12:19,913 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 03:12:19,913 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 03:12:19,931 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:12:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d703ebdf-b093-4e4e-aa37-15280b382a02/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 03:12:20,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 03:12:20,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 03:12:20,196 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 03:12:20,714 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-20 03:12:20,714 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-20 03:12:20,716 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 03:12:20,716 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 03:12:20,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:12:20 BoogieIcfgContainer [2019-11-20 03:12:20,718 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 03:12:20,719 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 03:12:20,719 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 03:12:20,722 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 03:12:20,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:12:19" (1/3) ... [2019-11-20 03:12:20,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a6ee19a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:12:20, skipping insertion in model container [2019-11-20 03:12:20,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:12:19" (2/3) ... [2019-11-20 03:12:20,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a6ee19a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:12:20, skipping insertion in model container [2019-11-20 03:12:20,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:12:20" (3/3) ... [2019-11-20 03:12:20,725 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil-1a.c [2019-11-20 03:12:20,734 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 03:12:20,742 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 03:12:20,753 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 03:12:20,789 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 03:12:20,789 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 03:12:20,789 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 03:12:20,790 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 03:12:20,790 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 03:12:20,790 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 03:12:20,790 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 03:12:20,790 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 03:12:20,811 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2019-11-20 03:12:20,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 03:12:20,819 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:12:20,820 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:12:20,821 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:12:20,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:12:20,827 INFO L82 PathProgramCache]: Analyzing trace with hash 511659491, now seen corresponding path program 1 times [2019-11-20 03:12:20,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:12:20,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161254594] [2019-11-20 03:12:20,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:12:20,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:12:21,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:12:21,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161254594] [2019-11-20 03:12:21,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:12:21,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:12:21,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382794955] [2019-11-20 03:12:21,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:12:21,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:12:21,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:12:21,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:12:21,063 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 3 states. [2019-11-20 03:12:21,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:12:21,318 INFO L93 Difference]: Finished difference Result 246 states and 422 transitions. [2019-11-20 03:12:21,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:12:21,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-20 03:12:21,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:12:21,331 INFO L225 Difference]: With dead ends: 246 [2019-11-20 03:12:21,331 INFO L226 Difference]: Without dead ends: 112 [2019-11-20 03:12:21,334 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:12:21,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-20 03:12:21,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-11-20 03:12:21,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-20 03:12:21,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 170 transitions. [2019-11-20 03:12:21,377 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 170 transitions. Word has length 24 [2019-11-20 03:12:21,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:12:21,377 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 170 transitions. [2019-11-20 03:12:21,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:12:21,378 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 170 transitions. [2019-11-20 03:12:21,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-20 03:12:21,379 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:12:21,380 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:12:21,380 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:12:21,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:12:21,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1971493731, now seen corresponding path program 1 times [2019-11-20 03:12:21,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:12:21,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528796771] [2019-11-20 03:12:21,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:12:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:12:21,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:12:21,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528796771] [2019-11-20 03:12:21,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:12:21,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:12:21,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017503207] [2019-11-20 03:12:21,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:12:21,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:12:21,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:12:21,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:12:21,491 INFO L87 Difference]: Start difference. First operand 112 states and 170 transitions. Second operand 3 states. [2019-11-20 03:12:21,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:12:21,696 INFO L93 Difference]: Finished difference Result 232 states and 355 transitions. [2019-11-20 03:12:21,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:12:21,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-20 03:12:21,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:12:21,698 INFO L225 Difference]: With dead ends: 232 [2019-11-20 03:12:21,698 INFO L226 Difference]: Without dead ends: 130 [2019-11-20 03:12:21,700 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:12:21,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-20 03:12:21,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2019-11-20 03:12:21,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-20 03:12:21,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 190 transitions. [2019-11-20 03:12:21,727 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 190 transitions. Word has length 36 [2019-11-20 03:12:21,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:12:21,728 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 190 transitions. [2019-11-20 03:12:21,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:12:21,728 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 190 transitions. [2019-11-20 03:12:21,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-20 03:12:21,730 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:12:21,731 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:12:21,731 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:12:21,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:12:21,732 INFO L82 PathProgramCache]: Analyzing trace with hash 441356492, now seen corresponding path program 1 times [2019-11-20 03:12:21,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:12:21,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286830856] [2019-11-20 03:12:21,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:12:21,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:12:21,847 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 03:12:21,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286830856] [2019-11-20 03:12:21,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:12:21,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:12:21,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991560765] [2019-11-20 03:12:21,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:12:21,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:12:21,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:12:21,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:12:21,856 INFO L87 Difference]: Start difference. First operand 127 states and 190 transitions. Second operand 3 states. [2019-11-20 03:12:22,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:12:22,017 INFO L93 Difference]: Finished difference Result 265 states and 401 transitions. [2019-11-20 03:12:22,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:12:22,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-20 03:12:22,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:12:22,021 INFO L225 Difference]: With dead ends: 265 [2019-11-20 03:12:22,021 INFO L226 Difference]: Without dead ends: 148 [2019-11-20 03:12:22,022 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:12:22,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-11-20 03:12:22,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2019-11-20 03:12:22,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-20 03:12:22,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 212 transitions. [2019-11-20 03:12:22,036 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 212 transitions. Word has length 50 [2019-11-20 03:12:22,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:12:22,036 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 212 transitions. [2019-11-20 03:12:22,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:12:22,037 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 212 transitions. [2019-11-20 03:12:22,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-20 03:12:22,038 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:12:22,039 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:12:22,039 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:12:22,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:12:22,040 INFO L82 PathProgramCache]: Analyzing trace with hash -394489400, now seen corresponding path program 1 times [2019-11-20 03:12:22,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:12:22,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652780301] [2019-11-20 03:12:22,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:12:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:12:22,135 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 03:12:22,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652780301] [2019-11-20 03:12:22,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:12:22,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:12:22,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443915041] [2019-11-20 03:12:22,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:12:22,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:12:22,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:12:22,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:12:22,138 INFO L87 Difference]: Start difference. First operand 144 states and 212 transitions. Second operand 3 states. [2019-11-20 03:12:22,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:12:22,199 INFO L93 Difference]: Finished difference Result 410 states and 605 transitions. [2019-11-20 03:12:22,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:12:22,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-20 03:12:22,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:12:22,203 INFO L225 Difference]: With dead ends: 410 [2019-11-20 03:12:22,204 INFO L226 Difference]: Without dead ends: 276 [2019-11-20 03:12:22,205 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:12:22,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-20 03:12:22,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2019-11-20 03:12:22,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-11-20 03:12:22,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 405 transitions. [2019-11-20 03:12:22,248 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 405 transitions. Word has length 67 [2019-11-20 03:12:22,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:12:22,249 INFO L462 AbstractCegarLoop]: Abstraction has 276 states and 405 transitions. [2019-11-20 03:12:22,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:12:22,249 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 405 transitions. [2019-11-20 03:12:22,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 03:12:22,252 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:12:22,253 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:12:22,253 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:12:22,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:12:22,253 INFO L82 PathProgramCache]: Analyzing trace with hash 625494152, now seen corresponding path program 1 times [2019-11-20 03:12:22,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:12:22,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520259796] [2019-11-20 03:12:22,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:12:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:12:22,439 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-20 03:12:22,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520259796] [2019-11-20 03:12:22,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:12:22,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:12:22,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100936095] [2019-11-20 03:12:22,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:12:22,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:12:22,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:12:22,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:12:22,444 INFO L87 Difference]: Start difference. First operand 276 states and 405 transitions. Second operand 3 states. [2019-11-20 03:12:22,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:12:22,648 INFO L93 Difference]: Finished difference Result 590 states and 878 transitions. [2019-11-20 03:12:22,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:12:22,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-20 03:12:22,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:12:22,656 INFO L225 Difference]: With dead ends: 590 [2019-11-20 03:12:22,656 INFO L226 Difference]: Without dead ends: 324 [2019-11-20 03:12:22,663 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:12:22,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-11-20 03:12:22,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 318. [2019-11-20 03:12:22,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-11-20 03:12:22,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 457 transitions. [2019-11-20 03:12:22,698 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 457 transitions. Word has length 85 [2019-11-20 03:12:22,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:12:22,699 INFO L462 AbstractCegarLoop]: Abstraction has 318 states and 457 transitions. [2019-11-20 03:12:22,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:12:22,700 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 457 transitions. [2019-11-20 03:12:22,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-20 03:12:22,710 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:12:22,711 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:12:22,711 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:12:22,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:12:22,712 INFO L82 PathProgramCache]: Analyzing trace with hash 743834560, now seen corresponding path program 1 times [2019-11-20 03:12:22,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:12:22,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227229241] [2019-11-20 03:12:22,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:12:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:12:22,842 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-20 03:12:22,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227229241] [2019-11-20 03:12:22,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:12:22,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:12:22,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642884338] [2019-11-20 03:12:22,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:12:22,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:12:22,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:12:22,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:12:22,846 INFO L87 Difference]: Start difference. First operand 318 states and 457 transitions. Second operand 3 states. [2019-11-20 03:12:22,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:12:22,906 INFO L93 Difference]: Finished difference Result 473 states and 680 transitions. [2019-11-20 03:12:22,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:12:22,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-20 03:12:22,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:12:22,910 INFO L225 Difference]: With dead ends: 473 [2019-11-20 03:12:22,911 INFO L226 Difference]: Without dead ends: 471 [2019-11-20 03:12:22,911 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:12:22,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-11-20 03:12:22,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 471. [2019-11-20 03:12:22,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-11-20 03:12:22,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 678 transitions. [2019-11-20 03:12:22,949 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 678 transitions. Word has length 105 [2019-11-20 03:12:22,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:12:22,951 INFO L462 AbstractCegarLoop]: Abstraction has 471 states and 678 transitions. [2019-11-20 03:12:22,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:12:22,951 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 678 transitions. [2019-11-20 03:12:22,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-20 03:12:22,954 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:12:22,958 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:12:22,958 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:12:22,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:12:22,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1167688199, now seen corresponding path program 1 times [2019-11-20 03:12:22,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:12:22,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103399581] [2019-11-20 03:12:22,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:12:22,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:12:23,044 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-20 03:12:23,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103399581] [2019-11-20 03:12:23,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:12:23,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:12:23,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282558304] [2019-11-20 03:12:23,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:12:23,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:12:23,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:12:23,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:12:23,047 INFO L87 Difference]: Start difference. First operand 471 states and 678 transitions. Second operand 3 states. [2019-11-20 03:12:23,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:12:23,275 INFO L93 Difference]: Finished difference Result 1082 states and 1605 transitions. [2019-11-20 03:12:23,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:12:23,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-11-20 03:12:23,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:12:23,281 INFO L225 Difference]: With dead ends: 1082 [2019-11-20 03:12:23,281 INFO L226 Difference]: Without dead ends: 618 [2019-11-20 03:12:23,282 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:12:23,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-11-20 03:12:23,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 594. [2019-11-20 03:12:23,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2019-11-20 03:12:23,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 876 transitions. [2019-11-20 03:12:23,342 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 876 transitions. Word has length 123 [2019-11-20 03:12:23,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:12:23,342 INFO L462 AbstractCegarLoop]: Abstraction has 594 states and 876 transitions. [2019-11-20 03:12:23,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:12:23,343 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 876 transitions. [2019-11-20 03:12:23,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-20 03:12:23,346 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:12:23,346 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:12:23,346 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:12:23,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:12:23,347 INFO L82 PathProgramCache]: Analyzing trace with hash -266344288, now seen corresponding path program 1 times [2019-11-20 03:12:23,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:12:23,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280295281] [2019-11-20 03:12:23,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:12:23,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:12:23,443 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-20 03:12:23,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280295281] [2019-11-20 03:12:23,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:12:23,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:12:23,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554863903] [2019-11-20 03:12:23,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:12:23,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:12:23,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:12:23,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:12:23,446 INFO L87 Difference]: Start difference. First operand 594 states and 876 transitions. Second operand 3 states. [2019-11-20 03:12:23,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:12:23,661 INFO L93 Difference]: Finished difference Result 1456 states and 2204 transitions. [2019-11-20 03:12:23,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:12:23,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-11-20 03:12:23,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:12:23,668 INFO L225 Difference]: With dead ends: 1456 [2019-11-20 03:12:23,669 INFO L226 Difference]: Without dead ends: 821 [2019-11-20 03:12:23,670 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:12:23,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2019-11-20 03:12:23,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 783. [2019-11-20 03:12:23,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-11-20 03:12:23,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1128 transitions. [2019-11-20 03:12:23,697 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1128 transitions. Word has length 149 [2019-11-20 03:12:23,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:12:23,698 INFO L462 AbstractCegarLoop]: Abstraction has 783 states and 1128 transitions. [2019-11-20 03:12:23,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:12:23,698 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1128 transitions. [2019-11-20 03:12:23,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-20 03:12:23,701 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:12:23,701 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 8, 8, 8, 8, 8, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:12:23,701 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:12:23,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:12:23,702 INFO L82 PathProgramCache]: Analyzing trace with hash -466571119, now seen corresponding path program 1 times [2019-11-20 03:12:23,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:12:23,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270988844] [2019-11-20 03:12:23,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:12:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:12:23,774 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2019-11-20 03:12:23,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270988844] [2019-11-20 03:12:23,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:12:23,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:12:23,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017565654] [2019-11-20 03:12:23,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:12:23,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:12:23,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:12:23,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:12:23,782 INFO L87 Difference]: Start difference. First operand 783 states and 1128 transitions. Second operand 3 states. [2019-11-20 03:12:23,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:12:23,985 INFO L93 Difference]: Finished difference Result 1712 states and 2481 transitions. [2019-11-20 03:12:23,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:12:23,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-11-20 03:12:23,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:12:23,992 INFO L225 Difference]: With dead ends: 1712 [2019-11-20 03:12:23,992 INFO L226 Difference]: Without dead ends: 894 [2019-11-20 03:12:23,993 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:12:23,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2019-11-20 03:12:24,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 858. [2019-11-20 03:12:24,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 858 states. [2019-11-20 03:12:24,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1224 transitions. [2019-11-20 03:12:24,020 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1224 transitions. Word has length 170 [2019-11-20 03:12:24,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:12:24,021 INFO L462 AbstractCegarLoop]: Abstraction has 858 states and 1224 transitions. [2019-11-20 03:12:24,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:12:24,021 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1224 transitions. [2019-11-20 03:12:24,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-11-20 03:12:24,024 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:12:24,024 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:12:24,025 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:12:24,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:12:24,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1681812864, now seen corresponding path program 1 times [2019-11-20 03:12:24,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:12:24,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565269082] [2019-11-20 03:12:24,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:12:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:12:24,103 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-11-20 03:12:24,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565269082] [2019-11-20 03:12:24,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:12:24,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:12:24,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743923359] [2019-11-20 03:12:24,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:12:24,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:12:24,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:12:24,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:12:24,109 INFO L87 Difference]: Start difference. First operand 858 states and 1224 transitions. Second operand 3 states. [2019-11-20 03:12:24,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:12:24,334 INFO L93 Difference]: Finished difference Result 1862 states and 2673 transitions. [2019-11-20 03:12:24,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:12:24,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-11-20 03:12:24,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:12:24,342 INFO L225 Difference]: With dead ends: 1862 [2019-11-20 03:12:24,342 INFO L226 Difference]: Without dead ends: 987 [2019-11-20 03:12:24,344 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:12:24,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2019-11-20 03:12:24,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 951. [2019-11-20 03:12:24,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2019-11-20 03:12:24,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1356 transitions. [2019-11-20 03:12:24,376 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1356 transitions. Word has length 194 [2019-11-20 03:12:24,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:12:24,376 INFO L462 AbstractCegarLoop]: Abstraction has 951 states and 1356 transitions. [2019-11-20 03:12:24,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:12:24,376 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1356 transitions. [2019-11-20 03:12:24,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-11-20 03:12:24,381 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:12:24,381 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 5, 5, 4, 4, 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] [2019-11-20 03:12:24,381 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:12:24,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:12:24,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1348358718, now seen corresponding path program 1 times [2019-11-20 03:12:24,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:12:24,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881930951] [2019-11-20 03:12:24,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:12:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:12:24,478 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 416 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-11-20 03:12:24,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881930951] [2019-11-20 03:12:24,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:12:24,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:12:24,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51789681] [2019-11-20 03:12:24,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:12:24,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:12:24,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:12:24,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:12:24,481 INFO L87 Difference]: Start difference. First operand 951 states and 1356 transitions. Second operand 3 states. [2019-11-20 03:12:24,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:12:24,536 INFO L93 Difference]: Finished difference Result 2833 states and 4038 transitions. [2019-11-20 03:12:24,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:12:24,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2019-11-20 03:12:24,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:12:24,549 INFO L225 Difference]: With dead ends: 2833 [2019-11-20 03:12:24,550 INFO L226 Difference]: Without dead ends: 1892 [2019-11-20 03:12:24,552 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:12:24,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2019-11-20 03:12:24,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1890. [2019-11-20 03:12:24,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1890 states. [2019-11-20 03:12:24,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 2693 transitions. [2019-11-20 03:12:24,620 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 2693 transitions. Word has length 224 [2019-11-20 03:12:24,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:12:24,620 INFO L462 AbstractCegarLoop]: Abstraction has 1890 states and 2693 transitions. [2019-11-20 03:12:24,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:12:24,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 2693 transitions. [2019-11-20 03:12:24,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-11-20 03:12:24,627 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:12:24,628 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 5, 5, 4, 4, 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] [2019-11-20 03:12:24,628 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:12:24,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:12:24,628 INFO L82 PathProgramCache]: Analyzing trace with hash 132204992, now seen corresponding path program 1 times [2019-11-20 03:12:24,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:12:24,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596956888] [2019-11-20 03:12:24,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:12:24,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:12:24,777 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 338 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2019-11-20 03:12:24,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596956888] [2019-11-20 03:12:24,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:12:24,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:12:24,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813006596] [2019-11-20 03:12:24,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:12:24,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:12:24,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:12:24,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:12:24,780 INFO L87 Difference]: Start difference. First operand 1890 states and 2693 transitions. Second operand 3 states. [2019-11-20 03:12:25,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:12:25,019 INFO L93 Difference]: Finished difference Result 4076 states and 5839 transitions. [2019-11-20 03:12:25,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:12:25,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2019-11-20 03:12:25,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:12:25,034 INFO L225 Difference]: With dead ends: 4076 [2019-11-20 03:12:25,034 INFO L226 Difference]: Without dead ends: 2166 [2019-11-20 03:12:25,037 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:12:25,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2166 states. [2019-11-20 03:12:25,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2166 to 2100. [2019-11-20 03:12:25,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2019-11-20 03:12:25,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 3005 transitions. [2019-11-20 03:12:25,104 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 3005 transitions. Word has length 224 [2019-11-20 03:12:25,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:12:25,105 INFO L462 AbstractCegarLoop]: Abstraction has 2100 states and 3005 transitions. [2019-11-20 03:12:25,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:12:25,105 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 3005 transitions. [2019-11-20 03:12:25,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-11-20 03:12:25,111 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:12:25,112 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:12:25,112 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:12:25,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:12:25,113 INFO L82 PathProgramCache]: Analyzing trace with hash 912871510, now seen corresponding path program 1 times [2019-11-20 03:12:25,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:12:25,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325944656] [2019-11-20 03:12:25,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:12:25,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:12:25,210 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 383 proven. 0 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2019-11-20 03:12:25,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325944656] [2019-11-20 03:12:25,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:12:25,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:12:25,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760712865] [2019-11-20 03:12:25,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:12:25,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:12:25,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:12:25,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:12:25,213 INFO L87 Difference]: Start difference. First operand 2100 states and 3005 transitions. Second operand 3 states. [2019-11-20 03:12:25,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:12:25,452 INFO L93 Difference]: Finished difference Result 4256 states and 6073 transitions. [2019-11-20 03:12:25,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:12:25,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 259 [2019-11-20 03:12:25,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:12:25,466 INFO L225 Difference]: With dead ends: 4256 [2019-11-20 03:12:25,467 INFO L226 Difference]: Without dead ends: 2148 [2019-11-20 03:12:25,470 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:12:25,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2019-11-20 03:12:25,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 2082. [2019-11-20 03:12:25,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2082 states. [2019-11-20 03:12:25,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 2082 states and 2951 transitions. [2019-11-20 03:12:25,530 INFO L78 Accepts]: Start accepts. Automaton has 2082 states and 2951 transitions. Word has length 259 [2019-11-20 03:12:25,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:12:25,531 INFO L462 AbstractCegarLoop]: Abstraction has 2082 states and 2951 transitions. [2019-11-20 03:12:25,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:12:25,531 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 2951 transitions. [2019-11-20 03:12:25,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-11-20 03:12:25,538 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:12:25,538 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:12:25,538 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:12:25,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:12:25,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1837028224, now seen corresponding path program 1 times [2019-11-20 03:12:25,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:12:25,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771565386] [2019-11-20 03:12:25,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:12:25,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:12:25,750 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2019-11-20 03:12:25,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771565386] [2019-11-20 03:12:25,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:12:25,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:12:25,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193391272] [2019-11-20 03:12:25,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:12:25,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:12:25,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:12:25,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:12:25,753 INFO L87 Difference]: Start difference. First operand 2082 states and 2951 transitions. Second operand 3 states. [2019-11-20 03:12:25,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:12:25,820 INFO L93 Difference]: Finished difference Result 6211 states and 8802 transitions. [2019-11-20 03:12:25,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:12:25,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 269 [2019-11-20 03:12:25,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:12:25,845 INFO L225 Difference]: With dead ends: 6211 [2019-11-20 03:12:25,845 INFO L226 Difference]: Without dead ends: 4139 [2019-11-20 03:12:25,849 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:12:25,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4139 states. [2019-11-20 03:12:25,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4139 to 4137. [2019-11-20 03:12:25,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4137 states. [2019-11-20 03:12:25,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4137 states to 4137 states and 5847 transitions. [2019-11-20 03:12:25,994 INFO L78 Accepts]: Start accepts. Automaton has 4137 states and 5847 transitions. Word has length 269 [2019-11-20 03:12:25,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:12:25,994 INFO L462 AbstractCegarLoop]: Abstraction has 4137 states and 5847 transitions. [2019-11-20 03:12:25,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:12:25,995 INFO L276 IsEmpty]: Start isEmpty. Operand 4137 states and 5847 transitions. [2019-11-20 03:12:26,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-11-20 03:12:26,006 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:12:26,007 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:12:26,007 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:12:26,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:12:26,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1739569540, now seen corresponding path program 1 times [2019-11-20 03:12:26,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:12:26,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764047544] [2019-11-20 03:12:26,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:12:26,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:12:26,173 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-11-20 03:12:26,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764047544] [2019-11-20 03:12:26,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:12:26,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:12:26,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735458849] [2019-11-20 03:12:26,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:12:26,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:12:26,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:12:26,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:12:26,176 INFO L87 Difference]: Start difference. First operand 4137 states and 5847 transitions. Second operand 3 states. [2019-11-20 03:12:26,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:12:26,407 INFO L93 Difference]: Finished difference Result 8369 states and 11808 transitions. [2019-11-20 03:12:26,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:12:26,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 269 [2019-11-20 03:12:26,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:12:26,434 INFO L225 Difference]: With dead ends: 8369 [2019-11-20 03:12:26,434 INFO L226 Difference]: Without dead ends: 4245 [2019-11-20 03:12:26,441 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:12:26,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4245 states. [2019-11-20 03:12:26,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4245 to 4137. [2019-11-20 03:12:26,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4137 states. [2019-11-20 03:12:26,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4137 states to 4137 states and 5739 transitions. [2019-11-20 03:12:26,566 INFO L78 Accepts]: Start accepts. Automaton has 4137 states and 5739 transitions. Word has length 269 [2019-11-20 03:12:26,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:12:26,566 INFO L462 AbstractCegarLoop]: Abstraction has 4137 states and 5739 transitions. [2019-11-20 03:12:26,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:12:26,567 INFO L276 IsEmpty]: Start isEmpty. Operand 4137 states and 5739 transitions. [2019-11-20 03:12:26,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-11-20 03:12:26,577 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:12:26,577 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:12:26,577 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:12:26,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:12:26,578 INFO L82 PathProgramCache]: Analyzing trace with hash 938764333, now seen corresponding path program 1 times [2019-11-20 03:12:26,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:12:26,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121126248] [2019-11-20 03:12:26,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:12:26,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:12:26,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1052 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2019-11-20 03:12:26,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121126248] [2019-11-20 03:12:26,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:12:26,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:12:26,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748145453] [2019-11-20 03:12:26,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:12:26,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:12:26,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:12:26,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:12:26,698 INFO L87 Difference]: Start difference. First operand 4137 states and 5739 transitions. Second operand 3 states. [2019-11-20 03:12:26,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:12:26,936 INFO L93 Difference]: Finished difference Result 8855 states and 12162 transitions. [2019-11-20 03:12:26,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:12:26,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 296 [2019-11-20 03:12:26,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:12:26,964 INFO L225 Difference]: With dead ends: 8855 [2019-11-20 03:12:26,965 INFO L226 Difference]: Without dead ends: 4731 [2019-11-20 03:12:26,970 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:12:26,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4731 states. [2019-11-20 03:12:27,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4731 to 4311. [2019-11-20 03:12:27,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4311 states. [2019-11-20 03:12:27,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4311 states to 4311 states and 5973 transitions. [2019-11-20 03:12:27,115 INFO L78 Accepts]: Start accepts. Automaton has 4311 states and 5973 transitions. Word has length 296 [2019-11-20 03:12:27,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:12:27,116 INFO L462 AbstractCegarLoop]: Abstraction has 4311 states and 5973 transitions. [2019-11-20 03:12:27,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:12:27,116 INFO L276 IsEmpty]: Start isEmpty. Operand 4311 states and 5973 transitions. [2019-11-20 03:12:27,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-11-20 03:12:27,126 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:12:27,126 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:12:27,127 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:12:27,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:12:27,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1894222412, now seen corresponding path program 1 times [2019-11-20 03:12:27,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:12:27,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991851375] [2019-11-20 03:12:27,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:12:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:12:27,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1052 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2019-11-20 03:12:27,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991851375] [2019-11-20 03:12:27,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:12:27,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:12:27,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677671593] [2019-11-20 03:12:27,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:12:27,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:12:27,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:12:27,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:12:27,257 INFO L87 Difference]: Start difference. First operand 4311 states and 5973 transitions. Second operand 3 states. [2019-11-20 03:12:27,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:12:27,486 INFO L93 Difference]: Finished difference Result 8933 states and 12252 transitions. [2019-11-20 03:12:27,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:12:27,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 297 [2019-11-20 03:12:27,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:12:27,521 INFO L225 Difference]: With dead ends: 8933 [2019-11-20 03:12:27,522 INFO L226 Difference]: Without dead ends: 4131 [2019-11-20 03:12:27,529 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:12:27,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4131 states. [2019-11-20 03:12:27,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4131 to 4113. [2019-11-20 03:12:27,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4113 states. [2019-11-20 03:12:27,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4113 states to 4113 states and 5679 transitions. [2019-11-20 03:12:27,632 INFO L78 Accepts]: Start accepts. Automaton has 4113 states and 5679 transitions. Word has length 297 [2019-11-20 03:12:27,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:12:27,633 INFO L462 AbstractCegarLoop]: Abstraction has 4113 states and 5679 transitions. [2019-11-20 03:12:27,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:12:27,633 INFO L276 IsEmpty]: Start isEmpty. Operand 4113 states and 5679 transitions. [2019-11-20 03:12:27,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-11-20 03:12:27,643 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:12:27,644 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:12:27,644 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:12:27,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:12:27,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1483906000, now seen corresponding path program 1 times [2019-11-20 03:12:27,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:12:27,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651588071] [2019-11-20 03:12:27,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:12:27,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:12:27,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-11-20 03:12:27,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651588071] [2019-11-20 03:12:27,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449219192] [2019-11-20 03:12:27,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d703ebdf-b093-4e4e-aa37-15280b382a02/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:12:27,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:12:27,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 03:12:27,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:12:28,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 875 trivial. 0 not checked. [2019-11-20 03:12:28,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 03:12:28,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-20 03:12:28,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563017330] [2019-11-20 03:12:28,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:12:28,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:12:28,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:12:28,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:12:28,128 INFO L87 Difference]: Start difference. First operand 4113 states and 5679 transitions. Second operand 3 states. [2019-11-20 03:12:28,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:12:28,194 INFO L93 Difference]: Finished difference Result 6199 states and 8538 transitions. [2019-11-20 03:12:28,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:12:28,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2019-11-20 03:12:28,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:12:28,203 INFO L225 Difference]: With dead ends: 6199 [2019-11-20 03:12:28,203 INFO L226 Difference]: Without dead ends: 4115 [2019-11-20 03:12:28,207 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:12:28,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4115 states. [2019-11-20 03:12:28,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4115 to 4101. [2019-11-20 03:12:28,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4101 states. [2019-11-20 03:12:28,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4101 states to 4101 states and 5643 transitions. [2019-11-20 03:12:28,316 INFO L78 Accepts]: Start accepts. Automaton has 4101 states and 5643 transitions. Word has length 307 [2019-11-20 03:12:28,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:12:28,317 INFO L462 AbstractCegarLoop]: Abstraction has 4101 states and 5643 transitions. [2019-11-20 03:12:28,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:12:28,318 INFO L276 IsEmpty]: Start isEmpty. Operand 4101 states and 5643 transitions. [2019-11-20 03:12:28,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-11-20 03:12:28,328 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:12:28,328 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:12:28,534 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:12:28,534 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:12:28,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:12:28,535 INFO L82 PathProgramCache]: Analyzing trace with hash -321532334, now seen corresponding path program 1 times [2019-11-20 03:12:28,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:12:28,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201472516] [2019-11-20 03:12:28,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:12:28,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:12:28,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-11-20 03:12:28,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201472516] [2019-11-20 03:12:28,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124251578] [2019-11-20 03:12:28,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d703ebdf-b093-4e4e-aa37-15280b382a02/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:12:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:12:28,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 03:12:28,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:12:29,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-11-20 03:12:29,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:12:29,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 03:12:29,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494249133] [2019-11-20 03:12:29,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:12:29,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:12:29,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:12:29,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:12:29,029 INFO L87 Difference]: Start difference. First operand 4101 states and 5643 transitions. Second operand 4 states. [2019-11-20 03:12:29,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:12:29,442 INFO L93 Difference]: Finished difference Result 7278 states and 10118 transitions. [2019-11-20 03:12:29,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 03:12:29,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 307 [2019-11-20 03:12:29,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:12:29,452 INFO L225 Difference]: With dead ends: 7278 [2019-11-20 03:12:29,453 INFO L226 Difference]: Without dead ends: 5086 [2019-11-20 03:12:29,457 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:12:29,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5086 states. [2019-11-20 03:12:29,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5086 to 4274. [2019-11-20 03:12:29,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4274 states. [2019-11-20 03:12:29,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4274 states to 4274 states and 5908 transitions. [2019-11-20 03:12:29,590 INFO L78 Accepts]: Start accepts. Automaton has 4274 states and 5908 transitions. Word has length 307 [2019-11-20 03:12:29,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:12:29,590 INFO L462 AbstractCegarLoop]: Abstraction has 4274 states and 5908 transitions. [2019-11-20 03:12:29,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:12:29,591 INFO L276 IsEmpty]: Start isEmpty. Operand 4274 states and 5908 transitions. [2019-11-20 03:12:29,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-11-20 03:12:29,601 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:12:29,601 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:12:29,806 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:12:29,806 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:12:29,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:12:29,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1368718125, now seen corresponding path program 1 times [2019-11-20 03:12:29,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:12:29,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142760991] [2019-11-20 03:12:29,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:12:29,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:12:29,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-11-20 03:12:29,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142760991] [2019-11-20 03:12:29,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134556926] [2019-11-20 03:12:29,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d703ebdf-b093-4e4e-aa37-15280b382a02/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:12:30,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:12:30,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 03:12:30,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:12:30,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-11-20 03:12:30,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:12:30,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 03:12:30,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759294432] [2019-11-20 03:12:30,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:12:30,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:12:30,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:12:30,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:12:30,208 INFO L87 Difference]: Start difference. First operand 4274 states and 5908 transitions. Second operand 4 states. [2019-11-20 03:12:30,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:12:30,513 INFO L93 Difference]: Finished difference Result 5429 states and 7539 transitions. [2019-11-20 03:12:30,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:12:30,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2019-11-20 03:12:30,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:12:30,519 INFO L225 Difference]: With dead ends: 5429 [2019-11-20 03:12:30,519 INFO L226 Difference]: Without dead ends: 2207 [2019-11-20 03:12:30,523 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:12:30,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2207 states. [2019-11-20 03:12:30,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2207 to 2207. [2019-11-20 03:12:30,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2207 states. [2019-11-20 03:12:30,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2207 states to 2207 states and 3065 transitions. [2019-11-20 03:12:30,590 INFO L78 Accepts]: Start accepts. Automaton has 2207 states and 3065 transitions. Word has length 308 [2019-11-20 03:12:30,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:12:30,590 INFO L462 AbstractCegarLoop]: Abstraction has 2207 states and 3065 transitions. [2019-11-20 03:12:30,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:12:30,591 INFO L276 IsEmpty]: Start isEmpty. Operand 2207 states and 3065 transitions. [2019-11-20 03:12:30,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-11-20 03:12:30,600 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:12:30,601 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:12:30,805 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:12:30,806 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:12:30,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:12:30,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1115026887, now seen corresponding path program 1 times [2019-11-20 03:12:30,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:12:30,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810806721] [2019-11-20 03:12:30,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:12:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:12:31,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 649 proven. 5 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2019-11-20 03:12:31,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810806721] [2019-11-20 03:12:31,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616490058] [2019-11-20 03:12:31,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d703ebdf-b093-4e4e-aa37-15280b382a02/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:12:31,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:12:31,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 03:12:31,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:12:31,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 649 proven. 5 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2019-11-20 03:12:31,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:12:31,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 03:12:31,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763228123] [2019-11-20 03:12:31,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:12:31,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:12:31,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:12:31,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:12:31,296 INFO L87 Difference]: Start difference. First operand 2207 states and 3065 transitions. Second operand 4 states. [2019-11-20 03:12:31,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:12:31,601 INFO L93 Difference]: Finished difference Result 3153 states and 4322 transitions. [2019-11-20 03:12:31,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:12:31,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 333 [2019-11-20 03:12:31,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:12:31,603 INFO L225 Difference]: With dead ends: 3153 [2019-11-20 03:12:31,603 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 03:12:31,607 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:12:31,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 03:12:31,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 03:12:31,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 03:12:31,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 03:12:31,608 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 333 [2019-11-20 03:12:31,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:12:31,609 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 03:12:31,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:12:31,609 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 03:12:31,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 03:12:31,814 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:12:31,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 03:12:32,345 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 3 [2019-11-20 03:12:32,543 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 34 [2019-11-20 03:12:33,119 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 23 [2019-11-20 03:12:33,122 INFO L447 ceAbstractionStarter]: At program point L630(lines 622 632) the Hoare annotation is: true [2019-11-20 03:12:33,123 INFO L444 ceAbstractionStarter]: For program point L300(lines 300 304) no Hoare annotation was computed. [2019-11-20 03:12:33,123 INFO L444 ceAbstractionStarter]: For program point L300-2(lines 300 304) no Hoare annotation was computed. [2019-11-20 03:12:33,123 INFO L444 ceAbstractionStarter]: For program point L168(lines 168 549) no Hoare annotation was computed. [2019-11-20 03:12:33,123 INFO L444 ceAbstractionStarter]: For program point L135(lines 135 560) no Hoare annotation was computed. [2019-11-20 03:12:33,123 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 571) no Hoare annotation was computed. [2019-11-20 03:12:33,123 INFO L444 ceAbstractionStarter]: For program point L433(lines 433 437) no Hoare annotation was computed. [2019-11-20 03:12:33,123 INFO L444 ceAbstractionStarter]: For program point L433-2(lines 203 535) no Hoare annotation was computed. [2019-11-20 03:12:33,123 INFO L447 ceAbstractionStarter]: At program point L202(lines 201 538) the Hoare annotation is: true [2019-11-20 03:12:33,124 INFO L440 ceAbstractionStarter]: At program point L169(lines 165 550) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-20 03:12:33,124 INFO L440 ceAbstractionStarter]: At program point L103(lines 102 571) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (= ULTIMATE.start_ssl3_connect_~s__state~0 12292)) [2019-11-20 03:12:33,124 INFO L444 ceAbstractionStarter]: For program point L368(lines 368 372) no Hoare annotation was computed. [2019-11-20 03:12:33,124 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 407) no Hoare annotation was computed. [2019-11-20 03:12:33,124 INFO L444 ceAbstractionStarter]: For program point L402-2(lines 402 407) no Hoare annotation was computed. [2019-11-20 03:12:33,124 INFO L444 ceAbstractionStarter]: For program point L171(lines 171 548) no Hoare annotation was computed. [2019-11-20 03:12:33,124 INFO L444 ceAbstractionStarter]: For program point L138(lines 138 559) no Hoare annotation was computed. [2019-11-20 03:12:33,124 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 570) no Hoare annotation was computed. [2019-11-20 03:12:33,125 INFO L440 ceAbstractionStarter]: At program point L139(lines 135 560) 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)) [2019-11-20 03:12:33,125 INFO L440 ceAbstractionStarter]: At program point L536(lines 99 602) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse3 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse4 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse5 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528) .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (and (not .cse1) .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse3) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560) .cse0 .cse4 .cse1 .cse5) (and (= 4416 ULTIMATE.start_ssl3_connect_~s__state~0) .cse0) (and .cse2 .cse0 .cse3 .cse4 .cse1 .cse5) (<= ULTIMATE.start_ssl3_connect_~s__state~0 3))) [2019-11-20 03:12:33,125 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 82) no Hoare annotation was computed. [2019-11-20 03:12:33,125 INFO L447 ceAbstractionStarter]: At program point L603(lines 98 604) the Hoare annotation is: true [2019-11-20 03:12:33,125 INFO L444 ceAbstractionStarter]: For program point L174(lines 174 547) no Hoare annotation was computed. [2019-11-20 03:12:33,125 INFO L444 ceAbstractionStarter]: For program point L141(lines 141 558) no Hoare annotation was computed. [2019-11-20 03:12:33,126 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 569) no Hoare annotation was computed. [2019-11-20 03:12:33,126 INFO L444 ceAbstractionStarter]: For program point L373(lines 373 377) no Hoare annotation was computed. [2019-11-20 03:12:33,126 INFO L444 ceAbstractionStarter]: For program point L373-2(lines 373 377) no Hoare annotation was computed. [2019-11-20 03:12:33,126 INFO L440 ceAbstractionStarter]: At program point L208(lines 105 570) the Hoare annotation is: (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) [2019-11-20 03:12:33,126 INFO L440 ceAbstractionStarter]: At program point L175(lines 171 548) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-20 03:12:33,126 INFO L444 ceAbstractionStarter]: For program point L572(lines 572 600) no Hoare annotation was computed. [2019-11-20 03:12:33,126 INFO L444 ceAbstractionStarter]: For program point L77(lines 77 81) no Hoare annotation was computed. [2019-11-20 03:12:33,126 INFO L444 ceAbstractionStarter]: For program point L77-2(lines 74 82) no Hoare annotation was computed. [2019-11-20 03:12:33,127 INFO L444 ceAbstractionStarter]: For program point L573(lines 573 597) no Hoare annotation was computed. [2019-11-20 03:12:33,127 INFO L444 ceAbstractionStarter]: For program point L507-1(lines 203 535) no Hoare annotation was computed. [2019-11-20 03:12:33,127 INFO L444 ceAbstractionStarter]: For program point L342(lines 342 347) no Hoare annotation was computed. [2019-11-20 03:12:33,127 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 280) no Hoare annotation was computed. [2019-11-20 03:12:33,127 INFO L444 ceAbstractionStarter]: For program point L309-1(lines 309 323) no Hoare annotation was computed. [2019-11-20 03:12:33,127 INFO L444 ceAbstractionStarter]: For program point L177(lines 177 546) no Hoare annotation was computed. [2019-11-20 03:12:33,127 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 557) no Hoare annotation was computed. [2019-11-20 03:12:33,127 INFO L444 ceAbstractionStarter]: For program point L111(lines 111 568) no Hoare annotation was computed. [2019-11-20 03:12:33,127 INFO L444 ceAbstractionStarter]: For program point L607(lines 607 611) no Hoare annotation was computed. [2019-11-20 03:12:33,128 INFO L444 ceAbstractionStarter]: For program point L574(lines 574 583) no Hoare annotation was computed. [2019-11-20 03:12:33,128 INFO L444 ceAbstractionStarter]: For program point L607-2(lines 607 611) no Hoare annotation was computed. [2019-11-20 03:12:33,128 INFO L444 ceAbstractionStarter]: For program point L574-2(lines 573 595) no Hoare annotation was computed. [2019-11-20 03:12:33,128 INFO L440 ceAbstractionStarter]: At program point L145(lines 141 558) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4448) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-20 03:12:33,128 INFO L444 ceAbstractionStarter]: For program point L576(lines 576 580) no Hoare annotation was computed. [2019-11-20 03:12:33,128 INFO L444 ceAbstractionStarter]: For program point L444(lines 444 449) no Hoare annotation was computed. [2019-11-20 03:12:33,128 INFO L444 ceAbstractionStarter]: For program point L213(lines 213 217) no Hoare annotation was computed. [2019-11-20 03:12:33,128 INFO L444 ceAbstractionStarter]: For program point L180(lines 180 545) no Hoare annotation was computed. [2019-11-20 03:12:33,129 INFO L444 ceAbstractionStarter]: For program point L147(lines 147 556) no Hoare annotation was computed. [2019-11-20 03:12:33,129 INFO L444 ceAbstractionStarter]: For program point L213-2(lines 203 535) no Hoare annotation was computed. [2019-11-20 03:12:33,129 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 567) no Hoare annotation was computed. [2019-11-20 03:12:33,129 INFO L444 ceAbstractionStarter]: For program point L478(lines 478 482) no Hoare annotation was computed. [2019-11-20 03:12:33,129 INFO L444 ceAbstractionStarter]: For program point L313(lines 313 317) no Hoare annotation was computed. [2019-11-20 03:12:33,129 INFO L444 ceAbstractionStarter]: For program point L313-2(lines 311 323) no Hoare annotation was computed. [2019-11-20 03:12:33,129 INFO L440 ceAbstractionStarter]: At program point L181(lines 177 546) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-20 03:12:33,129 INFO L444 ceAbstractionStarter]: For program point L512-1(lines 512 516) no Hoare annotation was computed. [2019-11-20 03:12:33,129 INFO L444 ceAbstractionStarter]: For program point L413(lines 413 417) no Hoare annotation was computed. [2019-11-20 03:12:33,134 INFO L444 ceAbstractionStarter]: For program point L249(lines 249 254) no Hoare annotation was computed. [2019-11-20 03:12:33,134 INFO L444 ceAbstractionStarter]: For program point L183(lines 183 544) no Hoare annotation was computed. [2019-11-20 03:12:33,135 INFO L444 ceAbstractionStarter]: For program point L150(lines 150 555) no Hoare annotation was computed. [2019-11-20 03:12:33,135 INFO L444 ceAbstractionStarter]: For program point L117(lines 117 566) no Hoare annotation was computed. [2019-11-20 03:12:33,135 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 92) no Hoare annotation was computed. [2019-11-20 03:12:33,135 INFO L444 ceAbstractionStarter]: For program point L84-1(lines 66 620) no Hoare annotation was computed. [2019-11-20 03:12:33,135 INFO L440 ceAbstractionStarter]: At program point L151(lines 147 556) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4480) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-20 03:12:33,136 INFO L444 ceAbstractionStarter]: For program point L85(lines 85 89) no Hoare annotation was computed. [2019-11-20 03:12:33,136 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 03:12:33,136 INFO L444 ceAbstractionStarter]: For program point L483(lines 483 487) no Hoare annotation was computed. [2019-11-20 03:12:33,136 INFO L444 ceAbstractionStarter]: For program point L483-2(lines 483 487) no Hoare annotation was computed. [2019-11-20 03:12:33,136 INFO L444 ceAbstractionStarter]: For program point L285(lines 285 293) no Hoare annotation was computed. [2019-11-20 03:12:33,136 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 543) no Hoare annotation was computed. [2019-11-20 03:12:33,137 INFO L444 ceAbstractionStarter]: For program point L153(lines 153 554) no Hoare annotation was computed. [2019-11-20 03:12:33,137 INFO L444 ceAbstractionStarter]: For program point L120(lines 120 565) no Hoare annotation was computed. [2019-11-20 03:12:33,137 INFO L444 ceAbstractionStarter]: For program point L385(lines 385 389) no Hoare annotation was computed. [2019-11-20 03:12:33,137 INFO L444 ceAbstractionStarter]: For program point L352(lines 352 356) no Hoare annotation was computed. [2019-11-20 03:12:33,137 INFO L440 ceAbstractionStarter]: At program point L187(lines 183 544) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and (not (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) .cse0 .cse1) (and (and .cse0 .cse1) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)))) [2019-11-20 03:12:33,138 INFO L440 ceAbstractionStarter]: At program point L121(lines 117 566) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-20 03:12:33,138 INFO L440 ceAbstractionStarter]: At program point L353(lines 66 620) the Hoare annotation is: false [2019-11-20 03:12:33,138 INFO L447 ceAbstractionStarter]: At program point L618(lines 66 620) the Hoare annotation is: true [2019-11-20 03:12:33,138 INFO L444 ceAbstractionStarter]: For program point L585(lines 585 591) no Hoare annotation was computed. [2019-11-20 03:12:33,138 INFO L444 ceAbstractionStarter]: For program point L519(lines 519 523) no Hoare annotation was computed. [2019-11-20 03:12:33,138 INFO L444 ceAbstractionStarter]: For program point L519-2(lines 519 523) no Hoare annotation was computed. [2019-11-20 03:12:33,139 INFO L444 ceAbstractionStarter]: For program point L288(lines 288 292) no Hoare annotation was computed. [2019-11-20 03:12:33,139 INFO L444 ceAbstractionStarter]: For program point L288-2(lines 203 535) no Hoare annotation was computed. [2019-11-20 03:12:33,139 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 542) no Hoare annotation was computed. [2019-11-20 03:12:33,140 INFO L444 ceAbstractionStarter]: For program point L156(lines 156 553) no Hoare annotation was computed. [2019-11-20 03:12:33,140 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 564) no Hoare annotation was computed. [2019-11-20 03:12:33,140 INFO L447 ceAbstractionStarter]: At program point L619(lines 8 621) the Hoare annotation is: true [2019-11-20 03:12:33,141 INFO L444 ceAbstractionStarter]: For program point L454(lines 454 458) no Hoare annotation was computed. [2019-11-20 03:12:33,141 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 03:12:33,142 INFO L444 ceAbstractionStarter]: For program point L357(lines 357 361) no Hoare annotation was computed. [2019-11-20 03:12:33,142 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 242) no Hoare annotation was computed. [2019-11-20 03:12:33,142 INFO L444 ceAbstractionStarter]: For program point L192(lines 192 541) no Hoare annotation was computed. [2019-11-20 03:12:33,142 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 552) no Hoare annotation was computed. [2019-11-20 03:12:33,142 INFO L444 ceAbstractionStarter]: For program point L225-2(lines 203 535) no Hoare annotation was computed. [2019-11-20 03:12:33,142 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 563) no Hoare annotation was computed. [2019-11-20 03:12:33,143 INFO L440 ceAbstractionStarter]: At program point L193(lines 189 542) the Hoare annotation is: (or (and (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2))) [2019-11-20 03:12:33,143 INFO L440 ceAbstractionStarter]: At program point L127(lines 123 564) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-20 03:12:33,143 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 03:12:33,143 INFO L444 ceAbstractionStarter]: For program point L491-1(lines 491 503) no Hoare annotation was computed. [2019-11-20 03:12:33,143 INFO L444 ceAbstractionStarter]: For program point L425(lines 425 429) no Hoare annotation was computed. [2019-11-20 03:12:33,144 INFO L444 ceAbstractionStarter]: For program point L227(lines 227 232) no Hoare annotation was computed. [2019-11-20 03:12:33,144 INFO L444 ceAbstractionStarter]: For program point L195(lines 195 540) no Hoare annotation was computed. [2019-11-20 03:12:33,144 INFO L444 ceAbstractionStarter]: For program point L162(lines 162 551) no Hoare annotation was computed. [2019-11-20 03:12:33,144 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 562) no Hoare annotation was computed. [2019-11-20 03:12:33,144 INFO L444 ceAbstractionStarter]: For program point L526(lines 526 530) no Hoare annotation was computed. [2019-11-20 03:12:33,144 INFO L440 ceAbstractionStarter]: At program point L196(lines 195 540) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse3 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1) (and (not .cse2) .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse3 .cse1) (and .cse0 .cse3 .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)))) [2019-11-20 03:12:33,145 INFO L440 ceAbstractionStarter]: At program point L163(lines 153 554) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4480) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-20 03:12:33,145 INFO L444 ceAbstractionStarter]: For program point L494(lines 494 499) no Hoare annotation was computed. [2019-11-20 03:12:33,145 INFO L444 ceAbstractionStarter]: For program point L461(lines 461 472) no Hoare annotation was computed. [2019-11-20 03:12:33,145 INFO L444 ceAbstractionStarter]: For program point L461-1(lines 461 472) no Hoare annotation was computed. [2019-11-20 03:12:33,145 INFO L444 ceAbstractionStarter]: For program point L263(lines 263 267) no Hoare annotation was computed. [2019-11-20 03:12:33,146 INFO L444 ceAbstractionStarter]: For program point L263-2(lines 203 535) no Hoare annotation was computed. [2019-11-20 03:12:33,146 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 614) no Hoare annotation was computed. [2019-11-20 03:12:33,146 INFO L444 ceAbstractionStarter]: For program point L396(lines 396 400) no Hoare annotation was computed. [2019-11-20 03:12:33,146 INFO L444 ceAbstractionStarter]: For program point L330(lines 330 334) no Hoare annotation was computed. [2019-11-20 03:12:33,146 INFO L444 ceAbstractionStarter]: For program point L330-2(lines 203 535) no Hoare annotation was computed. [2019-11-20 03:12:33,147 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 539) no Hoare annotation was computed. [2019-11-20 03:12:33,147 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 550) no Hoare annotation was computed. [2019-11-20 03:12:33,147 INFO L444 ceAbstractionStarter]: For program point L132(lines 132 561) no Hoare annotation was computed. [2019-11-20 03:12:33,147 INFO L444 ceAbstractionStarter]: For program point L99-1(lines 66 620) no Hoare annotation was computed. [2019-11-20 03:12:33,147 INFO L444 ceAbstractionStarter]: For program point L463(lines 463 469) no Hoare annotation was computed. [2019-11-20 03:12:33,147 INFO L447 ceAbstractionStarter]: At program point L199(lines 198 539) the Hoare annotation is: true [2019-11-20 03:12:33,148 INFO L440 ceAbstractionStarter]: At program point L133(lines 129 562) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-20 03:12:33,148 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-20 03:12:33,148 INFO L444 ceAbstractionStarter]: For program point L233(lines 233 238) no Hoare annotation was computed. [2019-11-20 03:12:33,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 03:12:33 BoogieIcfgContainer [2019-11-20 03:12:33,190 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 03:12:33,191 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 03:12:33,191 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 03:12:33,191 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 03:12:33,192 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:12:20" (3/4) ... [2019-11-20 03:12:33,196 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 03:12:33,225 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-20 03:12:33,227 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 03:12:33,385 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d703ebdf-b093-4e4e-aa37-15280b382a02/bin/uautomizer/witness.graphml [2019-11-20 03:12:33,385 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 03:12:33,387 INFO L168 Benchmark]: Toolchain (without parser) took 14069.69 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 711.5 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -131.7 MB). Peak memory consumption was 579.8 MB. Max. memory is 11.5 GB. [2019-11-20 03:12:33,387 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:12:33,387 INFO L168 Benchmark]: CACSL2BoogieTranslator took 480.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -187.3 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-11-20 03:12:33,388 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.55 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-20 03:12:33,388 INFO L168 Benchmark]: Boogie Preprocessor took 49.64 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:12:33,388 INFO L168 Benchmark]: RCFGBuilder took 805.17 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.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 11.5 GB. [2019-11-20 03:12:33,389 INFO L168 Benchmark]: TraceAbstraction took 12471.73 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 563.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -24.5 MB). Peak memory consumption was 539.1 MB. Max. memory is 11.5 GB. [2019-11-20 03:12:33,389 INFO L168 Benchmark]: Witness Printer took 194.79 ms. Allocated memory is still 1.7 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-20 03:12:33,392 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 480.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -187.3 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.55 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.64 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 805.17 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.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12471.73 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 563.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -24.5 MB). Peak memory consumption was 539.1 MB. Max. memory is 11.5 GB. * Witness Printer took 194.79 ms. Allocated memory is still 1.7 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 614]: 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: 171]: Loop Invariant Derived loop invariant: (s__state <= 4512 && blastFlag <= 4) && 4432 <= s__state - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((s__state <= 4528 && blastFlag <= 4) && 4432 <= s__state) || ((((!(0 == s__hit) && s__state <= 4352) && s__s3__tmp__next_state___0 <= 3) && blastFlag <= 4) && 4352 <= s__state)) || blastFlag <= 2) || (((((4560 <= s__state && s__state <= 4560) && blastFlag <= 4) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || (4416 == s__state && blastFlag <= 4)) || (((((s__state <= 4352 && blastFlag <= 4) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || s__state <= 3 - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: ((!(0 == s__hit) && blastFlag <= 4) && 4432 <= s__state) || ((blastFlag <= 4 && 4432 <= s__state) && s__state <= 4560) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: (blastFlag <= 4 && s__state <= 4448) && 4432 <= s__state - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: blastFlag <= 2 && s__state == 12292 - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 622]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (s__state <= 4512 && blastFlag <= 4) && 4432 <= s__state - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (s__state <= 4528 && blastFlag <= 4) && 4432 <= s__state - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (blastFlag <= 4 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 189]: Loop Invariant Derived loop invariant: (0 == s__hit && 4432 <= s__state) || (4560 <= s__state && blastFlag <= 2) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: (s__state <= 4480 && blastFlag <= 4) && 4432 <= s__state - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: (s__state <= 4480 && blastFlag <= 4) && 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 && blastFlag <= 2) && 4352 <= s__state) || ((((!(0 == s__hit) && s__state <= 4352) && s__s3__tmp__next_state___0 <= 3) && blastFlag <= 4) && 4352 <= s__state)) || (((((s__state <= 4352 && blastFlag <= 4) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 125 locations, 1 error locations. Result: SAFE, OverallTime: 12.3s, OverallIterations: 21, TraceHistogramMax: 15, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.3s, HoareTripleCheckerStatistics: 4033 SDtfs, 1585 SDslu, 2268 SDs, 0 SdLazy, 1977 SolverSat, 491 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1323 GetRequests, 1294 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4311occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 1655 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 23 PreInvPairs, 191 NumberOfFragments, 281 HoareAnnotationTreeSize, 23 FomulaSimplifications, 13989 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 23 FomulaSimplificationsInter, 8919 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 5351 NumberOfCodeBlocks, 5351 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 5326 ConstructedInterpolants, 0 QuantifiedInterpolants, 2023446 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2379 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 25 InterpolantComputations, 18 PerfectInterpolantSequences, 16460/16530 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...