./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_11.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_fa20475a-ceb5-476e-a3df-d46e9778d1a4/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fa20475a-ceb5-476e-a3df-d46e9778d1a4/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fa20475a-ceb5-476e-a3df-d46e9778d1a4/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fa20475a-ceb5-476e-a3df-d46e9778d1a4/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_11.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_fa20475a-ceb5-476e-a3df-d46e9778d1a4/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fa20475a-ceb5-476e-a3df-d46e9778d1a4/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 f4c57aae7ed3dd683b199a99be2cffcf6f23506e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 11:16:40,336 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:16:40,337 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:16:40,344 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:16:40,344 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:16:40,345 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:16:40,346 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:16:40,347 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:16:40,348 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:16:40,349 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:16:40,350 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:16:40,350 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:16:40,351 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:16:40,351 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:16:40,352 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:16:40,353 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:16:40,353 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:16:40,354 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:16:40,355 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:16:40,357 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:16:40,358 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:16:40,358 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:16:40,359 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:16:40,359 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:16:40,361 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:16:40,361 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:16:40,361 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:16:40,362 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:16:40,362 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:16:40,363 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:16:40,363 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:16:40,363 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:16:40,364 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:16:40,364 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:16:40,365 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:16:40,365 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:16:40,365 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:16:40,365 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:16:40,366 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:16:40,366 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:16:40,367 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:16:40,367 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fa20475a-ceb5-476e-a3df-d46e9778d1a4/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 11:16:40,377 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:16:40,377 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:16:40,378 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 11:16:40,378 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 11:16:40,378 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 11:16:40,378 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 11:16:40,378 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 11:16:40,379 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 11:16:40,379 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 11:16:40,379 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 11:16:40,379 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 11:16:40,379 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 11:16:40,379 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 11:16:40,379 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 11:16:40,380 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 11:16:40,380 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:16:40,380 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:16:40,380 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:16:40,380 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:16:40,381 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:16:40,381 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:16:40,381 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:16:40,381 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:16:40,381 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 11:16:40,381 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:16:40,381 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:16:40,381 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:16:40,381 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:16:40,382 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:16:40,382 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:16:40,382 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:16:40,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:16:40,382 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:16:40,382 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:16:40,382 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:16:40,382 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 11:16:40,383 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:16:40,383 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:16:40,383 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:16:40,383 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 11:16:40,383 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_fa20475a-ceb5-476e-a3df-d46e9778d1a4/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 -> f4c57aae7ed3dd683b199a99be2cffcf6f23506e [2019-12-07 11:16:40,480 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:16:40,490 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:16:40,492 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:16:40,494 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:16:40,494 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:16:40,495 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fa20475a-ceb5-476e-a3df-d46e9778d1a4/bin/utaipan/../../sv-benchmarks/c/ssh-simplified/s3_srvr_11.cil.c [2019-12-07 11:16:40,542 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fa20475a-ceb5-476e-a3df-d46e9778d1a4/bin/utaipan/data/b0fed3144/367847fe6a13448ba76ccdaee62f356c/FLAG4fdb71470 [2019-12-07 11:16:40,872 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:16:40,873 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fa20475a-ceb5-476e-a3df-d46e9778d1a4/sv-benchmarks/c/ssh-simplified/s3_srvr_11.cil.c [2019-12-07 11:16:40,881 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fa20475a-ceb5-476e-a3df-d46e9778d1a4/bin/utaipan/data/b0fed3144/367847fe6a13448ba76ccdaee62f356c/FLAG4fdb71470 [2019-12-07 11:16:40,890 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fa20475a-ceb5-476e-a3df-d46e9778d1a4/bin/utaipan/data/b0fed3144/367847fe6a13448ba76ccdaee62f356c [2019-12-07 11:16:40,892 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:16:40,893 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:16:40,894 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:16:40,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:16:40,896 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:16:40,897 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:16:40" (1/1) ... [2019-12-07 11:16:40,899 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17df66d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:16:40, skipping insertion in model container [2019-12-07 11:16:40,899 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:16:40" (1/1) ... [2019-12-07 11:16:40,904 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:16:40,929 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:16:41,106 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:16:41,109 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:16:41,146 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:16:41,155 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:16:41,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:16:41 WrapperNode [2019-12-07 11:16:41,155 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:16:41,156 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:16:41,156 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:16:41,156 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:16:41,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:16:41" (1/1) ... [2019-12-07 11:16:41,168 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:16:41" (1/1) ... [2019-12-07 11:16:41,193 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:16:41,193 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:16:41,193 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:16:41,193 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:16:41,199 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:16:41" (1/1) ... [2019-12-07 11:16:41,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:16:41" (1/1) ... [2019-12-07 11:16:41,202 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:16:41" (1/1) ... [2019-12-07 11:16:41,202 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:16:41" (1/1) ... [2019-12-07 11:16:41,207 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:16:41" (1/1) ... [2019-12-07 11:16:41,213 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:16:41" (1/1) ... [2019-12-07 11:16:41,215 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:16:41" (1/1) ... [2019-12-07 11:16:41,218 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:16:41,218 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:16:41,218 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:16:41,218 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:16:41,219 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:16:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa20475a-ceb5-476e-a3df-d46e9778d1a4/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 11:16:41,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:16:41,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:16:41,334 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 11:16:41,650 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-12-07 11:16:41,650 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-12-07 11:16:41,814 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:16:41,815 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 11:16:41,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:16:41 BoogieIcfgContainer [2019-12-07 11:16:41,816 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:16:41,816 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:16:41,816 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:16:41,818 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:16:41,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:16:40" (1/3) ... [2019-12-07 11:16:41,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e5e0fc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:16:41, skipping insertion in model container [2019-12-07 11:16:41,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:16:41" (2/3) ... [2019-12-07 11:16:41,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e5e0fc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:16:41, skipping insertion in model container [2019-12-07 11:16:41,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:16:41" (3/3) ... [2019-12-07 11:16:41,820 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_11.cil.c [2019-12-07 11:16:41,827 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:16:41,832 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 11:16:41,840 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 11:16:41,856 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:16:41,856 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:16:41,856 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:16:41,856 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:16:41,856 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:16:41,856 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:16:41,856 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:16:41,856 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:16:41,868 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states. [2019-12-07 11:16:41,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 11:16:41,872 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:16:41,873 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:16:41,873 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:16:41,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:16:41,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1776652682, now seen corresponding path program 1 times [2019-12-07 11:16:41,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:16:41,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135525983] [2019-12-07 11:16:41,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:16:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:16:42,001 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 11:16:42,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135525983] [2019-12-07 11:16:42,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:16:42,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:16:42,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945708445] [2019-12-07 11:16:42,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:16:42,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:16:42,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:16:42,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:16:42,017 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 3 states. [2019-12-07 11:16:42,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:16:42,165 INFO L93 Difference]: Finished difference Result 249 states and 436 transitions. [2019-12-07 11:16:42,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:16:42,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 11:16:42,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:16:42,178 INFO L225 Difference]: With dead ends: 249 [2019-12-07 11:16:42,179 INFO L226 Difference]: Without dead ends: 131 [2019-12-07 11:16:42,182 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 11:16:42,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-12-07 11:16:42,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2019-12-07 11:16:42,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-12-07 11:16:42,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 193 transitions. [2019-12-07 11:16:42,217 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 193 transitions. Word has length 19 [2019-12-07 11:16:42,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:16:42,217 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 193 transitions. [2019-12-07 11:16:42,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:16:42,218 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 193 transitions. [2019-12-07 11:16:42,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 11:16:42,219 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:16:42,219 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 11:16:42,219 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:16:42,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:16:42,220 INFO L82 PathProgramCache]: Analyzing trace with hash -130796344, now seen corresponding path program 1 times [2019-12-07 11:16:42,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:16:42,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279400716] [2019-12-07 11:16:42,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:16:42,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:16:42,274 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 11:16:42,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279400716] [2019-12-07 11:16:42,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:16:42,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:16:42,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129529559] [2019-12-07 11:16:42,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:16:42,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:16:42,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:16:42,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:16:42,277 INFO L87 Difference]: Start difference. First operand 129 states and 193 transitions. Second operand 4 states. [2019-12-07 11:16:42,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:16:42,381 INFO L93 Difference]: Finished difference Result 268 states and 400 transitions. [2019-12-07 11:16:42,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:16:42,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-12-07 11:16:42,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:16:42,384 INFO L225 Difference]: With dead ends: 268 [2019-12-07 11:16:42,384 INFO L226 Difference]: Without dead ends: 141 [2019-12-07 11:16:42,385 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 11:16:42,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-12-07 11:16:42,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2019-12-07 11:16:42,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-12-07 11:16:42,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 204 transitions. [2019-12-07 11:16:42,397 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 204 transitions. Word has length 24 [2019-12-07 11:16:42,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:16:42,397 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 204 transitions. [2019-12-07 11:16:42,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:16:42,398 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 204 transitions. [2019-12-07 11:16:42,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 11:16:42,399 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:16:42,399 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] [2019-12-07 11:16:42,399 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:16:42,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:16:42,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1861462646, now seen corresponding path program 1 times [2019-12-07 11:16:42,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:16:42,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859480698] [2019-12-07 11:16:42,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:16:42,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:16:42,439 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:16:42,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859480698] [2019-12-07 11:16:42,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:16:42,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:16:42,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966683928] [2019-12-07 11:16:42,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:16:42,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:16:42,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:16:42,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:16:42,441 INFO L87 Difference]: Start difference. First operand 137 states and 204 transitions. Second operand 3 states. [2019-12-07 11:16:42,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:16:42,564 INFO L93 Difference]: Finished difference Result 325 states and 499 transitions. [2019-12-07 11:16:42,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:16:42,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-07 11:16:42,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:16:42,566 INFO L225 Difference]: With dead ends: 325 [2019-12-07 11:16:42,566 INFO L226 Difference]: Without dead ends: 178 [2019-12-07 11:16:42,568 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 11:16:42,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-12-07 11:16:42,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 175. [2019-12-07 11:16:42,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-12-07 11:16:42,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 256 transitions. [2019-12-07 11:16:42,580 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 256 transitions. Word has length 34 [2019-12-07 11:16:42,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:16:42,580 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 256 transitions. [2019-12-07 11:16:42,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:16:42,580 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 256 transitions. [2019-12-07 11:16:42,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 11:16:42,582 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:16:42,582 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] [2019-12-07 11:16:42,582 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:16:42,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:16:42,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1971056475, now seen corresponding path program 1 times [2019-12-07 11:16:42,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:16:42,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743318255] [2019-12-07 11:16:42,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:16:42,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:16:42,620 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:16:42,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743318255] [2019-12-07 11:16:42,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57525159] [2019-12-07 11:16:42,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa20475a-ceb5-476e-a3df-d46e9778d1a4/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:16:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:16:42,667 INFO L264 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:16:42,671 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:16:42,686 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:16:42,686 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:16:42,700 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:16:42,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1254906194] [2019-12-07 11:16:42,717 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2019-12-07 11:16:42,717 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 11:16:42,721 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 11:16:42,726 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 11:16:42,726 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 11:16:43,776 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 11:16:44,374 WARN L192 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 179 [2019-12-07 11:16:44,756 WARN L192 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 147 [2019-12-07 11:16:45,201 WARN L192 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 150 [2019-12-07 11:16:45,613 WARN L192 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 152 [2019-12-07 11:16:46,070 WARN L192 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 155 [2019-12-07 11:16:46,538 WARN L192 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 158 [2019-12-07 11:16:46,974 WARN L192 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 155 [2019-12-07 11:16:47,531 WARN L192 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 158 [2019-12-07 11:16:48,007 WARN L192 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 161 [2019-12-07 11:16:48,519 WARN L192 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 164 [2019-12-07 11:16:48,948 WARN L192 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 151 [2019-12-07 11:16:49,433 WARN L192 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 154 [2019-12-07 11:16:50,024 WARN L192 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 155 [2019-12-07 11:16:50,503 WARN L192 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 155 [2019-12-07 11:16:51,085 WARN L192 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 166 [2019-12-07 11:16:51,625 WARN L192 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 169 [2019-12-07 11:16:52,166 WARN L192 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 172 [2019-12-07 11:16:52,645 WARN L192 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 153 [2019-12-07 11:16:53,110 WARN L192 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 159 [2019-12-07 11:16:53,612 WARN L192 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 156 [2019-12-07 11:16:54,115 WARN L192 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 154 [2019-12-07 11:16:54,635 WARN L192 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 158 [2019-12-07 11:16:55,180 WARN L192 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 162 [2019-12-07 11:16:55,747 WARN L192 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 168 [2019-12-07 11:16:56,345 WARN L192 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 173 [2019-12-07 11:16:56,979 WARN L192 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 176 [2019-12-07 11:16:56,981 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 11:16:56,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:16:56,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-12-07 11:16:56,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433032012] [2019-12-07 11:16:56,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:16:56,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:16:56,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:16:56,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=716, Unknown=0, NotChecked=0, Total=992 [2019-12-07 11:16:56,983 INFO L87 Difference]: Start difference. First operand 175 states and 256 transitions. Second operand 6 states. [2019-12-07 11:16:57,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:16:57,220 INFO L93 Difference]: Finished difference Result 510 states and 754 transitions. [2019-12-07 11:16:57,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:16:57,220 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-07 11:16:57,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:16:57,222 INFO L225 Difference]: With dead ends: 510 [2019-12-07 11:16:57,223 INFO L226 Difference]: Without dead ends: 325 [2019-12-07 11:16:57,224 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=300, Invalid=890, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 11:16:57,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-12-07 11:16:57,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 262. [2019-12-07 11:16:57,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-12-07 11:16:57,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 388 transitions. [2019-12-07 11:16:57,238 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 388 transitions. Word has length 42 [2019-12-07 11:16:57,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:16:57,238 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 388 transitions. [2019-12-07 11:16:57,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:16:57,239 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 388 transitions. [2019-12-07 11:16:57,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 11:16:57,241 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:16:57,241 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:16:57,441 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:16:57,442 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:16:57,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:16:57,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1293989074, now seen corresponding path program 2 times [2019-12-07 11:16:57,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:16:57,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109584227] [2019-12-07 11:16:57,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:16:57,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:16:57,562 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 11:16:57,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109584227] [2019-12-07 11:16:57,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:16:57,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:16:57,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874972654] [2019-12-07 11:16:57,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:16:57,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:16:57,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:16:57,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:16:57,566 INFO L87 Difference]: Start difference. First operand 262 states and 388 transitions. Second operand 4 states. [2019-12-07 11:16:57,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:16:57,723 INFO L93 Difference]: Finished difference Result 593 states and 876 transitions. [2019-12-07 11:16:57,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:16:57,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-12-07 11:16:57,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:16:57,726 INFO L225 Difference]: With dead ends: 593 [2019-12-07 11:16:57,726 INFO L226 Difference]: Without dead ends: 333 [2019-12-07 11:16:57,727 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 11:16:57,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-12-07 11:16:57,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 248. [2019-12-07 11:16:57,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-12-07 11:16:57,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 372 transitions. [2019-12-07 11:16:57,736 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 372 transitions. Word has length 60 [2019-12-07 11:16:57,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:16:57,736 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 372 transitions. [2019-12-07 11:16:57,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:16:57,736 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 372 transitions. [2019-12-07 11:16:57,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 11:16:57,738 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:16:57,738 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:16:57,738 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:16:57,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:16:57,739 INFO L82 PathProgramCache]: Analyzing trace with hash -721739878, now seen corresponding path program 1 times [2019-12-07 11:16:57,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:16:57,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139419450] [2019-12-07 11:16:57,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:16:57,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:16:57,765 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 11:16:57,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139419450] [2019-12-07 11:16:57,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:16:57,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:16:57,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151662609] [2019-12-07 11:16:57,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:16:57,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:16:57,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:16:57,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:16:57,766 INFO L87 Difference]: Start difference. First operand 248 states and 372 transitions. Second operand 4 states. [2019-12-07 11:16:57,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:16:57,867 INFO L93 Difference]: Finished difference Result 522 states and 779 transitions. [2019-12-07 11:16:57,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:16:57,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-12-07 11:16:57,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:16:57,869 INFO L225 Difference]: With dead ends: 522 [2019-12-07 11:16:57,869 INFO L226 Difference]: Without dead ends: 276 [2019-12-07 11:16:57,870 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 11:16:57,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-12-07 11:16:57,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 246. [2019-12-07 11:16:57,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-12-07 11:16:57,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 370 transitions. [2019-12-07 11:16:57,876 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 370 transitions. Word has length 61 [2019-12-07 11:16:57,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:16:57,877 INFO L462 AbstractCegarLoop]: Abstraction has 246 states and 370 transitions. [2019-12-07 11:16:57,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:16:57,877 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 370 transitions. [2019-12-07 11:16:57,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:16:57,879 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:16:57,879 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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 11:16:57,879 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:16:57,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:16:57,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1460396374, now seen corresponding path program 1 times [2019-12-07 11:16:57,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:16:57,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955563137] [2019-12-07 11:16:57,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:16:57,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:16:57,917 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 11:16:57,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955563137] [2019-12-07 11:16:57,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:16:57,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:16:57,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395909702] [2019-12-07 11:16:57,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:16:57,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:16:57,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:16:57,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:16:57,919 INFO L87 Difference]: Start difference. First operand 246 states and 370 transitions. Second operand 4 states. [2019-12-07 11:16:58,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:16:58,021 INFO L93 Difference]: Finished difference Result 540 states and 824 transitions. [2019-12-07 11:16:58,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:16:58,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-12-07 11:16:58,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:16:58,024 INFO L225 Difference]: With dead ends: 540 [2019-12-07 11:16:58,024 INFO L226 Difference]: Without dead ends: 296 [2019-12-07 11:16:58,025 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:16:58,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-12-07 11:16:58,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 285. [2019-12-07 11:16:58,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-12-07 11:16:58,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 413 transitions. [2019-12-07 11:16:58,034 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 413 transitions. Word has length 72 [2019-12-07 11:16:58,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:16:58,034 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 413 transitions. [2019-12-07 11:16:58,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:16:58,034 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 413 transitions. [2019-12-07 11:16:58,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-07 11:16:58,035 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:16:58,035 INFO L410 BasicCegarLoop]: trace histogram [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, 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 11:16:58,036 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:16:58,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:16:58,036 INFO L82 PathProgramCache]: Analyzing trace with hash -162983145, now seen corresponding path program 1 times [2019-12-07 11:16:58,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:16:58,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917791075] [2019-12-07 11:16:58,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:16:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:16:58,065 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-12-07 11:16:58,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917791075] [2019-12-07 11:16:58,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:16:58,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:16:58,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160989489] [2019-12-07 11:16:58,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:16:58,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:16:58,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:16:58,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:16:58,066 INFO L87 Difference]: Start difference. First operand 285 states and 413 transitions. Second operand 3 states. [2019-12-07 11:16:58,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:16:58,183 INFO L93 Difference]: Finished difference Result 613 states and 906 transitions. [2019-12-07 11:16:58,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:16:58,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-12-07 11:16:58,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:16:58,185 INFO L225 Difference]: With dead ends: 613 [2019-12-07 11:16:58,185 INFO L226 Difference]: Without dead ends: 330 [2019-12-07 11:16:58,186 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 11:16:58,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-12-07 11:16:58,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 326. [2019-12-07 11:16:58,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-12-07 11:16:58,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 461 transitions. [2019-12-07 11:16:58,193 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 461 transitions. Word has length 81 [2019-12-07 11:16:58,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:16:58,193 INFO L462 AbstractCegarLoop]: Abstraction has 326 states and 461 transitions. [2019-12-07 11:16:58,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:16:58,193 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 461 transitions. [2019-12-07 11:16:58,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-07 11:16:58,194 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:16:58,194 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:16:58,194 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:16:58,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:16:58,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1322101538, now seen corresponding path program 1 times [2019-12-07 11:16:58,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:16:58,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310923577] [2019-12-07 11:16:58,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:16:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:16:58,215 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 11:16:58,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310923577] [2019-12-07 11:16:58,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:16:58,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:16:58,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616031642] [2019-12-07 11:16:58,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:16:58,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:16:58,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:16:58,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:16:58,217 INFO L87 Difference]: Start difference. First operand 326 states and 461 transitions. Second operand 3 states. [2019-12-07 11:16:58,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:16:58,301 INFO L93 Difference]: Finished difference Result 672 states and 954 transitions. [2019-12-07 11:16:58,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:16:58,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-12-07 11:16:58,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:16:58,303 INFO L225 Difference]: With dead ends: 672 [2019-12-07 11:16:58,303 INFO L226 Difference]: Without dead ends: 348 [2019-12-07 11:16:58,303 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 11:16:58,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-12-07 11:16:58,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 346. [2019-12-07 11:16:58,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-12-07 11:16:58,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 484 transitions. [2019-12-07 11:16:58,310 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 484 transitions. Word has length 82 [2019-12-07 11:16:58,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:16:58,310 INFO L462 AbstractCegarLoop]: Abstraction has 346 states and 484 transitions. [2019-12-07 11:16:58,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:16:58,310 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 484 transitions. [2019-12-07 11:16:58,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-12-07 11:16:58,311 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:16:58,311 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:16:58,311 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:16:58,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:16:58,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1634522130, now seen corresponding path program 1 times [2019-12-07 11:16:58,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:16:58,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955673664] [2019-12-07 11:16:58,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:16:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:16:58,360 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:16:58,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955673664] [2019-12-07 11:16:58,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043023319] [2019-12-07 11:16:58,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa20475a-ceb5-476e-a3df-d46e9778d1a4/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:16:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:16:58,404 INFO L264 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 11:16:58,408 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:16:58,434 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:16:58,434 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:16:58,487 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 11:16:58,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1723567410] [2019-12-07 11:16:58,489 INFO L159 IcfgInterpreter]: Started Sifa with 51 locations of interest [2019-12-07 11:16:58,489 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 11:16:58,489 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 11:16:58,489 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 11:16:58,490 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 11:16:59,551 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 11:17:00,073 WARN L192 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 154 [2019-12-07 11:17:00,441 WARN L192 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 147 [2019-12-07 11:17:00,848 WARN L192 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 150 [2019-12-07 11:17:01,256 WARN L192 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 152 [2019-12-07 11:17:01,732 WARN L192 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 155 [2019-12-07 11:17:02,169 WARN L192 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 158 [2019-12-07 11:17:02,705 WARN L192 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 161 [2019-12-07 11:17:03,197 WARN L192 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 155 [2019-12-07 11:17:03,650 WARN L192 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 158 [2019-12-07 11:17:04,104 WARN L192 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 152 [2019-12-07 11:17:04,569 WARN L192 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 157 [2019-12-07 11:17:05,060 WARN L192 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 157 [2019-12-07 11:17:05,554 WARN L192 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 159 [2019-12-07 11:17:06,043 WARN L192 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 155 [2019-12-07 11:17:06,613 WARN L192 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 160 [2019-12-07 11:17:07,122 WARN L192 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 163 [2019-12-07 11:17:07,642 WARN L192 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 166 [2019-12-07 11:17:08,158 WARN L192 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 153 [2019-12-07 11:17:08,648 WARN L192 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 159 [2019-12-07 11:17:09,266 WARN L192 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 169 [2019-12-07 11:17:09,831 WARN L192 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 172 [2019-12-07 11:17:10,444 WARN L192 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 175 [2019-12-07 11:17:11,048 WARN L192 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 178 [2019-12-07 11:17:11,684 WARN L192 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 181 [2019-12-07 11:17:12,333 WARN L192 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 184 [2019-12-07 11:17:12,986 WARN L192 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 187 [2019-12-07 11:17:13,708 WARN L192 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 190 [2019-12-07 11:17:14,420 WARN L192 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 193 [2019-12-07 11:17:15,116 WARN L192 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 196 [2019-12-07 11:17:16,059 WARN L192 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 199 [2019-12-07 11:17:16,834 WARN L192 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 202 [2019-12-07 11:17:17,621 WARN L192 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 205 [2019-12-07 11:17:18,423 WARN L192 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 208 [2019-12-07 11:17:19,246 WARN L192 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 219 DAG size of output: 211 [2019-12-07 11:17:20,087 WARN L192 SmtUtils]: Spent 631.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 214 [2019-12-07 11:17:20,966 WARN L192 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 217 [2019-12-07 11:17:21,844 WARN L192 SmtUtils]: Spent 634.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 220 [2019-12-07 11:17:22,577 WARN L192 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 153 [2019-12-07 11:17:23,327 WARN L192 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 155 [2019-12-07 11:17:24,005 WARN L192 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 241 DAG size of output: 161 [2019-12-07 11:17:24,680 WARN L192 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 162 [2019-12-07 11:17:25,861 WARN L192 SmtUtils]: Spent 657.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 223 [2019-12-07 11:17:26,795 WARN L192 SmtUtils]: Spent 654.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 226 [2019-12-07 11:17:27,576 WARN L192 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 153 [2019-12-07 11:17:28,234 WARN L192 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 153 [2019-12-07 11:17:28,235 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 11:17:28,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:17:28,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 3] total 7 [2019-12-07 11:17:28,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562382914] [2019-12-07 11:17:28,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:17:28,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:17:28,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:17:28,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=642, Invalid=2114, Unknown=0, NotChecked=0, Total=2756 [2019-12-07 11:17:28,237 INFO L87 Difference]: Start difference. First operand 346 states and 484 transitions. Second operand 8 states. [2019-12-07 11:17:28,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:17:28,290 INFO L93 Difference]: Finished difference Result 986 states and 1391 transitions. [2019-12-07 11:17:28,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:17:28,290 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 111 [2019-12-07 11:17:28,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:17:28,294 INFO L225 Difference]: With dead ends: 986 [2019-12-07 11:17:28,294 INFO L226 Difference]: Without dead ends: 984 [2019-12-07 11:17:28,295 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 275 SyntacticMatches, 10 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 28.7s TimeCoverageRelationStatistics Valid=642, Invalid=2114, Unknown=0, NotChecked=0, Total=2756 [2019-12-07 11:17:28,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2019-12-07 11:17:28,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 889. [2019-12-07 11:17:28,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2019-12-07 11:17:28,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1281 transitions. [2019-12-07 11:17:28,313 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1281 transitions. Word has length 111 [2019-12-07 11:17:28,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:17:28,313 INFO L462 AbstractCegarLoop]: Abstraction has 889 states and 1281 transitions. [2019-12-07 11:17:28,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:17:28,313 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1281 transitions. [2019-12-07 11:17:28,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-07 11:17:28,314 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:17:28,314 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:17:28,515 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:17:28,516 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:17:28,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:17:28,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1515133497, now seen corresponding path program 1 times [2019-12-07 11:17:28,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:17:28,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022972605] [2019-12-07 11:17:28,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:17:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:17:28,628 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-12-07 11:17:28,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022972605] [2019-12-07 11:17:28,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:17:28,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:17:28,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826745637] [2019-12-07 11:17:28,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:17:28,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:17:28,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:17:28,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:17:28,630 INFO L87 Difference]: Start difference. First operand 889 states and 1281 transitions. Second operand 3 states. [2019-12-07 11:17:28,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:17:28,726 INFO L93 Difference]: Finished difference Result 1929 states and 2809 transitions. [2019-12-07 11:17:28,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:17:28,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-12-07 11:17:28,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:17:28,730 INFO L225 Difference]: With dead ends: 1929 [2019-12-07 11:17:28,730 INFO L226 Difference]: Without dead ends: 1042 [2019-12-07 11:17:28,731 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 11:17:28,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2019-12-07 11:17:28,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 982. [2019-12-07 11:17:28,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2019-12-07 11:17:28,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1395 transitions. [2019-12-07 11:17:28,748 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1395 transitions. Word has length 122 [2019-12-07 11:17:28,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:17:28,749 INFO L462 AbstractCegarLoop]: Abstraction has 982 states and 1395 transitions. [2019-12-07 11:17:28,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:17:28,749 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1395 transitions. [2019-12-07 11:17:28,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-12-07 11:17:28,750 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:17:28,750 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:17:28,750 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:17:28,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:17:28,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1148641136, now seen corresponding path program 1 times [2019-12-07 11:17:28,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:17:28,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742351538] [2019-12-07 11:17:28,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:17:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:17:28,783 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 11:17:28,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742351538] [2019-12-07 11:17:28,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:17:28,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:17:28,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128365188] [2019-12-07 11:17:28,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:17:28,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:17:28,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:17:28,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:17:28,785 INFO L87 Difference]: Start difference. First operand 982 states and 1395 transitions. Second operand 3 states. [2019-12-07 11:17:28,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:17:28,887 INFO L93 Difference]: Finished difference Result 2109 states and 3031 transitions. [2019-12-07 11:17:28,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:17:28,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-12-07 11:17:28,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:17:28,893 INFO L225 Difference]: With dead ends: 2109 [2019-12-07 11:17:28,893 INFO L226 Difference]: Without dead ends: 1129 [2019-12-07 11:17:28,894 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 11:17:28,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2019-12-07 11:17:28,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1081. [2019-12-07 11:17:28,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1081 states. [2019-12-07 11:17:28,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1515 transitions. [2019-12-07 11:17:28,919 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1515 transitions. Word has length 147 [2019-12-07 11:17:28,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:17:28,919 INFO L462 AbstractCegarLoop]: Abstraction has 1081 states and 1515 transitions. [2019-12-07 11:17:28,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:17:28,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1515 transitions. [2019-12-07 11:17:28,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-12-07 11:17:28,921 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:17:28,921 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:17:28,921 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:17:28,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:17:28,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1766439835, now seen corresponding path program 1 times [2019-12-07 11:17:28,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:17:28,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244157168] [2019-12-07 11:17:28,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:17:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:17:28,950 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-12-07 11:17:28,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244157168] [2019-12-07 11:17:28,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:17:28,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:17:28,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808579723] [2019-12-07 11:17:28,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:17:28,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:17:28,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:17:28,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:17:28,951 INFO L87 Difference]: Start difference. First operand 1081 states and 1515 transitions. Second operand 3 states. [2019-12-07 11:17:29,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:17:29,062 INFO L93 Difference]: Finished difference Result 2279 states and 3246 transitions. [2019-12-07 11:17:29,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:17:29,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-12-07 11:17:29,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:17:29,067 INFO L225 Difference]: With dead ends: 2279 [2019-12-07 11:17:29,067 INFO L226 Difference]: Without dead ends: 1197 [2019-12-07 11:17:29,068 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 11:17:29,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2019-12-07 11:17:29,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1186. [2019-12-07 11:17:29,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2019-12-07 11:17:29,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1701 transitions. [2019-12-07 11:17:29,088 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1701 transitions. Word has length 150 [2019-12-07 11:17:29,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:17:29,088 INFO L462 AbstractCegarLoop]: Abstraction has 1186 states and 1701 transitions. [2019-12-07 11:17:29,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:17:29,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1701 transitions. [2019-12-07 11:17:29,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-12-07 11:17:29,090 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:17:29,090 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:17:29,090 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:17:29,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:17:29,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1862885200, now seen corresponding path program 1 times [2019-12-07 11:17:29,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:17:29,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234608352] [2019-12-07 11:17:29,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:17:29,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:17:29,127 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-12-07 11:17:29,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234608352] [2019-12-07 11:17:29,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:17:29,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:17:29,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24103269] [2019-12-07 11:17:29,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:17:29,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:17:29,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:17:29,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:17:29,129 INFO L87 Difference]: Start difference. First operand 1186 states and 1701 transitions. Second operand 3 states. [2019-12-07 11:17:29,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:17:29,233 INFO L93 Difference]: Finished difference Result 2343 states and 3358 transitions. [2019-12-07 11:17:29,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:17:29,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-12-07 11:17:29,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:17:29,239 INFO L225 Difference]: With dead ends: 2343 [2019-12-07 11:17:29,240 INFO L226 Difference]: Without dead ends: 1159 [2019-12-07 11:17:29,241 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 11:17:29,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2019-12-07 11:17:29,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1153. [2019-12-07 11:17:29,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2019-12-07 11:17:29,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1602 transitions. [2019-12-07 11:17:29,268 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1602 transitions. Word has length 170 [2019-12-07 11:17:29,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:17:29,268 INFO L462 AbstractCegarLoop]: Abstraction has 1153 states and 1602 transitions. [2019-12-07 11:17:29,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:17:29,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1602 transitions. [2019-12-07 11:17:29,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-12-07 11:17:29,271 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:17:29,271 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:17:29,271 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:17:29,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:17:29,272 INFO L82 PathProgramCache]: Analyzing trace with hash 361341475, now seen corresponding path program 1 times [2019-12-07 11:17:29,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:17:29,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799047475] [2019-12-07 11:17:29,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:17:29,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:17:29,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:17:29,404 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 11:17:29,404 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:17:29,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:17:29 BoogieIcfgContainer [2019-12-07 11:17:29,463 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:17:29,463 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:17:29,463 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:17:29,463 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:17:29,464 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:16:41" (3/4) ... [2019-12-07 11:17:29,465 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 11:17:29,536 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_fa20475a-ceb5-476e-a3df-d46e9778d1a4/bin/utaipan/witness.graphml [2019-12-07 11:17:29,536 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:17:29,537 INFO L168 Benchmark]: Toolchain (without parser) took 48644.45 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 448.8 MB). Free memory was 938.8 MB in the beginning and 838.8 MB in the end (delta: 100.0 MB). Peak memory consumption was 548.8 MB. Max. memory is 11.5 GB. [2019-12-07 11:17:29,537 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:17:29,538 INFO L168 Benchmark]: CACSL2BoogieTranslator took 261.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 938.8 MB in the beginning and 1.1 GB in the end (delta: -157.5 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-12-07 11:17:29,538 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.89 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 11:17:29,538 INFO L168 Benchmark]: Boogie Preprocessor took 24.97 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 11:17:29,538 INFO L168 Benchmark]: RCFGBuilder took 597.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 997.4 MB in the end (delta: 93.6 MB). Peak memory consumption was 93.6 MB. Max. memory is 11.5 GB. [2019-12-07 11:17:29,539 INFO L168 Benchmark]: TraceAbstraction took 47646.63 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 340.8 MB). Free memory was 997.4 MB in the beginning and 856.0 MB in the end (delta: 141.5 MB). Peak memory consumption was 482.3 MB. Max. memory is 11.5 GB. [2019-12-07 11:17:29,539 INFO L168 Benchmark]: Witness Printer took 73.26 ms. Allocated memory is still 1.5 GB. Free memory was 856.0 MB in the beginning and 838.8 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. [2019-12-07 11:17:29,540 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 955.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 261.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 938.8 MB in the beginning and 1.1 GB in the end (delta: -157.5 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.89 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 24.97 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 597.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 997.4 MB in the end (delta: 93.6 MB). Peak memory consumption was 93.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 47646.63 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 340.8 MB). Free memory was 997.4 MB in the beginning and 856.0 MB in the end (delta: 141.5 MB). Peak memory consumption was 482.3 MB. Max. memory is 11.5 GB. * Witness Printer took 73.26 ms. Allocated memory is still 1.5 GB. Free memory was 856.0 MB in the beginning and 838.8 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 630]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L635] int s ; [L636] int tmp ; [L640] 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 = __VERIFIER_nondet_int() ; [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 = __VERIFIER_nondet_int() ; [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 = __VERIFIER_nondet_ulong() ; [L68] unsigned long __cil_tmp59 ; [L69] int __cil_tmp60 ; [L70] unsigned long __cil_tmp61 ; [L73] s__state = initial_state [L74] blastFlag = 0 [L75] tmp = __VERIFIER_nondet_int() [L76] Time = tmp [L77] cb = 0 [L78] ret = -1 [L79] skip = 0 [L80] got_new_session = 0 [L81] COND TRUE s__info_callback != 0 [L82] cb = s__info_callback [L88] s__in_handshake ++ [L89] COND TRUE tmp___1 + 12288 [L90] COND TRUE tmp___2 + 16384 [L94] COND FALSE !(s__cert == 0) [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND TRUE s__state == 8464 [L271] s__shutdown = 0 [L272] ret = __VERIFIER_nondet_int() [L273] COND TRUE blastFlag == 0 [L274] blastFlag = 1 [L276] COND FALSE !(ret <= 0) [L279] got_new_session = 1 [L280] s__state = 8496 [L281] s__init_num = 0 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L602] COND FALSE !(state == 8576) [L619] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND TRUE s__state == 8496 [L285] ret = __VERIFIER_nondet_int() [L286] COND TRUE blastFlag == 1 [L287] blastFlag = 2 [L293] COND FALSE !(ret <= 0) [L296] COND FALSE !(\read(s__hit)) [L299] s__state = 8512 [L301] s__init_num = 0 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L602] COND FALSE !(state == 8576) [L619] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND FALSE !(s__state == 8496) [L137] COND FALSE !(s__state == 8497) [L140] COND TRUE s__state == 8512 [L306] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L307] __cil_tmp56 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L308] COND TRUE __cil_tmp56 + 256UL [L309] skip = 1 [L317] s__state = 8528 [L318] s__init_num = 0 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L602] COND FALSE !(state == 8576) [L619] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND FALSE !(s__state == 8496) [L137] COND FALSE !(s__state == 8497) [L140] COND FALSE !(s__state == 8512) [L143] COND FALSE !(s__state == 8513) [L146] COND TRUE s__state == 8528 [L322] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L323] l = (unsigned long )s__s3__tmp__new_cipher__algorithms [L325] __cil_tmp57 = (unsigned long )s__options [L326] COND TRUE __cil_tmp57 + 2097152UL [L327] s__s3__tmp__use_rsa_tmp = 1 [L332] COND TRUE \read(s__s3__tmp__use_rsa_tmp) [L359] ret = __VERIFIER_nondet_int() [L360] COND FALSE !(ret <= 0) [L377] s__state = 8544 [L378] s__init_num = 0 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L602] COND FALSE !(state == 8576) [L619] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND FALSE !(s__state == 8496) [L137] COND FALSE !(s__state == 8497) [L140] COND FALSE !(s__state == 8512) [L143] COND FALSE !(s__state == 8513) [L146] COND FALSE !(s__state == 8528) [L149] COND FALSE !(s__state == 8529) [L152] COND TRUE s__state == 8544 [L382] COND TRUE s__verify_mode + 1 [L383] COND FALSE !(s__session__peer != 0) [L394] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L395] __cil_tmp61 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L396] COND FALSE !(__cil_tmp61 + 256UL) [L406] s__s3__tmp__cert_request = 1 [L407] ret = __VERIFIER_nondet_int() [L408] COND FALSE !(ret <= 0) [L411] s__state = 8448 [L412] s__s3__tmp__next_state___0 = 8576 [L413] s__init_num = 0 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L602] COND FALSE !(state == 8576) [L619] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND FALSE !(s__state == 8496) [L137] COND FALSE !(s__state == 8497) [L140] COND FALSE !(s__state == 8512) [L143] COND FALSE !(s__state == 8513) [L146] COND FALSE !(s__state == 8528) [L149] COND FALSE !(s__state == 8529) [L152] COND FALSE !(s__state == 8544) [L155] COND FALSE !(s__state == 8545) [L158] COND FALSE !(s__state == 8560) [L161] COND FALSE !(s__state == 8561) [L164] COND TRUE s__state == 8448 [L434] COND FALSE !(num1 > 0L) [L443] s__state = s__s3__tmp__next_state___0 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L602] COND FALSE !(state == 8576) [L619] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND FALSE !(s__state == 8496) [L137] COND FALSE !(s__state == 8497) [L140] COND FALSE !(s__state == 8512) [L143] COND FALSE !(s__state == 8513) [L146] COND FALSE !(s__state == 8528) [L149] COND FALSE !(s__state == 8529) [L152] COND FALSE !(s__state == 8544) [L155] COND FALSE !(s__state == 8545) [L158] COND FALSE !(s__state == 8560) [L161] COND FALSE !(s__state == 8561) [L164] COND FALSE !(s__state == 8448) [L167] COND TRUE s__state == 8576 [L447] ret = __VERIFIER_nondet_int() [L448] COND FALSE !(ret <= 0) [L451] COND FALSE !(ret == 2) [L454] ret = __VERIFIER_nondet_int() [L455] COND FALSE !(ret <= 0) [L458] s__init_num = 0 [L459] s__state = 8592 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L602] COND TRUE state == 8576 [L603] COND TRUE s__state == 8592 [L604] COND TRUE tmp___1 != -12288 [L605] COND TRUE tmp___2 != -16384 [L606] COND TRUE __cil_tmp56 != 4294967040 [L607] COND TRUE __cil_tmp58 != 4294967294 [L608] COND TRUE tmp___7 != 1024 [L609] COND TRUE tmp___7 != 512 [L630] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 114 locations, 1 error locations. Result: UNSAFE, OverallTime: 47.5s, OverallIterations: 15, TraceHistogramMax: 7, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2409 SDtfs, 1554 SDslu, 2923 SDs, 0 SdLazy, 1793 SolverSat, 361 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 515 GetRequests, 398 SyntacticMatches, 14 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 42.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1186occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 424 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 1503 NumberOfCodeBlocks, 1503 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1463 ConstructedInterpolants, 0 QuantifiedInterpolants, 287981 SizeOfPredicates, 3 NumberOfNonLiveVariables, 379 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 18 InterpolantComputations, 12 PerfectInterpolantSequences, 1240/1492 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...