./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_12.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4215f0b7-5d85-4d78-85a5-d36d2dd760ee/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4215f0b7-5d85-4d78-85a5-d36d2dd760ee/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4215f0b7-5d85-4d78-85a5-d36d2dd760ee/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4215f0b7-5d85-4d78-85a5-d36d2dd760ee/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_12.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_4215f0b7-5d85-4d78-85a5-d36d2dd760ee/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4215f0b7-5d85-4d78-85a5-d36d2dd760ee/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b9ebacab53db4f4e6d9f51b7145688401913e247 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 21:19:39,373 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 21:19:39,375 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 21:19:39,382 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 21:19:39,382 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 21:19:39,383 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 21:19:39,384 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 21:19:39,385 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 21:19:39,387 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 21:19:39,387 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 21:19:39,388 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 21:19:39,389 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 21:19:39,389 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 21:19:39,390 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 21:19:39,390 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 21:19:39,391 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 21:19:39,392 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 21:19:39,392 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 21:19:39,394 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 21:19:39,395 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 21:19:39,396 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 21:19:39,397 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 21:19:39,398 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 21:19:39,398 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 21:19:39,400 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 21:19:39,400 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 21:19:39,400 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 21:19:39,401 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 21:19:39,401 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 21:19:39,401 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 21:19:39,402 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 21:19:39,402 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 21:19:39,402 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 21:19:39,403 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 21:19:39,404 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 21:19:39,404 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 21:19:39,404 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 21:19:39,404 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 21:19:39,404 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 21:19:39,405 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 21:19:39,405 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 21:19:39,406 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4215f0b7-5d85-4d78-85a5-d36d2dd760ee/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 21:19:39,415 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 21:19:39,415 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 21:19:39,416 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 21:19:39,416 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 21:19:39,416 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 21:19:39,416 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 21:19:39,416 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 21:19:39,417 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 21:19:39,417 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 21:19:39,417 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 21:19:39,417 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 21:19:39,417 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 21:19:39,417 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 21:19:39,417 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 21:19:39,417 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 21:19:39,418 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 21:19:39,418 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 21:19:39,418 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 21:19:39,418 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 21:19:39,419 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 21:19:39,419 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 21:19:39,419 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 21:19:39,419 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 21:19:39,419 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 21:19:39,419 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 21:19:39,419 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 21:19:39,420 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 21:19:39,420 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 21:19:39,420 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 21:19:39,420 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 21:19:39,420 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 21:19:39,420 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:19:39,421 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 21:19:39,421 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 21:19:39,421 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 21:19:39,421 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 21:19:39,421 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 21:19:39,421 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 21:19:39,421 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 21:19:39,422 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 21:19:39,422 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_4215f0b7-5d85-4d78-85a5-d36d2dd760ee/bin/utaipan 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 -> Taipan 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 -> b9ebacab53db4f4e6d9f51b7145688401913e247 [2019-12-07 21:19:39,534 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 21:19:39,543 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 21:19:39,546 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 21:19:39,547 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 21:19:39,548 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 21:19:39,548 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4215f0b7-5d85-4d78-85a5-d36d2dd760ee/bin/utaipan/../../sv-benchmarks/c/ssh-simplified/s3_srvr_12.cil.c [2019-12-07 21:19:39,597 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4215f0b7-5d85-4d78-85a5-d36d2dd760ee/bin/utaipan/data/a0db6f517/94929214c8094c518094a61ef2c9e4e1/FLAG358fc2257 [2019-12-07 21:19:40,016 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 21:19:40,017 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4215f0b7-5d85-4d78-85a5-d36d2dd760ee/sv-benchmarks/c/ssh-simplified/s3_srvr_12.cil.c [2019-12-07 21:19:40,025 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4215f0b7-5d85-4d78-85a5-d36d2dd760ee/bin/utaipan/data/a0db6f517/94929214c8094c518094a61ef2c9e4e1/FLAG358fc2257 [2019-12-07 21:19:40,380 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4215f0b7-5d85-4d78-85a5-d36d2dd760ee/bin/utaipan/data/a0db6f517/94929214c8094c518094a61ef2c9e4e1 [2019-12-07 21:19:40,384 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 21:19:40,385 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 21:19:40,386 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 21:19:40,387 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 21:19:40,391 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 21:19:40,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:19:40" (1/1) ... [2019-12-07 21:19:40,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cd23685 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:40, skipping insertion in model container [2019-12-07 21:19:40,395 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:19:40" (1/1) ... [2019-12-07 21:19:40,405 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 21:19:40,434 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 21:19:40,614 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:19:40,617 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 21:19:40,656 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:19:40,665 INFO L208 MainTranslator]: Completed translation [2019-12-07 21:19:40,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:40 WrapperNode [2019-12-07 21:19:40,665 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 21:19:40,666 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 21:19:40,666 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 21:19:40,666 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 21:19:40,671 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:40" (1/1) ... [2019-12-07 21:19:40,678 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:40" (1/1) ... [2019-12-07 21:19:40,701 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 21:19:40,702 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 21:19:40,702 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 21:19:40,702 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 21:19:40,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:40" (1/1) ... [2019-12-07 21:19:40,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:40" (1/1) ... [2019-12-07 21:19:40,710 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:40" (1/1) ... [2019-12-07 21:19:40,711 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:40" (1/1) ... [2019-12-07 21:19:40,716 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:40" (1/1) ... [2019-12-07 21:19:40,723 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:40" (1/1) ... [2019-12-07 21:19:40,725 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:40" (1/1) ... [2019-12-07 21:19:40,727 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 21:19:40,728 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 21:19:40,728 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 21:19:40,728 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 21:19:40,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4215f0b7-5d85-4d78-85a5-d36d2dd760ee/bin/utaipan/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-12-07 21:19:40,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 21:19:40,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 21:19:40,839 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 21:19:41,196 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-12-07 21:19:41,196 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-12-07 21:19:41,406 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 21:19:41,406 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 21:19:41,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:19:41 BoogieIcfgContainer [2019-12-07 21:19:41,407 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 21:19:41,407 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 21:19:41,408 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 21:19:41,409 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 21:19:41,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 09:19:40" (1/3) ... [2019-12-07 21:19:41,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ec3d6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:19:41, skipping insertion in model container [2019-12-07 21:19:41,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:40" (2/3) ... [2019-12-07 21:19:41,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ec3d6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:19:41, skipping insertion in model container [2019-12-07 21:19:41,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:19:41" (3/3) ... [2019-12-07 21:19:41,412 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_12.cil.c [2019-12-07 21:19:41,418 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 21:19:41,423 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 21:19:41,431 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 21:19:41,447 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 21:19:41,447 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 21:19:41,447 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 21:19:41,447 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 21:19:41,447 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 21:19:41,447 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 21:19:41,447 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 21:19:41,448 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 21:19:41,459 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states. [2019-12-07 21:19:41,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 21:19:41,464 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:41,464 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] [2019-12-07 21:19:41,465 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:19:41,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:41,469 INFO L82 PathProgramCache]: Analyzing trace with hash -814957616, now seen corresponding path program 1 times [2019-12-07 21:19:41,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:41,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630596397] [2019-12-07 21:19:41,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:41,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:41,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:41,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630596397] [2019-12-07 21:19:41,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:41,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:19:41,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462336128] [2019-12-07 21:19:41,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:19:41,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:41,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:19:41,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:41,613 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 3 states. [2019-12-07 21:19:41,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:41,741 INFO L93 Difference]: Finished difference Result 257 states and 449 transitions. [2019-12-07 21:19:41,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:19:41,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 21:19:41,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:41,754 INFO L225 Difference]: With dead ends: 257 [2019-12-07 21:19:41,754 INFO L226 Difference]: Without dead ends: 134 [2019-12-07 21:19:41,757 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-12-07 21:19:41,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-12-07 21:19:41,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2019-12-07 21:19:41,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-12-07 21:19:41,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 204 transitions. [2019-12-07 21:19:41,798 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 204 transitions. Word has length 21 [2019-12-07 21:19:41,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:41,799 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 204 transitions. [2019-12-07 21:19:41,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:19:41,799 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 204 transitions. [2019-12-07 21:19:41,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 21:19:41,800 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:41,800 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:19:41,800 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:19:41,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:41,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1704208736, now seen corresponding path program 1 times [2019-12-07 21:19:41,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:41,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087900707] [2019-12-07 21:19:41,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:41,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:41,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:41,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087900707] [2019-12-07 21:19:41,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:41,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:19:41,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403133864] [2019-12-07 21:19:41,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:19:41,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:41,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:19:41,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:41,840 INFO L87 Difference]: Start difference. First operand 134 states and 204 transitions. Second operand 3 states. [2019-12-07 21:19:41,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:41,933 INFO L93 Difference]: Finished difference Result 275 states and 417 transitions. [2019-12-07 21:19:41,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:19:41,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-07 21:19:41,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:41,935 INFO L225 Difference]: With dead ends: 275 [2019-12-07 21:19:41,935 INFO L226 Difference]: Without dead ends: 143 [2019-12-07 21:19:41,936 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-12-07 21:19:41,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-12-07 21:19:41,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2019-12-07 21:19:41,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-12-07 21:19:41,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 205 transitions. [2019-12-07 21:19:41,950 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 205 transitions. Word has length 23 [2019-12-07 21:19:41,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:41,950 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 205 transitions. [2019-12-07 21:19:41,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:19:41,951 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 205 transitions. [2019-12-07 21:19:41,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 21:19:41,952 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:41,952 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:19:41,952 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:19:41,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:41,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1765644408, now seen corresponding path program 1 times [2019-12-07 21:19:41,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:41,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746255862] [2019-12-07 21:19:41,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:41,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:41,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:41,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746255862] [2019-12-07 21:19:41,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:41,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:19:41,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603299314] [2019-12-07 21:19:41,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:19:41,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:41,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:19:41,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:41,983 INFO L87 Difference]: Start difference. First operand 135 states and 205 transitions. Second operand 3 states. [2019-12-07 21:19:42,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:42,063 INFO L93 Difference]: Finished difference Result 286 states and 435 transitions. [2019-12-07 21:19:42,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:19:42,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-07 21:19:42,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:42,065 INFO L225 Difference]: With dead ends: 286 [2019-12-07 21:19:42,065 INFO L226 Difference]: Without dead ends: 153 [2019-12-07 21:19:42,066 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-12-07 21:19:42,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-12-07 21:19:42,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2019-12-07 21:19:42,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-12-07 21:19:42,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 229 transitions. [2019-12-07 21:19:42,077 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 229 transitions. Word has length 23 [2019-12-07 21:19:42,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:42,078 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 229 transitions. [2019-12-07 21:19:42,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:19:42,078 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 229 transitions. [2019-12-07 21:19:42,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 21:19:42,079 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:42,079 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:19:42,079 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:19:42,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:42,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1394401220, now seen corresponding path program 1 times [2019-12-07 21:19:42,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:42,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450141535] [2019-12-07 21:19:42,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:42,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:42,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450141535] [2019-12-07 21:19:42,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:42,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:19:42,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011924110] [2019-12-07 21:19:42,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:19:42,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:42,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:19:42,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:42,107 INFO L87 Difference]: Start difference. First operand 151 states and 229 transitions. Second operand 3 states. [2019-12-07 21:19:42,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:42,188 INFO L93 Difference]: Finished difference Result 306 states and 468 transitions. [2019-12-07 21:19:42,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:19:42,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-07 21:19:42,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:42,190 INFO L225 Difference]: With dead ends: 306 [2019-12-07 21:19:42,190 INFO L226 Difference]: Without dead ends: 157 [2019-12-07 21:19:42,190 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-12-07 21:19:42,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-12-07 21:19:42,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-12-07 21:19:42,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-12-07 21:19:42,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 240 transitions. [2019-12-07 21:19:42,198 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 240 transitions. Word has length 23 [2019-12-07 21:19:42,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:42,198 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 240 transitions. [2019-12-07 21:19:42,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:19:42,198 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 240 transitions. [2019-12-07 21:19:42,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 21:19:42,199 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:42,199 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-12-07 21:19:42,200 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:19:42,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:42,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1515910148, now seen corresponding path program 1 times [2019-12-07 21:19:42,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:42,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091398257] [2019-12-07 21:19:42,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:42,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:42,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:42,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091398257] [2019-12-07 21:19:42,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:42,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:19:42,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849833978] [2019-12-07 21:19:42,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:19:42,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:42,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:19:42,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:42,220 INFO L87 Difference]: Start difference. First operand 157 states and 240 transitions. Second operand 3 states. [2019-12-07 21:19:42,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:42,300 INFO L93 Difference]: Finished difference Result 320 states and 487 transitions. [2019-12-07 21:19:42,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:19:42,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-12-07 21:19:42,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:42,302 INFO L225 Difference]: With dead ends: 320 [2019-12-07 21:19:42,302 INFO L226 Difference]: Without dead ends: 165 [2019-12-07 21:19:42,302 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-12-07 21:19:42,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-12-07 21:19:42,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 157. [2019-12-07 21:19:42,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-12-07 21:19:42,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 238 transitions. [2019-12-07 21:19:42,307 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 238 transitions. Word has length 24 [2019-12-07 21:19:42,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:42,307 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 238 transitions. [2019-12-07 21:19:42,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:19:42,308 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 238 transitions. [2019-12-07 21:19:42,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 21:19:42,308 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:42,308 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-12-07 21:19:42,309 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:19:42,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:42,309 INFO L82 PathProgramCache]: Analyzing trace with hash -369185236, now seen corresponding path program 1 times [2019-12-07 21:19:42,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:42,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138467142] [2019-12-07 21:19:42,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:42,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:42,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:42,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138467142] [2019-12-07 21:19:42,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:42,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:19:42,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997092014] [2019-12-07 21:19:42,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:19:42,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:42,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:19:42,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:42,329 INFO L87 Difference]: Start difference. First operand 157 states and 238 transitions. Second operand 3 states. [2019-12-07 21:19:42,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:42,395 INFO L93 Difference]: Finished difference Result 314 states and 476 transitions. [2019-12-07 21:19:42,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:19:42,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-12-07 21:19:42,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:42,396 INFO L225 Difference]: With dead ends: 314 [2019-12-07 21:19:42,396 INFO L226 Difference]: Without dead ends: 159 [2019-12-07 21:19:42,396 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-12-07 21:19:42,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-12-07 21:19:42,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2019-12-07 21:19:42,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-12-07 21:19:42,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 237 transitions. [2019-12-07 21:19:42,401 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 237 transitions. Word has length 24 [2019-12-07 21:19:42,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:42,401 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 237 transitions. [2019-12-07 21:19:42,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:19:42,401 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 237 transitions. [2019-12-07 21:19:42,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 21:19:42,402 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:42,402 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, 1] [2019-12-07 21:19:42,402 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:19:42,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:42,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1667011611, now seen corresponding path program 1 times [2019-12-07 21:19:42,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:42,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514542327] [2019-12-07 21:19:42,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:42,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:42,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514542327] [2019-12-07 21:19:42,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:42,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:19:42,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294413137] [2019-12-07 21:19:42,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:19:42,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:42,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:19:42,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:42,419 INFO L87 Difference]: Start difference. First operand 157 states and 237 transitions. Second operand 3 states. [2019-12-07 21:19:42,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:42,483 INFO L93 Difference]: Finished difference Result 320 states and 481 transitions. [2019-12-07 21:19:42,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:19:42,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-07 21:19:42,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:42,484 INFO L225 Difference]: With dead ends: 320 [2019-12-07 21:19:42,484 INFO L226 Difference]: Without dead ends: 165 [2019-12-07 21:19:42,484 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-12-07 21:19:42,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-12-07 21:19:42,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 157. [2019-12-07 21:19:42,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-12-07 21:19:42,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 235 transitions. [2019-12-07 21:19:42,490 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 235 transitions. Word has length 25 [2019-12-07 21:19:42,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:42,490 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 235 transitions. [2019-12-07 21:19:42,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:19:42,490 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 235 transitions. [2019-12-07 21:19:42,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 21:19:42,491 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:42,492 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, 1, 1] [2019-12-07 21:19:42,492 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:19:42,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:42,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1480730391, now seen corresponding path program 1 times [2019-12-07 21:19:42,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:42,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579667258] [2019-12-07 21:19:42,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:42,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:42,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:42,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579667258] [2019-12-07 21:19:42,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:42,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:19:42,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555057779] [2019-12-07 21:19:42,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:19:42,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:42,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:19:42,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:42,512 INFO L87 Difference]: Start difference. First operand 157 states and 235 transitions. Second operand 3 states. [2019-12-07 21:19:42,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:42,579 INFO L93 Difference]: Finished difference Result 320 states and 477 transitions. [2019-12-07 21:19:42,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:19:42,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-07 21:19:42,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:42,581 INFO L225 Difference]: With dead ends: 320 [2019-12-07 21:19:42,581 INFO L226 Difference]: Without dead ends: 165 [2019-12-07 21:19:42,582 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-12-07 21:19:42,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-12-07 21:19:42,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 157. [2019-12-07 21:19:42,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-12-07 21:19:42,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 233 transitions. [2019-12-07 21:19:42,589 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 233 transitions. Word has length 26 [2019-12-07 21:19:42,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:42,589 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 233 transitions. [2019-12-07 21:19:42,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:19:42,589 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 233 transitions. [2019-12-07 21:19:42,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 21:19:42,590 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:42,590 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, 1, 1] [2019-12-07 21:19:42,590 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:19:42,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:42,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1189380498, now seen corresponding path program 1 times [2019-12-07 21:19:42,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:42,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648927215] [2019-12-07 21:19:42,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:42,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:42,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:42,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648927215] [2019-12-07 21:19:42,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:42,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:19:42,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344950633] [2019-12-07 21:19:42,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:19:42,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:42,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:19:42,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:19:42,621 INFO L87 Difference]: Start difference. First operand 157 states and 233 transitions. Second operand 4 states. [2019-12-07 21:19:42,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:42,750 INFO L93 Difference]: Finished difference Result 446 states and 659 transitions. [2019-12-07 21:19:42,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:19:42,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-07 21:19:42,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:42,752 INFO L225 Difference]: With dead ends: 446 [2019-12-07 21:19:42,752 INFO L226 Difference]: Without dead ends: 291 [2019-12-07 21:19:42,753 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-07 21:19:42,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-12-07 21:19:42,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 267. [2019-12-07 21:19:42,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-12-07 21:19:42,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 397 transitions. [2019-12-07 21:19:42,762 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 397 transitions. Word has length 26 [2019-12-07 21:19:42,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:42,762 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 397 transitions. [2019-12-07 21:19:42,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:19:42,763 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 397 transitions. [2019-12-07 21:19:42,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 21:19:42,763 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:42,763 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:19:42,764 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:19:42,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:42,764 INFO L82 PathProgramCache]: Analyzing trace with hash 357320297, now seen corresponding path program 1 times [2019-12-07 21:19:42,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:42,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157760288] [2019-12-07 21:19:42,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:42,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:42,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157760288] [2019-12-07 21:19:42,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:42,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:19:42,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783482986] [2019-12-07 21:19:42,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:19:42,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:42,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:19:42,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:42,784 INFO L87 Difference]: Start difference. First operand 267 states and 397 transitions. Second operand 3 states. [2019-12-07 21:19:42,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:42,880 INFO L93 Difference]: Finished difference Result 612 states and 929 transitions. [2019-12-07 21:19:42,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:19:42,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-07 21:19:42,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:42,883 INFO L225 Difference]: With dead ends: 612 [2019-12-07 21:19:42,883 INFO L226 Difference]: Without dead ends: 347 [2019-12-07 21:19:42,884 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-12-07 21:19:42,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-12-07 21:19:42,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 331. [2019-12-07 21:19:42,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-12-07 21:19:42,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 507 transitions. [2019-12-07 21:19:42,899 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 507 transitions. Word has length 39 [2019-12-07 21:19:42,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:42,900 INFO L462 AbstractCegarLoop]: Abstraction has 331 states and 507 transitions. [2019-12-07 21:19:42,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:19:42,900 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 507 transitions. [2019-12-07 21:19:42,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 21:19:42,901 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:42,901 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:19:42,901 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:19:42,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:42,901 INFO L82 PathProgramCache]: Analyzing trace with hash 37401672, now seen corresponding path program 1 times [2019-12-07 21:19:42,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:42,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679221822] [2019-12-07 21:19:42,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:42,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:42,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679221822] [2019-12-07 21:19:42,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:42,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:19:42,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855077546] [2019-12-07 21:19:42,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:19:42,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:42,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:19:42,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:42,929 INFO L87 Difference]: Start difference. First operand 331 states and 507 transitions. Second operand 3 states. [2019-12-07 21:19:43,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:43,036 INFO L93 Difference]: Finished difference Result 670 states and 1027 transitions. [2019-12-07 21:19:43,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:19:43,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-07 21:19:43,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:43,038 INFO L225 Difference]: With dead ends: 670 [2019-12-07 21:19:43,038 INFO L226 Difference]: Without dead ends: 341 [2019-12-07 21:19:43,039 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-12-07 21:19:43,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-12-07 21:19:43,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 332. [2019-12-07 21:19:43,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-12-07 21:19:43,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 507 transitions. [2019-12-07 21:19:43,048 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 507 transitions. Word has length 40 [2019-12-07 21:19:43,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:43,048 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 507 transitions. [2019-12-07 21:19:43,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:19:43,048 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 507 transitions. [2019-12-07 21:19:43,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 21:19:43,049 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:43,049 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 21:19:43,049 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:19:43,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:43,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1642271592, now seen corresponding path program 1 times [2019-12-07 21:19:43,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:43,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333941371] [2019-12-07 21:19:43,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:43,067 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 21:19:43,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333941371] [2019-12-07 21:19:43,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:43,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:19:43,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074491217] [2019-12-07 21:19:43,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:19:43,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:43,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:19:43,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:43,068 INFO L87 Difference]: Start difference. First operand 332 states and 507 transitions. Second operand 3 states. [2019-12-07 21:19:43,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:43,164 INFO L93 Difference]: Finished difference Result 710 states and 1087 transitions. [2019-12-07 21:19:43,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:19:43,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-12-07 21:19:43,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:43,166 INFO L225 Difference]: With dead ends: 710 [2019-12-07 21:19:43,167 INFO L226 Difference]: Without dead ends: 380 [2019-12-07 21:19:43,167 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-12-07 21:19:43,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-12-07 21:19:43,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 364. [2019-12-07 21:19:43,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-12-07 21:19:43,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 553 transitions. [2019-12-07 21:19:43,177 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 553 transitions. Word has length 49 [2019-12-07 21:19:43,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:43,178 INFO L462 AbstractCegarLoop]: Abstraction has 364 states and 553 transitions. [2019-12-07 21:19:43,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:19:43,178 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 553 transitions. [2019-12-07 21:19:43,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 21:19:43,178 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:43,178 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:19:43,179 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:19:43,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:43,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1949419570, now seen corresponding path program 1 times [2019-12-07 21:19:43,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:43,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980670151] [2019-12-07 21:19:43,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:43,196 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 21:19:43,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980670151] [2019-12-07 21:19:43,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:43,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:19:43,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240467901] [2019-12-07 21:19:43,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:19:43,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:43,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:19:43,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:43,198 INFO L87 Difference]: Start difference. First operand 364 states and 553 transitions. Second operand 3 states. [2019-12-07 21:19:43,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:43,300 INFO L93 Difference]: Finished difference Result 791 states and 1210 transitions. [2019-12-07 21:19:43,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:19:43,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-12-07 21:19:43,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:43,302 INFO L225 Difference]: With dead ends: 791 [2019-12-07 21:19:43,302 INFO L226 Difference]: Without dead ends: 429 [2019-12-07 21:19:43,303 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:43,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-12-07 21:19:43,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 427. [2019-12-07 21:19:43,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-12-07 21:19:43,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 649 transitions. [2019-12-07 21:19:43,314 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 649 transitions. Word has length 49 [2019-12-07 21:19:43,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:43,314 INFO L462 AbstractCegarLoop]: Abstraction has 427 states and 649 transitions. [2019-12-07 21:19:43,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:19:43,314 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 649 transitions. [2019-12-07 21:19:43,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 21:19:43,315 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:43,315 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:19:43,315 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:19:43,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:43,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1558490573, now seen corresponding path program 1 times [2019-12-07 21:19:43,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:43,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790723542] [2019-12-07 21:19:43,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:43,333 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 21:19:43,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790723542] [2019-12-07 21:19:43,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:43,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:19:43,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391320721] [2019-12-07 21:19:43,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:19:43,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:43,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:19:43,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:43,335 INFO L87 Difference]: Start difference. First operand 427 states and 649 transitions. Second operand 3 states. [2019-12-07 21:19:43,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:43,435 INFO L93 Difference]: Finished difference Result 860 states and 1309 transitions. [2019-12-07 21:19:43,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:19:43,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-12-07 21:19:43,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:43,437 INFO L225 Difference]: With dead ends: 860 [2019-12-07 21:19:43,437 INFO L226 Difference]: Without dead ends: 435 [2019-12-07 21:19:43,438 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-12-07 21:19:43,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-12-07 21:19:43,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 427. [2019-12-07 21:19:43,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-12-07 21:19:43,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 645 transitions. [2019-12-07 21:19:43,455 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 645 transitions. Word has length 61 [2019-12-07 21:19:43,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:43,456 INFO L462 AbstractCegarLoop]: Abstraction has 427 states and 645 transitions. [2019-12-07 21:19:43,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:19:43,456 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 645 transitions. [2019-12-07 21:19:43,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 21:19:43,457 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:43,457 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:19:43,457 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:19:43,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:43,457 INFO L82 PathProgramCache]: Analyzing trace with hash 852247642, now seen corresponding path program 1 times [2019-12-07 21:19:43,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:43,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393643805] [2019-12-07 21:19:43,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:43,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:43,478 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:43,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393643805] [2019-12-07 21:19:43,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:43,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:19:43,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040808553] [2019-12-07 21:19:43,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:19:43,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:43,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:19:43,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:43,479 INFO L87 Difference]: Start difference. First operand 427 states and 645 transitions. Second operand 3 states. [2019-12-07 21:19:43,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:43,582 INFO L93 Difference]: Finished difference Result 897 states and 1354 transitions. [2019-12-07 21:19:43,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:19:43,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-12-07 21:19:43,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:43,585 INFO L225 Difference]: With dead ends: 897 [2019-12-07 21:19:43,586 INFO L226 Difference]: Without dead ends: 472 [2019-12-07 21:19:43,587 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-12-07 21:19:43,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-12-07 21:19:43,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 468. [2019-12-07 21:19:43,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2019-12-07 21:19:43,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 704 transitions. [2019-12-07 21:19:43,604 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 704 transitions. Word has length 72 [2019-12-07 21:19:43,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:43,605 INFO L462 AbstractCegarLoop]: Abstraction has 468 states and 704 transitions. [2019-12-07 21:19:43,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:19:43,605 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 704 transitions. [2019-12-07 21:19:43,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 21:19:43,606 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:43,606 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:19:43,606 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:19:43,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:43,606 INFO L82 PathProgramCache]: Analyzing trace with hash -55546437, now seen corresponding path program 1 times [2019-12-07 21:19:43,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:43,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653548525] [2019-12-07 21:19:43,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:43,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:43,635 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:43,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653548525] [2019-12-07 21:19:43,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:43,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:19:43,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676254796] [2019-12-07 21:19:43,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:19:43,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:43,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:19:43,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:43,636 INFO L87 Difference]: Start difference. First operand 468 states and 704 transitions. Second operand 3 states. [2019-12-07 21:19:43,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:43,745 INFO L93 Difference]: Finished difference Result 936 states and 1408 transitions. [2019-12-07 21:19:43,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:19:43,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-12-07 21:19:43,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:43,747 INFO L225 Difference]: With dead ends: 936 [2019-12-07 21:19:43,748 INFO L226 Difference]: Without dead ends: 470 [2019-12-07 21:19:43,748 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-12-07 21:19:43,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-12-07 21:19:43,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 468. [2019-12-07 21:19:43,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2019-12-07 21:19:43,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 701 transitions. [2019-12-07 21:19:43,762 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 701 transitions. Word has length 73 [2019-12-07 21:19:43,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:43,762 INFO L462 AbstractCegarLoop]: Abstraction has 468 states and 701 transitions. [2019-12-07 21:19:43,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:19:43,762 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 701 transitions. [2019-12-07 21:19:43,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-07 21:19:43,763 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:43,763 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:19:43,763 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:19:43,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:43,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1900779534, now seen corresponding path program 1 times [2019-12-07 21:19:43,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:43,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199540444] [2019-12-07 21:19:43,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:43,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:43,784 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-07 21:19:43,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199540444] [2019-12-07 21:19:43,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:43,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:19:43,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961397270] [2019-12-07 21:19:43,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:19:43,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:43,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:19:43,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:43,786 INFO L87 Difference]: Start difference. First operand 468 states and 701 transitions. Second operand 3 states. [2019-12-07 21:19:43,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:43,882 INFO L93 Difference]: Finished difference Result 934 states and 1400 transitions. [2019-12-07 21:19:43,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:19:43,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-12-07 21:19:43,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:43,885 INFO L225 Difference]: With dead ends: 934 [2019-12-07 21:19:43,885 INFO L226 Difference]: Without dead ends: 468 [2019-12-07 21:19:43,885 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-12-07 21:19:43,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2019-12-07 21:19:43,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 466. [2019-12-07 21:19:43,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-12-07 21:19:43,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 694 transitions. [2019-12-07 21:19:43,901 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 694 transitions. Word has length 78 [2019-12-07 21:19:43,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:43,901 INFO L462 AbstractCegarLoop]: Abstraction has 466 states and 694 transitions. [2019-12-07 21:19:43,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:19:43,901 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 694 transitions. [2019-12-07 21:19:43,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 21:19:43,902 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:43,903 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-12-07 21:19:43,903 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:19:43,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:43,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1755033985, now seen corresponding path program 1 times [2019-12-07 21:19:43,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:43,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530485427] [2019-12-07 21:19:43,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:43,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:43,930 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 21:19:43,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530485427] [2019-12-07 21:19:43,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:43,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:19:43,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466251765] [2019-12-07 21:19:43,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:19:43,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:43,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:19:43,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:43,931 INFO L87 Difference]: Start difference. First operand 466 states and 694 transitions. Second operand 3 states. [2019-12-07 21:19:44,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:44,039 INFO L93 Difference]: Finished difference Result 980 states and 1462 transitions. [2019-12-07 21:19:44,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:19:44,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-12-07 21:19:44,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:44,042 INFO L225 Difference]: With dead ends: 980 [2019-12-07 21:19:44,042 INFO L226 Difference]: Without dead ends: 516 [2019-12-07 21:19:44,043 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-12-07 21:19:44,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2019-12-07 21:19:44,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 496. [2019-12-07 21:19:44,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-12-07 21:19:44,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 732 transitions. [2019-12-07 21:19:44,060 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 732 transitions. Word has length 85 [2019-12-07 21:19:44,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:44,060 INFO L462 AbstractCegarLoop]: Abstraction has 496 states and 732 transitions. [2019-12-07 21:19:44,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:19:44,060 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 732 transitions. [2019-12-07 21:19:44,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 21:19:44,061 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:44,061 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-12-07 21:19:44,061 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:19:44,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:44,062 INFO L82 PathProgramCache]: Analyzing trace with hash -885196477, now seen corresponding path program 1 times [2019-12-07 21:19:44,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:44,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675279799] [2019-12-07 21:19:44,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:44,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:44,086 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 21:19:44,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675279799] [2019-12-07 21:19:44,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:44,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:19:44,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029101794] [2019-12-07 21:19:44,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:19:44,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:44,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:19:44,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:44,088 INFO L87 Difference]: Start difference. First operand 496 states and 732 transitions. Second operand 3 states. [2019-12-07 21:19:44,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:44,186 INFO L93 Difference]: Finished difference Result 1000 states and 1478 transitions. [2019-12-07 21:19:44,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:19:44,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-12-07 21:19:44,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:44,189 INFO L225 Difference]: With dead ends: 1000 [2019-12-07 21:19:44,189 INFO L226 Difference]: Without dead ends: 506 [2019-12-07 21:19:44,189 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-12-07 21:19:44,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-12-07 21:19:44,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 496. [2019-12-07 21:19:44,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-12-07 21:19:44,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 726 transitions. [2019-12-07 21:19:44,203 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 726 transitions. Word has length 86 [2019-12-07 21:19:44,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:44,204 INFO L462 AbstractCegarLoop]: Abstraction has 496 states and 726 transitions. [2019-12-07 21:19:44,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:19:44,204 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 726 transitions. [2019-12-07 21:19:44,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-07 21:19:44,204 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:44,205 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:19:44,205 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:19:44,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:44,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1731983446, now seen corresponding path program 1 times [2019-12-07 21:19:44,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:44,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071192130] [2019-12-07 21:19:44,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:44,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:44,229 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-07 21:19:44,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071192130] [2019-12-07 21:19:44,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:44,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:19:44,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023443656] [2019-12-07 21:19:44,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:19:44,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:44,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:19:44,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:44,230 INFO L87 Difference]: Start difference. First operand 496 states and 726 transitions. Second operand 3 states. [2019-12-07 21:19:44,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:44,345 INFO L93 Difference]: Finished difference Result 1044 states and 1527 transitions. [2019-12-07 21:19:44,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:19:44,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-12-07 21:19:44,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:44,348 INFO L225 Difference]: With dead ends: 1044 [2019-12-07 21:19:44,348 INFO L226 Difference]: Without dead ends: 550 [2019-12-07 21:19:44,349 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-12-07 21:19:44,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-12-07 21:19:44,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 546. [2019-12-07 21:19:44,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2019-12-07 21:19:44,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 797 transitions. [2019-12-07 21:19:44,373 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 797 transitions. Word has length 90 [2019-12-07 21:19:44,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:44,373 INFO L462 AbstractCegarLoop]: Abstraction has 546 states and 797 transitions. [2019-12-07 21:19:44,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:19:44,373 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 797 transitions. [2019-12-07 21:19:44,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-12-07 21:19:44,374 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:44,374 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:19:44,374 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:19:44,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:44,375 INFO L82 PathProgramCache]: Analyzing trace with hash 733600939, now seen corresponding path program 1 times [2019-12-07 21:19:44,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:44,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083217656] [2019-12-07 21:19:44,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:44,396 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-07 21:19:44,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083217656] [2019-12-07 21:19:44,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:44,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:19:44,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549912113] [2019-12-07 21:19:44,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:19:44,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:44,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:19:44,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:44,398 INFO L87 Difference]: Start difference. First operand 546 states and 797 transitions. Second operand 3 states. [2019-12-07 21:19:44,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:44,514 INFO L93 Difference]: Finished difference Result 1093 states and 1595 transitions. [2019-12-07 21:19:44,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:19:44,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-12-07 21:19:44,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:44,517 INFO L225 Difference]: With dead ends: 1093 [2019-12-07 21:19:44,517 INFO L226 Difference]: Without dead ends: 545 [2019-12-07 21:19:44,518 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-12-07 21:19:44,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2019-12-07 21:19:44,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 543. [2019-12-07 21:19:44,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-12-07 21:19:44,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 791 transitions. [2019-12-07 21:19:44,532 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 791 transitions. Word has length 91 [2019-12-07 21:19:44,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:44,532 INFO L462 AbstractCegarLoop]: Abstraction has 543 states and 791 transitions. [2019-12-07 21:19:44,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:19:44,533 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 791 transitions. [2019-12-07 21:19:44,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-07 21:19:44,533 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:44,534 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:19:44,534 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:19:44,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:44,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1885246774, now seen corresponding path program 1 times [2019-12-07 21:19:44,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:44,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991738022] [2019-12-07 21:19:44,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:44,553 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-12-07 21:19:44,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991738022] [2019-12-07 21:19:44,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:44,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:19:44,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598213152] [2019-12-07 21:19:44,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:19:44,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:44,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:19:44,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:44,554 INFO L87 Difference]: Start difference. First operand 543 states and 791 transitions. Second operand 3 states. [2019-12-07 21:19:44,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:44,657 INFO L93 Difference]: Finished difference Result 1127 states and 1639 transitions. [2019-12-07 21:19:44,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:19:44,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-12-07 21:19:44,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:44,661 INFO L225 Difference]: With dead ends: 1127 [2019-12-07 21:19:44,661 INFO L226 Difference]: Without dead ends: 586 [2019-12-07 21:19:44,662 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-12-07 21:19:44,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-12-07 21:19:44,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 582. [2019-12-07 21:19:44,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-12-07 21:19:44,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 841 transitions. [2019-12-07 21:19:44,685 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 841 transitions. Word has length 103 [2019-12-07 21:19:44,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:44,685 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 841 transitions. [2019-12-07 21:19:44,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:19:44,685 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 841 transitions. [2019-12-07 21:19:44,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-07 21:19:44,686 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:44,686 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:19:44,686 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:19:44,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:44,686 INFO L82 PathProgramCache]: Analyzing trace with hash 937544789, now seen corresponding path program 1 times [2019-12-07 21:19:44,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:44,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271254523] [2019-12-07 21:19:44,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:44,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:44,705 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-12-07 21:19:44,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271254523] [2019-12-07 21:19:44,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:44,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:19:44,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196051769] [2019-12-07 21:19:44,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:19:44,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:44,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:19:44,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:44,706 INFO L87 Difference]: Start difference. First operand 582 states and 841 transitions. Second operand 3 states. [2019-12-07 21:19:44,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:44,813 INFO L93 Difference]: Finished difference Result 1164 states and 1682 transitions. [2019-12-07 21:19:44,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:19:44,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-12-07 21:19:44,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:44,816 INFO L225 Difference]: With dead ends: 1164 [2019-12-07 21:19:44,816 INFO L226 Difference]: Without dead ends: 584 [2019-12-07 21:19:44,816 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-12-07 21:19:44,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-12-07 21:19:44,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 582. [2019-12-07 21:19:44,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-12-07 21:19:44,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 836 transitions. [2019-12-07 21:19:44,831 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 836 transitions. Word has length 104 [2019-12-07 21:19:44,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:44,831 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 836 transitions. [2019-12-07 21:19:44,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:19:44,831 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 836 transitions. [2019-12-07 21:19:44,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-12-07 21:19:44,832 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:44,832 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-12-07 21:19:44,833 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:19:44,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:44,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1290691939, now seen corresponding path program 1 times [2019-12-07 21:19:44,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:44,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538679842] [2019-12-07 21:19:44,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:44,852 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-12-07 21:19:44,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538679842] [2019-12-07 21:19:44,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:44,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:19:44,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768317409] [2019-12-07 21:19:44,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:19:44,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:44,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:19:44,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:44,853 INFO L87 Difference]: Start difference. First operand 582 states and 836 transitions. Second operand 3 states. [2019-12-07 21:19:44,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:44,941 INFO L93 Difference]: Finished difference Result 1198 states and 1720 transitions. [2019-12-07 21:19:44,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:19:44,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-12-07 21:19:44,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:44,945 INFO L225 Difference]: With dead ends: 1198 [2019-12-07 21:19:44,945 INFO L226 Difference]: Without dead ends: 618 [2019-12-07 21:19:44,946 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-12-07 21:19:44,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-12-07 21:19:44,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 610. [2019-12-07 21:19:44,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-12-07 21:19:44,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 867 transitions. [2019-12-07 21:19:44,971 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 867 transitions. Word has length 106 [2019-12-07 21:19:44,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:44,971 INFO L462 AbstractCegarLoop]: Abstraction has 610 states and 867 transitions. [2019-12-07 21:19:44,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:19:44,971 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 867 transitions. [2019-12-07 21:19:44,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-12-07 21:19:44,973 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:44,973 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-12-07 21:19:44,973 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:19:44,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:44,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1015508545, now seen corresponding path program 1 times [2019-12-07 21:19:44,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:44,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504020705] [2019-12-07 21:19:44,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:44,993 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-12-07 21:19:44,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504020705] [2019-12-07 21:19:44,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:44,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:19:44,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249659043] [2019-12-07 21:19:44,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:19:44,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:44,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:19:44,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:44,994 INFO L87 Difference]: Start difference. First operand 610 states and 867 transitions. Second operand 3 states. [2019-12-07 21:19:45,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:45,084 INFO L93 Difference]: Finished difference Result 1222 states and 1737 transitions. [2019-12-07 21:19:45,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:19:45,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-12-07 21:19:45,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:45,087 INFO L225 Difference]: With dead ends: 1222 [2019-12-07 21:19:45,088 INFO L226 Difference]: Without dead ends: 614 [2019-12-07 21:19:45,088 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-12-07 21:19:45,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-12-07 21:19:45,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 610. [2019-12-07 21:19:45,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-12-07 21:19:45,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 858 transitions. [2019-12-07 21:19:45,113 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 858 transitions. Word has length 107 [2019-12-07 21:19:45,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:45,114 INFO L462 AbstractCegarLoop]: Abstraction has 610 states and 858 transitions. [2019-12-07 21:19:45,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:19:45,114 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 858 transitions. [2019-12-07 21:19:45,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-12-07 21:19:45,115 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:45,115 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-12-07 21:19:45,115 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:19:45,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:45,116 INFO L82 PathProgramCache]: Analyzing trace with hash -583880554, now seen corresponding path program 1 times [2019-12-07 21:19:45,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:45,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917073886] [2019-12-07 21:19:45,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:45,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:45,136 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-12-07 21:19:45,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917073886] [2019-12-07 21:19:45,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:45,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:19:45,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555734042] [2019-12-07 21:19:45,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:19:45,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:45,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:19:45,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:45,137 INFO L87 Difference]: Start difference. First operand 610 states and 858 transitions. Second operand 3 states. [2019-12-07 21:19:45,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:45,222 INFO L93 Difference]: Finished difference Result 1248 states and 1754 transitions. [2019-12-07 21:19:45,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:19:45,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-12-07 21:19:45,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:45,225 INFO L225 Difference]: With dead ends: 1248 [2019-12-07 21:19:45,225 INFO L226 Difference]: Without dead ends: 640 [2019-12-07 21:19:45,225 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-12-07 21:19:45,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-12-07 21:19:45,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 636. [2019-12-07 21:19:45,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-12-07 21:19:45,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 884 transitions. [2019-12-07 21:19:45,242 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 884 transitions. Word has length 124 [2019-12-07 21:19:45,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:45,242 INFO L462 AbstractCegarLoop]: Abstraction has 636 states and 884 transitions. [2019-12-07 21:19:45,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:19:45,243 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 884 transitions. [2019-12-07 21:19:45,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-12-07 21:19:45,244 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:45,244 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-12-07 21:19:45,244 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:19:45,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:45,244 INFO L82 PathProgramCache]: Analyzing trace with hash 2014192274, now seen corresponding path program 1 times [2019-12-07 21:19:45,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:45,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489765858] [2019-12-07 21:19:45,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:45,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:45,265 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-12-07 21:19:45,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489765858] [2019-12-07 21:19:45,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:45,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:19:45,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245917240] [2019-12-07 21:19:45,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:19:45,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:45,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:19:45,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:45,266 INFO L87 Difference]: Start difference. First operand 636 states and 884 transitions. Second operand 3 states. [2019-12-07 21:19:45,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:45,355 INFO L93 Difference]: Finished difference Result 1272 states and 1768 transitions. [2019-12-07 21:19:45,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:19:45,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-12-07 21:19:45,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:45,357 INFO L225 Difference]: With dead ends: 1272 [2019-12-07 21:19:45,358 INFO L226 Difference]: Without dead ends: 638 [2019-12-07 21:19:45,358 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-12-07 21:19:45,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-12-07 21:19:45,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 636. [2019-12-07 21:19:45,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-12-07 21:19:45,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 874 transitions. [2019-12-07 21:19:45,375 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 874 transitions. Word has length 125 [2019-12-07 21:19:45,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:45,376 INFO L462 AbstractCegarLoop]: Abstraction has 636 states and 874 transitions. [2019-12-07 21:19:45,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:19:45,376 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 874 transitions. [2019-12-07 21:19:45,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-12-07 21:19:45,377 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:45,377 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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-12-07 21:19:45,377 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:19:45,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:45,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1234829430, now seen corresponding path program 1 times [2019-12-07 21:19:45,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:45,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431485308] [2019-12-07 21:19:45,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:45,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:45,404 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-12-07 21:19:45,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431485308] [2019-12-07 21:19:45,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:45,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:19:45,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547809530] [2019-12-07 21:19:45,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:19:45,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:45,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:19:45,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:45,405 INFO L87 Difference]: Start difference. First operand 636 states and 874 transitions. Second operand 3 states. [2019-12-07 21:19:45,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:45,541 INFO L93 Difference]: Finished difference Result 1321 states and 1809 transitions. [2019-12-07 21:19:45,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:19:45,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-12-07 21:19:45,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:45,545 INFO L225 Difference]: With dead ends: 1321 [2019-12-07 21:19:45,545 INFO L226 Difference]: Without dead ends: 687 [2019-12-07 21:19:45,546 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-12-07 21:19:45,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2019-12-07 21:19:45,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 681. [2019-12-07 21:19:45,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681 states. [2019-12-07 21:19:45,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 928 transitions. [2019-12-07 21:19:45,583 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 928 transitions. Word has length 129 [2019-12-07 21:19:45,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:45,583 INFO L462 AbstractCegarLoop]: Abstraction has 681 states and 928 transitions. [2019-12-07 21:19:45,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:19:45,583 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 928 transitions. [2019-12-07 21:19:45,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-12-07 21:19:45,585 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:45,585 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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-12-07 21:19:45,586 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:19:45,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:45,586 INFO L82 PathProgramCache]: Analyzing trace with hash -768067575, now seen corresponding path program 1 times [2019-12-07 21:19:45,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:45,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116236678] [2019-12-07 21:19:45,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:45,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:45,628 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-12-07 21:19:45,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116236678] [2019-12-07 21:19:45,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:45,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:19:45,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755430945] [2019-12-07 21:19:45,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:19:45,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:45,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:19:45,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:45,630 INFO L87 Difference]: Start difference. First operand 681 states and 928 transitions. Second operand 3 states. [2019-12-07 21:19:45,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:45,741 INFO L93 Difference]: Finished difference Result 1363 states and 1857 transitions. [2019-12-07 21:19:45,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:19:45,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-12-07 21:19:45,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:45,743 INFO L225 Difference]: With dead ends: 1363 [2019-12-07 21:19:45,744 INFO L226 Difference]: Without dead ends: 668 [2019-12-07 21:19:45,744 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-12-07 21:19:45,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2019-12-07 21:19:45,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 665. [2019-12-07 21:19:45,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2019-12-07 21:19:45,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 905 transitions. [2019-12-07 21:19:45,763 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 905 transitions. Word has length 130 [2019-12-07 21:19:45,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:45,763 INFO L462 AbstractCegarLoop]: Abstraction has 665 states and 905 transitions. [2019-12-07 21:19:45,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:19:45,763 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 905 transitions. [2019-12-07 21:19:45,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-12-07 21:19:45,764 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:45,764 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-12-07 21:19:45,764 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:19:45,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:45,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1248036782, now seen corresponding path program 1 times [2019-12-07 21:19:45,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:45,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864007704] [2019-12-07 21:19:45,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:45,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:45,787 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-12-07 21:19:45,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864007704] [2019-12-07 21:19:45,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:45,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:19:45,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146345696] [2019-12-07 21:19:45,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:19:45,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:45,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:19:45,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:45,788 INFO L87 Difference]: Start difference. First operand 665 states and 905 transitions. Second operand 3 states. [2019-12-07 21:19:45,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:45,886 INFO L93 Difference]: Finished difference Result 1332 states and 1813 transitions. [2019-12-07 21:19:45,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:19:45,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-12-07 21:19:45,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:45,889 INFO L225 Difference]: With dead ends: 1332 [2019-12-07 21:19:45,889 INFO L226 Difference]: Without dead ends: 669 [2019-12-07 21:19:45,890 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-12-07 21:19:45,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2019-12-07 21:19:45,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 665. [2019-12-07 21:19:45,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2019-12-07 21:19:45,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 898 transitions. [2019-12-07 21:19:45,909 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 898 transitions. Word has length 134 [2019-12-07 21:19:45,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:45,909 INFO L462 AbstractCegarLoop]: Abstraction has 665 states and 898 transitions. [2019-12-07 21:19:45,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:19:45,909 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 898 transitions. [2019-12-07 21:19:45,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-12-07 21:19:45,910 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:45,910 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-12-07 21:19:45,910 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:19:45,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:45,910 INFO L82 PathProgramCache]: Analyzing trace with hash 2121917619, now seen corresponding path program 1 times [2019-12-07 21:19:45,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:45,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448596583] [2019-12-07 21:19:45,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:45,933 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-12-07 21:19:45,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448596583] [2019-12-07 21:19:45,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:45,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:19:45,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703704140] [2019-12-07 21:19:45,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:19:45,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:45,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:19:45,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:45,934 INFO L87 Difference]: Start difference. First operand 665 states and 898 transitions. Second operand 3 states. [2019-12-07 21:19:46,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:46,038 INFO L93 Difference]: Finished difference Result 1320 states and 1782 transitions. [2019-12-07 21:19:46,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:19:46,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 135 [2019-12-07 21:19:46,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:46,041 INFO L225 Difference]: With dead ends: 1320 [2019-12-07 21:19:46,041 INFO L226 Difference]: Without dead ends: 640 [2019-12-07 21:19:46,042 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-12-07 21:19:46,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-12-07 21:19:46,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 636. [2019-12-07 21:19:46,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-12-07 21:19:46,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 853 transitions. [2019-12-07 21:19:46,060 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 853 transitions. Word has length 135 [2019-12-07 21:19:46,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:46,060 INFO L462 AbstractCegarLoop]: Abstraction has 636 states and 853 transitions. [2019-12-07 21:19:46,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:19:46,060 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 853 transitions. [2019-12-07 21:19:46,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-12-07 21:19:46,061 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:46,061 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2019-12-07 21:19:46,062 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:19:46,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:46,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1878713645, now seen corresponding path program 1 times [2019-12-07 21:19:46,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:46,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248530463] [2019-12-07 21:19:46,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:46,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:46,096 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-12-07 21:19:46,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248530463] [2019-12-07 21:19:46,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:46,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:19:46,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362849767] [2019-12-07 21:19:46,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:19:46,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:46,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:19:46,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:46,097 INFO L87 Difference]: Start difference. First operand 636 states and 853 transitions. Second operand 3 states. [2019-12-07 21:19:46,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:46,156 INFO L93 Difference]: Finished difference Result 1885 states and 2523 transitions. [2019-12-07 21:19:46,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:19:46,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-12-07 21:19:46,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:46,163 INFO L225 Difference]: With dead ends: 1885 [2019-12-07 21:19:46,163 INFO L226 Difference]: Without dead ends: 1251 [2019-12-07 21:19:46,164 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-12-07 21:19:46,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2019-12-07 21:19:46,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1249. [2019-12-07 21:19:46,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1249 states. [2019-12-07 21:19:46,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1668 transitions. [2019-12-07 21:19:46,221 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1668 transitions. Word has length 139 [2019-12-07 21:19:46,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:46,221 INFO L462 AbstractCegarLoop]: Abstraction has 1249 states and 1668 transitions. [2019-12-07 21:19:46,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:19:46,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1668 transitions. [2019-12-07 21:19:46,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-12-07 21:19:46,223 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:46,223 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2019-12-07 21:19:46,223 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:19:46,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:46,223 INFO L82 PathProgramCache]: Analyzing trace with hash -831110033, now seen corresponding path program 1 times [2019-12-07 21:19:46,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:46,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539871183] [2019-12-07 21:19:46,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:46,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 21:19:46,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 21:19:46,341 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 21:19:46,341 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 21:19:46,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 09:19:46 BoogieIcfgContainer [2019-12-07 21:19:46,395 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 21:19:46,395 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 21:19:46,395 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 21:19:46,396 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 21:19:46,396 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:19:41" (3/4) ... [2019-12-07 21:19:46,397 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 21:19:46,471 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_4215f0b7-5d85-4d78-85a5-d36d2dd760ee/bin/utaipan/witness.graphml [2019-12-07 21:19:46,471 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 21:19:46,473 INFO L168 Benchmark]: Toolchain (without parser) took 6087.54 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 224.9 MB). Free memory was 939.3 MB in the beginning and 817.5 MB in the end (delta: 121.8 MB). Peak memory consumption was 346.7 MB. Max. memory is 11.5 GB. [2019-12-07 21:19:46,473 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:19:46,473 INFO L168 Benchmark]: CACSL2BoogieTranslator took 279.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -156.7 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-12-07 21:19:46,473 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.59 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:19:46,474 INFO L168 Benchmark]: Boogie Preprocessor took 25.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 21:19:46,474 INFO L168 Benchmark]: RCFGBuilder took 679.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 986.1 MB in the end (delta: 104.6 MB). Peak memory consumption was 104.6 MB. Max. memory is 11.5 GB. [2019-12-07 21:19:46,475 INFO L168 Benchmark]: TraceAbstraction took 4987.78 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 116.9 MB). Free memory was 986.1 MB in the beginning and 836.2 MB in the end (delta: 149.8 MB). Peak memory consumption was 266.8 MB. Max. memory is 11.5 GB. [2019-12-07 21:19:46,475 INFO L168 Benchmark]: Witness Printer took 75.49 ms. Allocated memory is still 1.3 GB. Free memory was 836.2 MB in the beginning and 817.5 MB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-12-07 21:19:46,477 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 279.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -156.7 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.59 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 679.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 986.1 MB in the end (delta: 104.6 MB). Peak memory consumption was 104.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4987.78 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 116.9 MB). Free memory was 986.1 MB in the beginning and 836.2 MB in the end (delta: 149.8 MB). Peak memory consumption was 266.8 MB. Max. memory is 11.5 GB. * Witness Printer took 75.49 ms. Allocated memory is still 1.3 GB. Free memory was 836.2 MB in the beginning and 817.5 MB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 697]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L702] int s ; [L703] int tmp ; [L707] s = 8464 [L12] int s__info_callback = __VERIFIER_nondet_int() ; [L13] int s__in_handshake = __VERIFIER_nondet_int() ; [L14] int s__state ; [L15] int s__new_session ; [L16] int s__server ; [L17] int s__version = __VERIFIER_nondet_int() ; [L18] int s__type ; [L19] int s__init_num ; [L20] int s__hit = __VERIFIER_nondet_int() ; [L21] int s__rwstate ; [L22] int s__init_buf___0 = 1; [L23] int s__debug = __VERIFIER_nondet_int() ; [L24] int s__shutdown ; [L25] int s__cert = __VERIFIER_nondet_int() ; [L26] int s__options = __VERIFIER_nondet_int() ; [L27] int s__verify_mode = __VERIFIER_nondet_int() ; [L28] int s__session__peer = __VERIFIER_nondet_int() ; [L29] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L30] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L31] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L33] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L34] int s__s3__tmp__cert_request ; [L35] int s__s3__tmp__reuse_message ; [L36] int s__s3__tmp__use_rsa_tmp ; [L37] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L38] int s__s3__tmp__new_cipher__algorithms ; [L39] int s__s3__tmp__next_state___0 ; [L40] int s__s3__tmp__new_cipher__algo_strength ; [L41] int s__session__cipher ; [L42] int buf ; [L43] unsigned long l ; [L44] unsigned long Time ; [L45] unsigned long tmp ; [L46] int cb ; [L47] long num1 = __VERIFIER_nondet_long() ; [L48] int ret ; [L49] int new_state ; [L50] int state ; [L51] int skip ; [L52] int got_new_session ; [L53] int tmp___1 = __VERIFIER_nondet_int() ; [L54] int tmp___2 = __VERIFIER_nondet_int() ; [L55] int tmp___3 = __VERIFIER_nondet_int() ; [L56] int tmp___4 = __VERIFIER_nondet_int() ; [L57] int tmp___5 = __VERIFIER_nondet_int() ; [L58] int tmp___6 = __VERIFIER_nondet_int() ; [L59] int tmp___7 ; [L60] long tmp___8 = __VERIFIER_nondet_long() ; [L61] int tmp___9 = __VERIFIER_nondet_int() ; [L62] int tmp___10 = __VERIFIER_nondet_int() ; [L63] int blastFlag ; [L64] int __cil_tmp55 ; [L65] unsigned long __cil_tmp56 ; [L66] unsigned long __cil_tmp57 ; [L67] unsigned long __cil_tmp58 ; [L68] unsigned long __cil_tmp59 ; [L69] int __cil_tmp60 ; [L70] unsigned long __cil_tmp61 = __VERIFIER_nondet_ulong() ; [L74] s__state = initial_state [L75] blastFlag = 0 [L76] tmp = __VERIFIER_nondet_int() [L77] Time = tmp [L78] cb = 0 [L79] ret = -1 [L80] skip = 0 [L81] got_new_session = 0 [L82] COND TRUE s__info_callback != 0 [L83] cb = s__info_callback [L89] s__in_handshake ++ [L90] COND TRUE tmp___1 + 12288 [L91] COND TRUE tmp___2 + 16384 [L95] COND FALSE !(s__cert == 0) [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND TRUE s__state == 8464 [L272] s__shutdown = 0 [L273] ret = __VERIFIER_nondet_int() [L274] COND TRUE blastFlag == 0 [L275] blastFlag = 1 [L277] COND FALSE !(ret <= 0) [L280] got_new_session = 1 [L281] s__state = 8496 [L282] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND TRUE s__state == 8496 [L286] ret = __VERIFIER_nondet_int() [L287] COND TRUE blastFlag == 1 [L288] blastFlag = 2 [L290] COND FALSE !(ret <= 0) [L293] COND FALSE !(\read(s__hit)) [L296] s__state = 8512 [L298] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND TRUE s__state == 8512 [L303] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L304] __cil_tmp56 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L305] COND TRUE __cil_tmp56 + 256UL [L306] __cil_tmp56 = 256345 [L307] skip = 1 [L318] s__state = 8528 [L319] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND FALSE !(s__state == 8512) [L144] COND FALSE !(s__state == 8513) [L147] COND TRUE s__state == 8528 [L323] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L324] l = (unsigned long )s__s3__tmp__new_cipher__algorithms [L326] __cil_tmp57 = (unsigned long )s__options [L327] COND TRUE __cil_tmp57 + 2097152UL [L328] s__s3__tmp__use_rsa_tmp = 1 [L333] COND TRUE \read(s__s3__tmp__use_rsa_tmp) [L361] ret = __VERIFIER_nondet_int() [L362] COND FALSE !(blastFlag == 3) [L365] COND FALSE !(ret <= 0) [L382] s__state = 8544 [L383] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND FALSE !(s__state == 8512) [L144] COND FALSE !(s__state == 8513) [L147] COND FALSE !(s__state == 8528) [L150] COND FALSE !(s__state == 8529) [L153] COND TRUE s__state == 8544 [L387] COND TRUE s__verify_mode + 1 [L388] COND TRUE s__session__peer != 0 [L389] COND TRUE s__verify_mode + 4 [L390] s__verify_mode = 123 [L391] skip = 1 [L392] s__s3__tmp__cert_request = 0 [L393] s__state = 8560 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND FALSE !(s__state == 8512) [L144] COND FALSE !(s__state == 8513) [L147] COND FALSE !(s__state == 8528) [L150] COND FALSE !(s__state == 8529) [L153] COND FALSE !(s__state == 8544) [L156] COND FALSE !(s__state == 8545) [L159] COND TRUE s__state == 8560 [L437] ret = __VERIFIER_nondet_int() [L438] COND FALSE !(ret <= 0) [L441] s__s3__tmp__next_state___0 = 8576 [L442] s__state = 8448 [L443] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND TRUE ! s__s3__tmp__reuse_message [L653] COND TRUE ! skip [L654] COND TRUE state == 8560 [L655] COND TRUE s__state == 8448 [L656] COND TRUE s__verify_mode != -1 [L657] COND TRUE s__verify_mode != -2 [L658] COND TRUE __cil_tmp61 != 9021 [L659] COND TRUE __cil_tmp58 != 4294967294 [L660] COND TRUE blastFlag != 4 [L661] COND TRUE tmp___7 != 1024 [L697] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 119 locations, 1 error locations. Result: UNSAFE, OverallTime: 4.8s, OverallIterations: 33, TraceHistogramMax: 6, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3969 SDtfs, 4395 SDslu, 816 SDs, 0 SdLazy, 2772 SolverSat, 1263 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1249occurred in iteration=32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 32 MinimizatonAttempts, 198 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 2505 NumberOfCodeBlocks, 2505 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2332 ConstructedInterpolants, 0 QuantifiedInterpolants, 394525 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 PerfectInterpolantSequences, 1895/1895 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 incorrect! Received shutdown request...