./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_clnt_2.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_81758371-b122-42d9-b08a-d40655b88c8f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_81758371-b122-42d9-b08a-d40655b88c8f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_81758371-b122-42d9-b08a-d40655b88c8f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_81758371-b122-42d9-b08a-d40655b88c8f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_clnt_2.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_81758371-b122-42d9-b08a-d40655b88c8f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_81758371-b122-42d9-b08a-d40655b88c8f/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d33dcc608b21d2bdbfa0a947775d4e23b857cf07 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:47:38,124 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:47:38,126 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:47:38,141 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:47:38,142 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:47:38,143 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:47:38,145 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:47:38,154 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:47:38,159 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:47:38,163 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:47:38,165 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:47:38,166 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:47:38,166 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:47:38,169 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:47:38,170 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:47:38,171 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:47:38,172 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:47:38,173 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:47:38,175 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:47:38,179 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:47:38,183 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:47:38,187 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:47:38,188 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:47:38,189 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:47:38,191 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:47:38,191 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:47:38,192 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:47:38,193 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:47:38,194 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:47:38,195 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:47:38,195 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:47:38,196 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:47:38,197 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:47:38,197 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:47:38,198 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:47:38,198 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:47:38,199 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:47:38,199 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:47:38,199 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:47:38,200 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:47:38,201 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:47:38,202 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_81758371-b122-42d9-b08a-d40655b88c8f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:47:38,226 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:47:38,236 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:47:38,237 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:47:38,237 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:47:38,238 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:47:38,238 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:47:38,238 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:47:38,238 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:47:38,239 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:47:38,239 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:47:38,239 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:47:38,239 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:47:38,239 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:47:38,240 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:47:38,240 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:47:38,240 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:47:38,240 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:47:38,240 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:47:38,241 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:47:38,241 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:47:38,241 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:47:38,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:47:38,242 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:47:38,242 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:47:38,242 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:47:38,242 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:47:38,242 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:47:38,243 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:47:38,243 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_81758371-b122-42d9-b08a-d40655b88c8f/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d33dcc608b21d2bdbfa0a947775d4e23b857cf07 [2019-11-25 08:47:38,379 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:47:38,391 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:47:38,394 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:47:38,395 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:47:38,395 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:47:38,396 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_81758371-b122-42d9-b08a-d40655b88c8f/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_clnt_2.cil-2.c [2019-11-25 08:47:38,457 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_81758371-b122-42d9-b08a-d40655b88c8f/bin/uautomizer/data/cc3467325/e0472f7b94934a92889d574eb5d659d3/FLAGa4065b245 [2019-11-25 08:47:38,918 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:47:38,920 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_81758371-b122-42d9-b08a-d40655b88c8f/sv-benchmarks/c/ssh-simplified/s3_clnt_2.cil-2.c [2019-11-25 08:47:38,936 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_81758371-b122-42d9-b08a-d40655b88c8f/bin/uautomizer/data/cc3467325/e0472f7b94934a92889d574eb5d659d3/FLAGa4065b245 [2019-11-25 08:47:39,275 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_81758371-b122-42d9-b08a-d40655b88c8f/bin/uautomizer/data/cc3467325/e0472f7b94934a92889d574eb5d659d3 [2019-11-25 08:47:39,278 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:47:39,279 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:47:39,279 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:47:39,280 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:47:39,283 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:47:39,284 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:47:39" (1/1) ... [2019-11-25 08:47:39,286 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b51e795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:39, skipping insertion in model container [2019-11-25 08:47:39,286 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:47:39" (1/1) ... [2019-11-25 08:47:39,296 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:47:39,352 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:47:39,680 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:47:39,683 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:47:39,737 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:47:39,750 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:47:39,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:39 WrapperNode [2019-11-25 08:47:39,751 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:47:39,752 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:47:39,752 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:47:39,752 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:47:39,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:39" (1/1) ... [2019-11-25 08:47:39,780 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:39" (1/1) ... [2019-11-25 08:47:39,818 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:47:39,819 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:47:39,819 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:47:39,819 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:47:39,828 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:39" (1/1) ... [2019-11-25 08:47:39,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:39" (1/1) ... [2019-11-25 08:47:39,831 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:39" (1/1) ... [2019-11-25 08:47:39,831 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:39" (1/1) ... [2019-11-25 08:47:39,839 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:39" (1/1) ... [2019-11-25 08:47:39,846 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:39" (1/1) ... [2019-11-25 08:47:39,849 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:39" (1/1) ... [2019-11-25 08:47:39,854 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:47:39,854 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:47:39,854 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:47:39,854 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:47:39,855 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_81758371-b122-42d9-b08a-d40655b88c8f/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:47:39,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:47:39,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:47:40,032 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 08:47:40,582 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-25 08:47:40,582 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-25 08:47:40,584 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:47:40,584 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-25 08:47:40,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:47:40 BoogieIcfgContainer [2019-11-25 08:47:40,585 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:47:40,586 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:47:40,587 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:47:40,589 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:47:40,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:47:39" (1/3) ... [2019-11-25 08:47:40,590 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48da0ceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:47:40, skipping insertion in model container [2019-11-25 08:47:40,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:39" (2/3) ... [2019-11-25 08:47:40,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48da0ceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:47:40, skipping insertion in model container [2019-11-25 08:47:40,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:47:40" (3/3) ... [2019-11-25 08:47:40,593 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.cil-2.c [2019-11-25 08:47:40,601 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:47:40,607 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:47:40,617 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:47:40,654 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:47:40,655 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:47:40,655 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:47:40,655 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:47:40,655 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:47:40,655 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:47:40,656 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:47:40,656 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:47:40,689 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2019-11-25 08:47:40,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-25 08:47:40,695 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:40,709 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:40,709 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:40,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:40,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1449576961, now seen corresponding path program 1 times [2019-11-25 08:47:40,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:40,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022375005] [2019-11-25 08:47:40,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:40,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:40,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:40,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022375005] [2019-11-25 08:47:40,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:40,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:47:40,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993592692] [2019-11-25 08:47:40,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:40,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:40,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:40,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:40,919 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 3 states. [2019-11-25 08:47:41,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:41,142 INFO L93 Difference]: Finished difference Result 251 states and 426 transitions. [2019-11-25 08:47:41,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:41,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-25 08:47:41,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:41,155 INFO L225 Difference]: With dead ends: 251 [2019-11-25 08:47:41,155 INFO L226 Difference]: Without dead ends: 114 [2019-11-25 08:47:41,158 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:41,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-25 08:47:41,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-11-25 08:47:41,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-25 08:47:41,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 171 transitions. [2019-11-25 08:47:41,200 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 171 transitions. Word has length 23 [2019-11-25 08:47:41,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:41,200 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 171 transitions. [2019-11-25 08:47:41,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:41,200 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 171 transitions. [2019-11-25 08:47:41,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-25 08:47:41,202 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:41,202 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:41,203 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:41,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:41,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1395170557, now seen corresponding path program 1 times [2019-11-25 08:47:41,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:41,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090058595] [2019-11-25 08:47:41,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:41,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:41,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:41,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090058595] [2019-11-25 08:47:41,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:41,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:41,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406748715] [2019-11-25 08:47:41,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:41,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:41,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:41,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:41,269 INFO L87 Difference]: Start difference. First operand 114 states and 171 transitions. Second operand 3 states. [2019-11-25 08:47:41,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:41,448 INFO L93 Difference]: Finished difference Result 238 states and 361 transitions. [2019-11-25 08:47:41,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:41,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-25 08:47:41,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:41,451 INFO L225 Difference]: With dead ends: 238 [2019-11-25 08:47:41,451 INFO L226 Difference]: Without dead ends: 133 [2019-11-25 08:47:41,452 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:41,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-25 08:47:41,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2019-11-25 08:47:41,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-25 08:47:41,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 191 transitions. [2019-11-25 08:47:41,472 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 191 transitions. Word has length 36 [2019-11-25 08:47:41,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:41,472 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 191 transitions. [2019-11-25 08:47:41,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:41,476 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 191 transitions. [2019-11-25 08:47:41,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-25 08:47:41,481 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:41,481 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:41,481 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:41,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:41,482 INFO L82 PathProgramCache]: Analyzing trace with hash -134115002, now seen corresponding path program 1 times [2019-11-25 08:47:41,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:41,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316899494] [2019-11-25 08:47:41,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:41,579 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:47:41,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316899494] [2019-11-25 08:47:41,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:41,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:41,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833144212] [2019-11-25 08:47:41,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:41,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:41,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:41,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:41,581 INFO L87 Difference]: Start difference. First operand 129 states and 191 transitions. Second operand 3 states. [2019-11-25 08:47:41,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:41,732 INFO L93 Difference]: Finished difference Result 270 states and 405 transitions. [2019-11-25 08:47:41,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:41,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-25 08:47:41,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:41,734 INFO L225 Difference]: With dead ends: 270 [2019-11-25 08:47:41,734 INFO L226 Difference]: Without dead ends: 150 [2019-11-25 08:47:41,735 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:41,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-25 08:47:41,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2019-11-25 08:47:41,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-25 08:47:41,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 213 transitions. [2019-11-25 08:47:41,748 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 213 transitions. Word has length 50 [2019-11-25 08:47:41,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:41,749 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 213 transitions. [2019-11-25 08:47:41,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:41,749 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 213 transitions. [2019-11-25 08:47:41,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-25 08:47:41,751 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:41,751 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:41,751 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:41,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:41,752 INFO L82 PathProgramCache]: Analyzing trace with hash -121422705, now seen corresponding path program 1 times [2019-11-25 08:47:41,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:41,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530069791] [2019-11-25 08:47:41,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:41,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:41,862 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-25 08:47:41,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530069791] [2019-11-25 08:47:41,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:41,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:41,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307592640] [2019-11-25 08:47:41,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:41,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:41,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:41,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:41,864 INFO L87 Difference]: Start difference. First operand 146 states and 213 transitions. Second operand 3 states. [2019-11-25 08:47:42,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:42,083 INFO L93 Difference]: Finished difference Result 334 states and 502 transitions. [2019-11-25 08:47:42,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:42,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-25 08:47:42,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:42,086 INFO L225 Difference]: With dead ends: 334 [2019-11-25 08:47:42,086 INFO L226 Difference]: Without dead ends: 196 [2019-11-25 08:47:42,087 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:42,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-25 08:47:42,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 187. [2019-11-25 08:47:42,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-11-25 08:47:42,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 263 transitions. [2019-11-25 08:47:42,113 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 263 transitions. Word has length 67 [2019-11-25 08:47:42,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:42,115 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 263 transitions. [2019-11-25 08:47:42,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:42,116 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 263 transitions. [2019-11-25 08:47:42,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-25 08:47:42,119 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:42,119 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:42,120 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:42,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:42,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1926861039, now seen corresponding path program 1 times [2019-11-25 08:47:42,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:42,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793791617] [2019-11-25 08:47:42,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:42,214 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-25 08:47:42,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793791617] [2019-11-25 08:47:42,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:42,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:42,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549089842] [2019-11-25 08:47:42,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:42,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:42,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:42,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:42,217 INFO L87 Difference]: Start difference. First operand 187 states and 263 transitions. Second operand 3 states. [2019-11-25 08:47:42,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:42,386 INFO L93 Difference]: Finished difference Result 389 states and 554 transitions. [2019-11-25 08:47:42,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:42,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-25 08:47:42,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:42,389 INFO L225 Difference]: With dead ends: 389 [2019-11-25 08:47:42,389 INFO L226 Difference]: Without dead ends: 211 [2019-11-25 08:47:42,390 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:42,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-25 08:47:42,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2019-11-25 08:47:42,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-25 08:47:42,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 287 transitions. [2019-11-25 08:47:42,412 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 287 transitions. Word has length 67 [2019-11-25 08:47:42,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:42,414 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 287 transitions. [2019-11-25 08:47:42,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:42,415 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 287 transitions. [2019-11-25 08:47:42,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-25 08:47:42,421 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:42,421 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:42,422 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:42,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:42,422 INFO L82 PathProgramCache]: Analyzing trace with hash 398996882, now seen corresponding path program 1 times [2019-11-25 08:47:42,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:42,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566384504] [2019-11-25 08:47:42,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:42,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:42,500 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-25 08:47:42,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566384504] [2019-11-25 08:47:42,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:42,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:42,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610616056] [2019-11-25 08:47:42,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:42,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:42,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:42,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:42,503 INFO L87 Difference]: Start difference. First operand 206 states and 287 transitions. Second operand 3 states. [2019-11-25 08:47:42,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:42,635 INFO L93 Difference]: Finished difference Result 427 states and 603 transitions. [2019-11-25 08:47:42,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:42,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-25 08:47:42,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:42,638 INFO L225 Difference]: With dead ends: 427 [2019-11-25 08:47:42,638 INFO L226 Difference]: Without dead ends: 230 [2019-11-25 08:47:42,639 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:42,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-25 08:47:42,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2019-11-25 08:47:42,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-11-25 08:47:42,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 313 transitions. [2019-11-25 08:47:42,657 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 313 transitions. Word has length 84 [2019-11-25 08:47:42,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:42,658 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 313 transitions. [2019-11-25 08:47:42,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:42,658 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 313 transitions. [2019-11-25 08:47:42,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-25 08:47:42,662 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:42,666 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:42,666 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:42,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:42,667 INFO L82 PathProgramCache]: Analyzing trace with hash 90409290, now seen corresponding path program 1 times [2019-11-25 08:47:42,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:42,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723006454] [2019-11-25 08:47:42,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:42,750 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-25 08:47:42,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723006454] [2019-11-25 08:47:42,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:42,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:42,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524895475] [2019-11-25 08:47:42,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:42,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:42,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:42,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:42,766 INFO L87 Difference]: Start difference. First operand 227 states and 313 transitions. Second operand 3 states. [2019-11-25 08:47:42,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:42,805 INFO L93 Difference]: Finished difference Result 661 states and 912 transitions. [2019-11-25 08:47:42,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:42,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-25 08:47:42,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:42,809 INFO L225 Difference]: With dead ends: 661 [2019-11-25 08:47:42,810 INFO L226 Difference]: Without dead ends: 443 [2019-11-25 08:47:42,811 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:42,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-11-25 08:47:42,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2019-11-25 08:47:42,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-11-25 08:47:42,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 609 transitions. [2019-11-25 08:47:42,837 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 609 transitions. Word has length 104 [2019-11-25 08:47:42,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:42,837 INFO L462 AbstractCegarLoop]: Abstraction has 443 states and 609 transitions. [2019-11-25 08:47:42,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:42,838 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 609 transitions. [2019-11-25 08:47:42,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-25 08:47:42,840 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:42,840 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:42,841 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:42,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:42,841 INFO L82 PathProgramCache]: Analyzing trace with hash 935055156, now seen corresponding path program 1 times [2019-11-25 08:47:42,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:42,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960218369] [2019-11-25 08:47:42,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:42,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:42,927 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-25 08:47:42,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960218369] [2019-11-25 08:47:42,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:42,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:42,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399870365] [2019-11-25 08:47:42,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:42,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:42,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:42,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:42,929 INFO L87 Difference]: Start difference. First operand 443 states and 609 transitions. Second operand 3 states. [2019-11-25 08:47:42,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:42,963 INFO L93 Difference]: Finished difference Result 661 states and 909 transitions. [2019-11-25 08:47:42,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:42,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-25 08:47:42,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:42,968 INFO L225 Difference]: With dead ends: 661 [2019-11-25 08:47:42,968 INFO L226 Difference]: Without dead ends: 659 [2019-11-25 08:47:42,969 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:42,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-11-25 08:47:42,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2019-11-25 08:47:42,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-25 08:47:42,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 907 transitions. [2019-11-25 08:47:42,987 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 907 transitions. Word has length 106 [2019-11-25 08:47:42,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:42,987 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 907 transitions. [2019-11-25 08:47:42,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:42,987 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 907 transitions. [2019-11-25 08:47:42,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-25 08:47:42,990 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:42,990 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:42,991 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:42,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:42,991 INFO L82 PathProgramCache]: Analyzing trace with hash -365763014, now seen corresponding path program 1 times [2019-11-25 08:47:42,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:42,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613434408] [2019-11-25 08:47:42,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:43,051 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 311 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-25 08:47:43,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613434408] [2019-11-25 08:47:43,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:43,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:43,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371823631] [2019-11-25 08:47:43,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:43,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:43,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:43,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:43,054 INFO L87 Difference]: Start difference. First operand 659 states and 907 transitions. Second operand 3 states. [2019-11-25 08:47:43,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:43,208 INFO L93 Difference]: Finished difference Result 1462 states and 2068 transitions. [2019-11-25 08:47:43,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:43,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-11-25 08:47:43,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:43,214 INFO L225 Difference]: With dead ends: 1462 [2019-11-25 08:47:43,214 INFO L226 Difference]: Without dead ends: 809 [2019-11-25 08:47:43,215 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:43,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2019-11-25 08:47:43,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 776. [2019-11-25 08:47:43,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-11-25 08:47:43,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1096 transitions. [2019-11-25 08:47:43,237 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1096 transitions. Word has length 175 [2019-11-25 08:47:43,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:43,238 INFO L462 AbstractCegarLoop]: Abstraction has 776 states and 1096 transitions. [2019-11-25 08:47:43,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:43,238 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1096 transitions. [2019-11-25 08:47:43,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-25 08:47:43,241 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:43,242 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:43,242 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:43,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:43,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1933345798, now seen corresponding path program 2 times [2019-11-25 08:47:43,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:43,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975893217] [2019-11-25 08:47:43,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:43,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:43,305 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-11-25 08:47:43,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975893217] [2019-11-25 08:47:43,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:43,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:43,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671814191] [2019-11-25 08:47:43,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:43,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:43,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:43,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:43,309 INFO L87 Difference]: Start difference. First operand 776 states and 1096 transitions. Second operand 3 states. [2019-11-25 08:47:43,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:43,486 INFO L93 Difference]: Finished difference Result 1824 states and 2649 transitions. [2019-11-25 08:47:43,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:43,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-11-25 08:47:43,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:43,493 INFO L225 Difference]: With dead ends: 1824 [2019-11-25 08:47:43,494 INFO L226 Difference]: Without dead ends: 1006 [2019-11-25 08:47:43,495 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:43,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2019-11-25 08:47:43,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 965. [2019-11-25 08:47:43,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-11-25 08:47:43,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1348 transitions. [2019-11-25 08:47:43,523 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1348 transitions. Word has length 188 [2019-11-25 08:47:43,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:43,523 INFO L462 AbstractCegarLoop]: Abstraction has 965 states and 1348 transitions. [2019-11-25 08:47:43,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:43,524 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1348 transitions. [2019-11-25 08:47:43,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-11-25 08:47:43,527 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:43,528 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:43,528 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:43,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:43,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1781023665, now seen corresponding path program 1 times [2019-11-25 08:47:43,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:43,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800012915] [2019-11-25 08:47:43,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:43,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:43,600 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-11-25 08:47:43,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800012915] [2019-11-25 08:47:43,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:43,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:43,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571350517] [2019-11-25 08:47:43,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:43,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:43,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:43,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:43,603 INFO L87 Difference]: Start difference. First operand 965 states and 1348 transitions. Second operand 3 states. [2019-11-25 08:47:43,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:43,772 INFO L93 Difference]: Finished difference Result 2080 states and 2926 transitions. [2019-11-25 08:47:43,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:43,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-11-25 08:47:43,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:43,779 INFO L225 Difference]: With dead ends: 2080 [2019-11-25 08:47:43,779 INFO L226 Difference]: Without dead ends: 1079 [2019-11-25 08:47:43,781 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:43,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-11-25 08:47:43,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1040. [2019-11-25 08:47:43,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1040 states. [2019-11-25 08:47:43,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1444 transitions. [2019-11-25 08:47:43,808 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1444 transitions. Word has length 209 [2019-11-25 08:47:43,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:43,809 INFO L462 AbstractCegarLoop]: Abstraction has 1040 states and 1444 transitions. [2019-11-25 08:47:43,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:43,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1444 transitions. [2019-11-25 08:47:43,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-25 08:47:43,813 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:43,813 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:43,813 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:43,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:43,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1647744508, now seen corresponding path program 1 times [2019-11-25 08:47:43,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:43,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944370190] [2019-11-25 08:47:43,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:43,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:43,908 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-11-25 08:47:43,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944370190] [2019-11-25 08:47:43,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:43,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:43,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140803421] [2019-11-25 08:47:43,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:43,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:43,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:43,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:43,911 INFO L87 Difference]: Start difference. First operand 1040 states and 1444 transitions. Second operand 3 states. [2019-11-25 08:47:44,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:44,121 INFO L93 Difference]: Finished difference Result 2230 states and 3115 transitions. [2019-11-25 08:47:44,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:44,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-11-25 08:47:44,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:44,128 INFO L225 Difference]: With dead ends: 2230 [2019-11-25 08:47:44,128 INFO L226 Difference]: Without dead ends: 1160 [2019-11-25 08:47:44,162 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:44,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2019-11-25 08:47:44,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1124. [2019-11-25 08:47:44,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2019-11-25 08:47:44,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1555 transitions. [2019-11-25 08:47:44,192 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1555 transitions. Word has length 233 [2019-11-25 08:47:44,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:44,192 INFO L462 AbstractCegarLoop]: Abstraction has 1124 states and 1555 transitions. [2019-11-25 08:47:44,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:44,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1555 transitions. [2019-11-25 08:47:44,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-25 08:47:44,197 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:44,197 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:44,197 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:44,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:44,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1766185982, now seen corresponding path program 1 times [2019-11-25 08:47:44,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:44,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153359815] [2019-11-25 08:47:44,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:44,280 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-11-25 08:47:44,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153359815] [2019-11-25 08:47:44,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:44,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:44,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305443471] [2019-11-25 08:47:44,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:44,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:44,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:44,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:44,283 INFO L87 Difference]: Start difference. First operand 1124 states and 1555 transitions. Second operand 3 states. [2019-11-25 08:47:44,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:44,464 INFO L93 Difference]: Finished difference Result 2398 states and 3340 transitions. [2019-11-25 08:47:44,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:44,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-11-25 08:47:44,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:44,472 INFO L225 Difference]: With dead ends: 2398 [2019-11-25 08:47:44,472 INFO L226 Difference]: Without dead ends: 1256 [2019-11-25 08:47:44,474 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:44,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2019-11-25 08:47:44,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1217. [2019-11-25 08:47:44,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-11-25 08:47:44,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1687 transitions. [2019-11-25 08:47:44,507 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1687 transitions. Word has length 233 [2019-11-25 08:47:44,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:44,508 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 1687 transitions. [2019-11-25 08:47:44,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:44,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1687 transitions. [2019-11-25 08:47:44,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-11-25 08:47:44,513 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:44,513 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:44,513 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:44,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:44,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1276246012, now seen corresponding path program 1 times [2019-11-25 08:47:44,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:44,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039160160] [2019-11-25 08:47:44,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:44,614 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 622 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2019-11-25 08:47:44,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039160160] [2019-11-25 08:47:44,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:44,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:44,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432196674] [2019-11-25 08:47:44,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:44,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:44,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:44,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:44,616 INFO L87 Difference]: Start difference. First operand 1217 states and 1687 transitions. Second operand 3 states. [2019-11-25 08:47:44,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:44,657 INFO L93 Difference]: Finished difference Result 3630 states and 5032 transitions. [2019-11-25 08:47:44,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:44,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-11-25 08:47:44,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:44,670 INFO L225 Difference]: With dead ends: 3630 [2019-11-25 08:47:44,671 INFO L226 Difference]: Without dead ends: 2422 [2019-11-25 08:47:44,673 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:44,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2019-11-25 08:47:44,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2420. [2019-11-25 08:47:44,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2420 states. [2019-11-25 08:47:44,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2420 states and 3354 transitions. [2019-11-25 08:47:44,739 INFO L78 Accepts]: Start accepts. Automaton has 2420 states and 3354 transitions. Word has length 263 [2019-11-25 08:47:44,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:44,740 INFO L462 AbstractCegarLoop]: Abstraction has 2420 states and 3354 transitions. [2019-11-25 08:47:44,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:44,740 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 3354 transitions. [2019-11-25 08:47:44,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-11-25 08:47:44,746 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:44,746 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:44,747 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:44,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:44,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1394687486, now seen corresponding path program 1 times [2019-11-25 08:47:44,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:44,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187688075] [2019-11-25 08:47:44,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:44,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:44,830 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2019-11-25 08:47:44,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187688075] [2019-11-25 08:47:44,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:44,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:44,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893839940] [2019-11-25 08:47:44,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:44,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:44,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:44,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:44,833 INFO L87 Difference]: Start difference. First operand 2420 states and 3354 transitions. Second operand 3 states. [2019-11-25 08:47:45,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:45,026 INFO L93 Difference]: Finished difference Result 5143 states and 7169 transitions. [2019-11-25 08:47:45,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:45,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-11-25 08:47:45,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:45,041 INFO L225 Difference]: With dead ends: 5143 [2019-11-25 08:47:45,042 INFO L226 Difference]: Without dead ends: 2702 [2019-11-25 08:47:45,046 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:45,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-11-25 08:47:45,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 2630. [2019-11-25 08:47:45,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2630 states. [2019-11-25 08:47:45,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 3666 transitions. [2019-11-25 08:47:45,125 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 3666 transitions. Word has length 263 [2019-11-25 08:47:45,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:45,125 INFO L462 AbstractCegarLoop]: Abstraction has 2630 states and 3666 transitions. [2019-11-25 08:47:45,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:45,126 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 3666 transitions. [2019-11-25 08:47:45,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-11-25 08:47:45,134 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:45,134 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:45,135 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:45,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:45,135 INFO L82 PathProgramCache]: Analyzing trace with hash -777084420, now seen corresponding path program 1 times [2019-11-25 08:47:45,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:45,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160187576] [2019-11-25 08:47:45,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:45,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:45,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1169 backedges. 629 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2019-11-25 08:47:45,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160187576] [2019-11-25 08:47:45,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:45,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:45,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139465237] [2019-11-25 08:47:45,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:45,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:45,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:45,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:45,301 INFO L87 Difference]: Start difference. First operand 2630 states and 3666 transitions. Second operand 3 states. [2019-11-25 08:47:45,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:45,500 INFO L93 Difference]: Finished difference Result 5335 states and 7421 transitions. [2019-11-25 08:47:45,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:45,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2019-11-25 08:47:45,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:45,515 INFO L225 Difference]: With dead ends: 5335 [2019-11-25 08:47:45,515 INFO L226 Difference]: Without dead ends: 2696 [2019-11-25 08:47:45,519 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:45,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2696 states. [2019-11-25 08:47:45,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2696 to 2624. [2019-11-25 08:47:45,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2624 states. [2019-11-25 08:47:45,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 3630 transitions. [2019-11-25 08:47:45,596 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 3630 transitions. Word has length 298 [2019-11-25 08:47:45,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:45,597 INFO L462 AbstractCegarLoop]: Abstraction has 2624 states and 3630 transitions. [2019-11-25 08:47:45,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:45,597 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 3630 transitions. [2019-11-25 08:47:45,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-11-25 08:47:45,605 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:45,605 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:45,605 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:45,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:45,606 INFO L82 PathProgramCache]: Analyzing trace with hash -844895981, now seen corresponding path program 1 times [2019-11-25 08:47:45,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:45,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590992224] [2019-11-25 08:47:45,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:45,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:45,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 663 proven. 0 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-11-25 08:47:45,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590992224] [2019-11-25 08:47:45,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:45,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:45,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712447310] [2019-11-25 08:47:45,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:45,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:45,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:45,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:45,721 INFO L87 Difference]: Start difference. First operand 2624 states and 3630 transitions. Second operand 3 states. [2019-11-25 08:47:45,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:45,901 INFO L93 Difference]: Finished difference Result 5299 states and 7319 transitions. [2019-11-25 08:47:45,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:45,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2019-11-25 08:47:45,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:45,916 INFO L225 Difference]: With dead ends: 5299 [2019-11-25 08:47:45,916 INFO L226 Difference]: Without dead ends: 2684 [2019-11-25 08:47:45,920 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:45,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2019-11-25 08:47:45,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 2624. [2019-11-25 08:47:45,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2624 states. [2019-11-25 08:47:45,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 3576 transitions. [2019-11-25 08:47:45,995 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 3576 transitions. Word has length 321 [2019-11-25 08:47:45,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:45,995 INFO L462 AbstractCegarLoop]: Abstraction has 2624 states and 3576 transitions. [2019-11-25 08:47:45,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:45,996 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 3576 transitions. [2019-11-25 08:47:46,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-11-25 08:47:46,003 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:46,004 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:46,004 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:46,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:46,004 INFO L82 PathProgramCache]: Analyzing trace with hash 798876465, now seen corresponding path program 1 times [2019-11-25 08:47:46,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:46,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438156653] [2019-11-25 08:47:46,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:46,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 731 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-25 08:47:46,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438156653] [2019-11-25 08:47:46,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:46,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:46,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102988249] [2019-11-25 08:47:46,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:46,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:46,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:46,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:46,125 INFO L87 Difference]: Start difference. First operand 2624 states and 3576 transitions. Second operand 3 states. [2019-11-25 08:47:46,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:46,353 INFO L93 Difference]: Finished difference Result 5545 states and 7499 transitions. [2019-11-25 08:47:46,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:46,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-11-25 08:47:46,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:46,369 INFO L225 Difference]: With dead ends: 5545 [2019-11-25 08:47:46,370 INFO L226 Difference]: Without dead ends: 2930 [2019-11-25 08:47:46,373 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:46,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2019-11-25 08:47:46,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 2714. [2019-11-25 08:47:46,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2714 states. [2019-11-25 08:47:46,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2714 states and 3696 transitions. [2019-11-25 08:47:46,454 INFO L78 Accepts]: Start accepts. Automaton has 2714 states and 3696 transitions. Word has length 335 [2019-11-25 08:47:46,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:46,455 INFO L462 AbstractCegarLoop]: Abstraction has 2714 states and 3696 transitions. [2019-11-25 08:47:46,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:46,455 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 3696 transitions. [2019-11-25 08:47:46,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-11-25 08:47:46,463 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:46,463 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:46,464 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:46,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:46,464 INFO L82 PathProgramCache]: Analyzing trace with hash 668596020, now seen corresponding path program 1 times [2019-11-25 08:47:46,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:46,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148880059] [2019-11-25 08:47:46,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:46,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:46,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 871 proven. 0 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2019-11-25 08:47:46,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148880059] [2019-11-25 08:47:46,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:46,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:46,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327866260] [2019-11-25 08:47:46,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:46,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:46,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:46,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:46,636 INFO L87 Difference]: Start difference. First operand 2714 states and 3696 transitions. Second operand 3 states. [2019-11-25 08:47:46,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:46,724 INFO L93 Difference]: Finished difference Result 7734 states and 10582 transitions. [2019-11-25 08:47:46,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:46,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-11-25 08:47:46,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:46,771 INFO L225 Difference]: With dead ends: 7734 [2019-11-25 08:47:46,771 INFO L226 Difference]: Without dead ends: 5029 [2019-11-25 08:47:46,775 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:46,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5029 states. [2019-11-25 08:47:46,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5029 to 5027. [2019-11-25 08:47:46,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5027 states. [2019-11-25 08:47:46,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5027 states to 5027 states and 6880 transitions. [2019-11-25 08:47:46,911 INFO L78 Accepts]: Start accepts. Automaton has 5027 states and 6880 transitions. Word has length 336 [2019-11-25 08:47:46,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:46,911 INFO L462 AbstractCegarLoop]: Abstraction has 5027 states and 6880 transitions. [2019-11-25 08:47:46,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:46,912 INFO L276 IsEmpty]: Start isEmpty. Operand 5027 states and 6880 transitions. [2019-11-25 08:47:46,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-11-25 08:47:46,921 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:46,922 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:46,922 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:46,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:46,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1546862455, now seen corresponding path program 1 times [2019-11-25 08:47:46,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:46,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385707139] [2019-11-25 08:47:46,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:46,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:47,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-11-25 08:47:47,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385707139] [2019-11-25 08:47:47,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555726683] [2019-11-25 08:47:47,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_81758371-b122-42d9-b08a-d40655b88c8f/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:47,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:47,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:47:47,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:47,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-11-25 08:47:47,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:47:47,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-25 08:47:47,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434820015] [2019-11-25 08:47:47,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:47:47,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:47,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:47:47,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:47:47,493 INFO L87 Difference]: Start difference. First operand 5027 states and 6880 transitions. Second operand 4 states. [2019-11-25 08:47:47,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:47,951 INFO L93 Difference]: Finished difference Result 9987 states and 13646 transitions. [2019-11-25 08:47:47,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:47:47,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 360 [2019-11-25 08:47:47,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:47,966 INFO L225 Difference]: With dead ends: 9987 [2019-11-25 08:47:47,966 INFO L226 Difference]: Without dead ends: 7540 [2019-11-25 08:47:47,971 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:47:47,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7540 states. [2019-11-25 08:47:48,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7540 to 5561. [2019-11-25 08:47:48,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5561 states. [2019-11-25 08:47:48,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5561 states to 5561 states and 7516 transitions. [2019-11-25 08:47:48,134 INFO L78 Accepts]: Start accepts. Automaton has 5561 states and 7516 transitions. Word has length 360 [2019-11-25 08:47:48,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:48,134 INFO L462 AbstractCegarLoop]: Abstraction has 5561 states and 7516 transitions. [2019-11-25 08:47:48,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:47:48,135 INFO L276 IsEmpty]: Start isEmpty. Operand 5561 states and 7516 transitions. [2019-11-25 08:47:48,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-11-25 08:47:48,145 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:48,146 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:48,350 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:48,351 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:48,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:48,352 INFO L82 PathProgramCache]: Analyzing trace with hash 774755817, now seen corresponding path program 2 times [2019-11-25 08:47:48,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:48,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244895289] [2019-11-25 08:47:48,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:48,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-25 08:47:48,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244895289] [2019-11-25 08:47:48,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916582533] [2019-11-25 08:47:48,527 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_81758371-b122-42d9-b08a-d40655b88c8f/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:48,673 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 08:47:48,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:47:48,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:47:48,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:48,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-25 08:47:48,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:47:48,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-25 08:47:48,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974692215] [2019-11-25 08:47:48,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:47:48,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:48,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:47:48,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:47:48,794 INFO L87 Difference]: Start difference. First operand 5561 states and 7516 transitions. Second operand 4 states. [2019-11-25 08:47:49,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:49,269 INFO L93 Difference]: Finished difference Result 12544 states and 16972 transitions. [2019-11-25 08:47:49,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:47:49,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 373 [2019-11-25 08:47:49,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:49,282 INFO L225 Difference]: With dead ends: 12544 [2019-11-25 08:47:49,283 INFO L226 Difference]: Without dead ends: 6979 [2019-11-25 08:47:49,289 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:47:49,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6979 states. [2019-11-25 08:47:49,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6979 to 5709. [2019-11-25 08:47:49,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5709 states. [2019-11-25 08:47:49,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5709 states to 5709 states and 7634 transitions. [2019-11-25 08:47:49,443 INFO L78 Accepts]: Start accepts. Automaton has 5709 states and 7634 transitions. Word has length 373 [2019-11-25 08:47:49,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:49,444 INFO L462 AbstractCegarLoop]: Abstraction has 5709 states and 7634 transitions. [2019-11-25 08:47:49,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:47:49,444 INFO L276 IsEmpty]: Start isEmpty. Operand 5709 states and 7634 transitions. [2019-11-25 08:47:49,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-11-25 08:47:49,457 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:49,458 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:49,662 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:49,662 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:49,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:49,663 INFO L82 PathProgramCache]: Analyzing trace with hash 256545513, now seen corresponding path program 1 times [2019-11-25 08:47:49,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:49,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078358737] [2019-11-25 08:47:49,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:49,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:49,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-11-25 08:47:49,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078358737] [2019-11-25 08:47:49,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:49,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:49,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754365250] [2019-11-25 08:47:49,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:49,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:49,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:49,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:49,816 INFO L87 Difference]: Start difference. First operand 5709 states and 7634 transitions. Second operand 3 states. [2019-11-25 08:47:50,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:50,026 INFO L93 Difference]: Finished difference Result 11015 states and 14510 transitions. [2019-11-25 08:47:50,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:50,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 412 [2019-11-25 08:47:50,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:50,033 INFO L225 Difference]: With dead ends: 11015 [2019-11-25 08:47:50,033 INFO L226 Difference]: Without dead ends: 3069 [2019-11-25 08:47:50,042 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:50,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3069 states. [2019-11-25 08:47:50,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3069 to 2976. [2019-11-25 08:47:50,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2976 states. [2019-11-25 08:47:50,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 3983 transitions. [2019-11-25 08:47:50,116 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 3983 transitions. Word has length 412 [2019-11-25 08:47:50,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:50,117 INFO L462 AbstractCegarLoop]: Abstraction has 2976 states and 3983 transitions. [2019-11-25 08:47:50,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:50,117 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 3983 transitions. [2019-11-25 08:47:50,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2019-11-25 08:47:50,128 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:50,129 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:50,129 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:50,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:50,130 INFO L82 PathProgramCache]: Analyzing trace with hash 930203824, now seen corresponding path program 1 times [2019-11-25 08:47:50,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:50,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574086790] [2019-11-25 08:47:50,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:50,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:50,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1648 proven. 14 refuted. 0 times theorem prover too weak. 1236 trivial. 0 not checked. [2019-11-25 08:47:50,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574086790] [2019-11-25 08:47:50,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435869127] [2019-11-25 08:47:50,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_81758371-b122-42d9-b08a-d40655b88c8f/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:50,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:47:50,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:50,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1075 proven. 0 refuted. 0 times theorem prover too weak. 1823 trivial. 0 not checked. [2019-11-25 08:47:50,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:47:50,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-25 08:47:50,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920927138] [2019-11-25 08:47:50,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:50,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:50,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:50,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:47:50,962 INFO L87 Difference]: Start difference. First operand 2976 states and 3983 transitions. Second operand 3 states. [2019-11-25 08:47:50,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:50,995 INFO L93 Difference]: Finished difference Result 3028 states and 4049 transitions. [2019-11-25 08:47:50,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:50,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 510 [2019-11-25 08:47:50,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:51,001 INFO L225 Difference]: With dead ends: 3028 [2019-11-25 08:47:51,001 INFO L226 Difference]: Without dead ends: 2531 [2019-11-25 08:47:51,003 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 510 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:47:51,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2531 states. [2019-11-25 08:47:51,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2531 to 2481. [2019-11-25 08:47:51,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2481 states. [2019-11-25 08:47:51,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 3319 transitions. [2019-11-25 08:47:51,061 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 3319 transitions. Word has length 510 [2019-11-25 08:47:51,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:51,062 INFO L462 AbstractCegarLoop]: Abstraction has 2481 states and 3319 transitions. [2019-11-25 08:47:51,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:51,063 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 3319 transitions. [2019-11-25 08:47:51,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2019-11-25 08:47:51,075 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:51,077 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 16, 16, 14, 14, 13, 13, 12, 12, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:51,281 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:51,281 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:51,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:51,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1673743471, now seen corresponding path program 1 times [2019-11-25 08:47:51,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:51,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972943187] [2019-11-25 08:47:51,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:51,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2784 backedges. 1623 proven. 14 refuted. 0 times theorem prover too weak. 1147 trivial. 0 not checked. [2019-11-25 08:47:51,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972943187] [2019-11-25 08:47:51,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697932200] [2019-11-25 08:47:51,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_81758371-b122-42d9-b08a-d40655b88c8f/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:51,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 827 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:47:51,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:51,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2784 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 2506 trivial. 0 not checked. [2019-11-25 08:47:51,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:47:51,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-25 08:47:51,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362605683] [2019-11-25 08:47:51,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:51,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:51,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:51,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:47:51,810 INFO L87 Difference]: Start difference. First operand 2481 states and 3319 transitions. Second operand 3 states. [2019-11-25 08:47:52,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:52,028 INFO L93 Difference]: Finished difference Result 5060 states and 6783 transitions. [2019-11-25 08:47:52,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:52,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 511 [2019-11-25 08:47:52,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:52,034 INFO L225 Difference]: With dead ends: 5060 [2019-11-25 08:47:52,035 INFO L226 Difference]: Without dead ends: 2589 [2019-11-25 08:47:52,038 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 511 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:47:52,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2589 states. [2019-11-25 08:47:52,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2589 to 2586. [2019-11-25 08:47:52,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2586 states. [2019-11-25 08:47:52,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2586 states to 2586 states and 3331 transitions. [2019-11-25 08:47:52,097 INFO L78 Accepts]: Start accepts. Automaton has 2586 states and 3331 transitions. Word has length 511 [2019-11-25 08:47:52,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:52,098 INFO L462 AbstractCegarLoop]: Abstraction has 2586 states and 3331 transitions. [2019-11-25 08:47:52,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:52,098 INFO L276 IsEmpty]: Start isEmpty. Operand 2586 states and 3331 transitions. [2019-11-25 08:47:52,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2019-11-25 08:47:52,115 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:52,116 INFO L410 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 21, 19, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:52,320 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:52,321 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:52,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:52,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1058434925, now seen corresponding path program 2 times [2019-11-25 08:47:52,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:52,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455677378] [2019-11-25 08:47:52,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:52,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:52,608 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2019-11-25 08:47:52,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455677378] [2019-11-25 08:47:52,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177523539] [2019-11-25 08:47:52,609 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_81758371-b122-42d9-b08a-d40655b88c8f/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:52,784 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 08:47:52,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:47:52,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 978 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:47:52,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:53,026 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2019-11-25 08:47:53,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:47:53,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-25 08:47:53,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315005448] [2019-11-25 08:47:53,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:47:53,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:53,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:47:53,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:47:53,031 INFO L87 Difference]: Start difference. First operand 2586 states and 3331 transitions. Second operand 4 states. [2019-11-25 08:47:53,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:53,222 INFO L93 Difference]: Finished difference Result 2848 states and 3664 transitions. [2019-11-25 08:47:53,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:47:53,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 622 [2019-11-25 08:47:53,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:53,224 INFO L225 Difference]: With dead ends: 2848 [2019-11-25 08:47:53,224 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 08:47:53,228 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 624 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:47:53,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 08:47:53,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 08:47:53,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 08:47:53,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 08:47:53,229 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 622 [2019-11-25 08:47:53,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:53,229 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:47:53,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:47:53,229 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:47:53,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 08:47:53,434 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:53,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-25 08:47:54,005 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 253 DAG size of output: 111 [2019-11-25 08:47:54,783 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 7 [2019-11-25 08:47:55,229 WARN L192 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2019-11-25 08:47:55,330 INFO L440 ceAbstractionStarter]: At program point L168(lines 164 498) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-25 08:47:55,331 INFO L440 ceAbstractionStarter]: At program point L102(lines 101 519) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (= 12292 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-25 08:47:55,331 INFO L444 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2019-11-25 08:47:55,331 INFO L444 ceAbstractionStarter]: For program point L466-2(lines 466 468) no Hoare annotation was computed. [2019-11-25 08:47:55,331 INFO L444 ceAbstractionStarter]: For program point L434(lines 434 438) no Hoare annotation was computed. [2019-11-25 08:47:55,331 INFO L444 ceAbstractionStarter]: For program point L434-2(lines 434 438) no Hoare annotation was computed. [2019-11-25 08:47:55,331 INFO L444 ceAbstractionStarter]: For program point L335(lines 335 339) no Hoare annotation was computed. [2019-11-25 08:47:55,331 INFO L444 ceAbstractionStarter]: For program point L269(lines 269 271) no Hoare annotation was computed. [2019-11-25 08:47:55,331 INFO L444 ceAbstractionStarter]: For program point L335-2(lines 335 339) no Hoare annotation was computed. [2019-11-25 08:47:55,331 INFO L444 ceAbstractionStarter]: For program point L269-2(lines 201 484) no Hoare annotation was computed. [2019-11-25 08:47:55,331 INFO L444 ceAbstractionStarter]: For program point L170(lines 170 496) no Hoare annotation was computed. [2019-11-25 08:47:55,331 INFO L444 ceAbstractionStarter]: For program point L137(lines 137 507) no Hoare annotation was computed. [2019-11-25 08:47:55,332 INFO L444 ceAbstractionStarter]: For program point L104(lines 104 518) no Hoare annotation was computed. [2019-11-25 08:47:55,332 INFO L440 ceAbstractionStarter]: At program point L138(lines 134 508) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) [2019-11-25 08:47:55,332 INFO L444 ceAbstractionStarter]: For program point L304(lines 304 306) no Hoare annotation was computed. [2019-11-25 08:47:55,332 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 241) no Hoare annotation was computed. [2019-11-25 08:47:55,332 INFO L444 ceAbstractionStarter]: For program point L304-2(lines 201 484) no Hoare annotation was computed. [2019-11-25 08:47:55,332 INFO L444 ceAbstractionStarter]: For program point L404(lines 404 406) no Hoare annotation was computed. [2019-11-25 08:47:55,332 INFO L444 ceAbstractionStarter]: For program point L371(lines 371 373) no Hoare annotation was computed. [2019-11-25 08:47:55,332 INFO L440 ceAbstractionStarter]: At program point L206(lines 104 518) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) [2019-11-25 08:47:55,332 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 495) no Hoare annotation was computed. [2019-11-25 08:47:55,332 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 506) no Hoare annotation was computed. [2019-11-25 08:47:55,332 INFO L444 ceAbstractionStarter]: For program point L107(lines 107 517) no Hoare annotation was computed. [2019-11-25 08:47:55,333 INFO L440 ceAbstractionStarter]: At program point L174(lines 170 496) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-25 08:47:55,333 INFO L444 ceAbstractionStarter]: For program point L472(lines 472 474) no Hoare annotation was computed. [2019-11-25 08:47:55,333 INFO L444 ceAbstractionStarter]: For program point L472-2(lines 472 474) no Hoare annotation was computed. [2019-11-25 08:47:55,333 INFO L447 ceAbstractionStarter]: At program point L539(lines 97 540) the Hoare annotation is: true [2019-11-25 08:47:55,333 INFO L444 ceAbstractionStarter]: For program point L275(lines 275 279) no Hoare annotation was computed. [2019-11-25 08:47:55,333 INFO L444 ceAbstractionStarter]: For program point L275-2(lines 275 279) no Hoare annotation was computed. [2019-11-25 08:47:55,333 INFO L444 ceAbstractionStarter]: For program point L176(lines 176 494) no Hoare annotation was computed. [2019-11-25 08:47:55,333 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 505) no Hoare annotation was computed. [2019-11-25 08:47:55,333 INFO L444 ceAbstractionStarter]: For program point L110(lines 110 516) no Hoare annotation was computed. [2019-11-25 08:47:55,333 INFO L440 ceAbstractionStarter]: At program point L144(lines 140 506) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4448) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-25 08:47:55,333 INFO L444 ceAbstractionStarter]: For program point L211(lines 211 213) no Hoare annotation was computed. [2019-11-25 08:47:55,333 INFO L444 ceAbstractionStarter]: For program point L211-2(lines 211 213) no Hoare annotation was computed. [2019-11-25 08:47:55,334 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 493) no Hoare annotation was computed. [2019-11-25 08:47:55,334 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 504) no Hoare annotation was computed. [2019-11-25 08:47:55,334 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 515) no Hoare annotation was computed. [2019-11-25 08:47:55,334 INFO L444 ceAbstractionStarter]: For program point L477(lines 477 479) no Hoare annotation was computed. [2019-11-25 08:47:55,334 INFO L444 ceAbstractionStarter]: For program point L444(lines 444 455) no Hoare annotation was computed. [2019-11-25 08:47:55,334 INFO L444 ceAbstractionStarter]: For program point L411(lines 411 425) no Hoare annotation was computed. [2019-11-25 08:47:55,334 INFO L444 ceAbstractionStarter]: For program point L411-1(lines 411 425) no Hoare annotation was computed. [2019-11-25 08:47:55,334 INFO L444 ceAbstractionStarter]: For program point L444-2(lines 444 455) no Hoare annotation was computed. [2019-11-25 08:47:55,334 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 315) no Hoare annotation was computed. [2019-11-25 08:47:55,334 INFO L440 ceAbstractionStarter]: At program point L180(lines 176 494) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (and (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)))) [2019-11-25 08:47:55,334 INFO L444 ceAbstractionStarter]: For program point L544(lines 544 546) no Hoare annotation was computed. [2019-11-25 08:47:55,334 INFO L444 ceAbstractionStarter]: For program point L544-2(lines 544 546) no Hoare annotation was computed. [2019-11-25 08:47:55,334 INFO L444 ceAbstractionStarter]: For program point L347(lines 347 349) no Hoare annotation was computed. [2019-11-25 08:47:55,335 INFO L444 ceAbstractionStarter]: For program point L182(lines 182 492) no Hoare annotation was computed. [2019-11-25 08:47:55,335 INFO L444 ceAbstractionStarter]: For program point L149(lines 149 503) no Hoare annotation was computed. [2019-11-25 08:47:55,335 INFO L444 ceAbstractionStarter]: For program point L116(lines 116 514) no Hoare annotation was computed. [2019-11-25 08:47:55,335 INFO L444 ceAbstractionStarter]: For program point L381(lines 381 383) no Hoare annotation was computed. [2019-11-25 08:47:55,335 INFO L444 ceAbstractionStarter]: For program point L216(lines 216 219) no Hoare annotation was computed. [2019-11-25 08:47:55,335 INFO L440 ceAbstractionStarter]: At program point L150(lines 146 504) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4464) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-25 08:47:55,335 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 90) no Hoare annotation was computed. [2019-11-25 08:47:55,335 INFO L444 ceAbstractionStarter]: For program point L415(lines 415 421) no Hoare annotation was computed. [2019-11-25 08:47:55,335 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 256) no Hoare annotation was computed. [2019-11-25 08:47:55,335 INFO L444 ceAbstractionStarter]: For program point L449(lines 449 452) no Hoare annotation was computed. [2019-11-25 08:47:55,335 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-25 08:47:55,335 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 491) no Hoare annotation was computed. [2019-11-25 08:47:55,336 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 502) no Hoare annotation was computed. [2019-11-25 08:47:55,336 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 513) no Hoare annotation was computed. [2019-11-25 08:47:55,336 INFO L447 ceAbstractionStarter]: At program point L549(lines 10 551) the Hoare annotation is: true [2019-11-25 08:47:55,336 INFO L440 ceAbstractionStarter]: At program point L186(lines 182 492) the Hoare annotation is: (let ((.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse2 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)))) [2019-11-25 08:47:55,336 INFO L440 ceAbstractionStarter]: At program point L120(lines 116 514) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-25 08:47:55,336 INFO L444 ceAbstractionStarter]: For program point L87(lines 87 89) no Hoare annotation was computed. [2019-11-25 08:47:55,336 INFO L444 ceAbstractionStarter]: For program point L87-2(lines 84 90) no Hoare annotation was computed. [2019-11-25 08:47:55,336 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 296) no Hoare annotation was computed. [2019-11-25 08:47:55,336 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 255) no Hoare annotation was computed. [2019-11-25 08:47:55,336 INFO L444 ceAbstractionStarter]: For program point L286-2(lines 286 296) no Hoare annotation was computed. [2019-11-25 08:47:55,336 INFO L444 ceAbstractionStarter]: For program point L253-2(lines 201 484) no Hoare annotation was computed. [2019-11-25 08:47:55,337 INFO L440 ceAbstractionStarter]: At program point L485(lines 98 538) the Hoare annotation is: (let ((.cse8 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (let ((.cse4 (<= ULTIMATE.start_ssl3_connect_~s__state~0 3)) (.cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse3 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse12 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse7 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse1 (not .cse8)) (.cse10 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse9 (= 4400 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse6 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2))) (or (and .cse0 (= 4368 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse1 .cse2 .cse3 .cse0) (and .cse4 .cse5) (and .cse6 .cse7 .cse8 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse7 .cse8 .cse5 .cse9) (and .cse0 .cse4 .cse8) (and .cse10 .cse11 .cse12 .cse8 .cse5) (and .cse2 .cse3 .cse12 .cse8 .cse5) (and (= 4416 ULTIMATE.start_ssl3_connect_~s__state~0) .cse7 .cse8) (and .cse1 .cse10 .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse11) (and .cse0 (= 4384 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse0 .cse8 .cse9) (and (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) .cse6 .cse0)))) [2019-11-25 08:47:55,337 INFO L444 ceAbstractionStarter]: For program point L320(lines 320 322) no Hoare annotation was computed. [2019-11-25 08:47:55,337 INFO L444 ceAbstractionStarter]: For program point L188(lines 188 490) no Hoare annotation was computed. [2019-11-25 08:47:55,337 INFO L444 ceAbstractionStarter]: For program point L155(lines 155 501) no Hoare annotation was computed. [2019-11-25 08:47:55,337 INFO L444 ceAbstractionStarter]: For program point L122(lines 122 512) no Hoare annotation was computed. [2019-11-25 08:47:55,337 INFO L444 ceAbstractionStarter]: For program point L387(lines 387 391) no Hoare annotation was computed. [2019-11-25 08:47:55,337 INFO L440 ceAbstractionStarter]: At program point L321(lines 75 550) the Hoare annotation is: false [2019-11-25 08:47:55,337 INFO L444 ceAbstractionStarter]: For program point L387-2(lines 201 484) no Hoare annotation was computed. [2019-11-25 08:47:55,337 INFO L444 ceAbstractionStarter]: For program point L222(lines 222 233) no Hoare annotation was computed. [2019-11-25 08:47:55,338 INFO L444 ceAbstractionStarter]: For program point L222-2(lines 201 484) no Hoare annotation was computed. [2019-11-25 08:47:55,338 INFO L444 ceAbstractionStarter]: For program point L520(lines 520 536) no Hoare annotation was computed. [2019-11-25 08:47:55,338 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-25 08:47:55,338 INFO L444 ceAbstractionStarter]: For program point L521(lines 521 535) no Hoare annotation was computed. [2019-11-25 08:47:55,338 INFO L444 ceAbstractionStarter]: For program point L356(lines 356 358) no Hoare annotation was computed. [2019-11-25 08:47:55,338 INFO L444 ceAbstractionStarter]: For program point L323(lines 323 325) no Hoare annotation was computed. [2019-11-25 08:47:55,338 INFO L444 ceAbstractionStarter]: For program point L290(lines 290 292) no Hoare annotation was computed. [2019-11-25 08:47:55,338 INFO L444 ceAbstractionStarter]: For program point L224(lines 224 227) no Hoare annotation was computed. [2019-11-25 08:47:55,338 INFO L444 ceAbstractionStarter]: For program point L290-2(lines 288 296) no Hoare annotation was computed. [2019-11-25 08:47:55,342 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 489) no Hoare annotation was computed. [2019-11-25 08:47:55,342 INFO L444 ceAbstractionStarter]: For program point L158(lines 158 500) no Hoare annotation was computed. [2019-11-25 08:47:55,343 INFO L444 ceAbstractionStarter]: For program point L125(lines 125 511) no Hoare annotation was computed. [2019-11-25 08:47:55,343 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 96) no Hoare annotation was computed. [2019-11-25 08:47:55,343 INFO L444 ceAbstractionStarter]: For program point L522(lines 522 527) no Hoare annotation was computed. [2019-11-25 08:47:55,343 INFO L444 ceAbstractionStarter]: For program point L522-2(lines 521 535) no Hoare annotation was computed. [2019-11-25 08:47:55,343 INFO L440 ceAbstractionStarter]: At program point L192(lines 188 490) the Hoare annotation is: (let ((.cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse0 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (not .cse0) .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (and .cse1 .cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)))) [2019-11-25 08:47:55,343 INFO L440 ceAbstractionStarter]: At program point L126(lines 122 512) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-25 08:47:55,344 INFO L444 ceAbstractionStarter]: For program point L93(lines 93 95) no Hoare annotation was computed. [2019-11-25 08:47:55,344 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-25 08:47:55,344 INFO L444 ceAbstractionStarter]: For program point L524(lines 524 526) no Hoare annotation was computed. [2019-11-25 08:47:55,344 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 488) no Hoare annotation was computed. [2019-11-25 08:47:55,344 INFO L444 ceAbstractionStarter]: For program point L161(lines 161 499) no Hoare annotation was computed. [2019-11-25 08:47:55,344 INFO L444 ceAbstractionStarter]: For program point L128(lines 128 510) no Hoare annotation was computed. [2019-11-25 08:47:55,344 INFO L444 ceAbstractionStarter]: For program point L360(lines 360 365) no Hoare annotation was computed. [2019-11-25 08:47:55,344 INFO L444 ceAbstractionStarter]: For program point L360-2(lines 360 365) no Hoare annotation was computed. [2019-11-25 08:47:55,345 INFO L444 ceAbstractionStarter]: For program point L228(lines 228 231) no Hoare annotation was computed. [2019-11-25 08:47:55,345 INFO L440 ceAbstractionStarter]: At program point L195(lines 194 488) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse2 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse0 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (not .cse0) .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse2) (and .cse1 .cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)))) [2019-11-25 08:47:55,345 INFO L440 ceAbstractionStarter]: At program point L162(lines 152 502) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4480) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-25 08:47:55,345 INFO L444 ceAbstractionStarter]: For program point L460-1(lines 460 462) no Hoare annotation was computed. [2019-11-25 08:47:55,345 INFO L444 ceAbstractionStarter]: For program point L262(lines 262 264) no Hoare annotation was computed. [2019-11-25 08:47:55,345 INFO L447 ceAbstractionStarter]: At program point L560(lines 552 562) the Hoare annotation is: true [2019-11-25 08:47:55,346 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 487) no Hoare annotation was computed. [2019-11-25 08:47:55,346 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 498) no Hoare annotation was computed. [2019-11-25 08:47:55,346 INFO L444 ceAbstractionStarter]: For program point L131(lines 131 509) no Hoare annotation was computed. [2019-11-25 08:47:55,346 INFO L444 ceAbstractionStarter]: For program point L98-1(lines 75 550) no Hoare annotation was computed. [2019-11-25 08:47:55,346 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 548) no Hoare annotation was computed. [2019-11-25 08:47:55,346 INFO L444 ceAbstractionStarter]: For program point L396(lines 396 399) no Hoare annotation was computed. [2019-11-25 08:47:55,346 INFO L447 ceAbstractionStarter]: At program point L198(lines 197 487) the Hoare annotation is: true [2019-11-25 08:47:55,347 INFO L440 ceAbstractionStarter]: At program point L132(lines 128 510) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2))) [2019-11-25 08:47:55,347 INFO L444 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-25 08:47:55,347 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 533) no Hoare annotation was computed. [2019-11-25 08:47:55,347 INFO L444 ceAbstractionStarter]: For program point L431(lines 431 433) no Hoare annotation was computed. [2019-11-25 08:47:55,347 INFO L444 ceAbstractionStarter]: For program point L332(lines 332 334) no Hoare annotation was computed. [2019-11-25 08:47:55,347 INFO L447 ceAbstractionStarter]: At program point L200(lines 199 487) the Hoare annotation is: true [2019-11-25 08:47:55,348 INFO L444 ceAbstractionStarter]: For program point L167(lines 167 497) no Hoare annotation was computed. [2019-11-25 08:47:55,348 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 508) no Hoare annotation was computed. [2019-11-25 08:47:55,348 INFO L444 ceAbstractionStarter]: For program point L101(lines 101 519) no Hoare annotation was computed. [2019-11-25 08:47:55,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:47:55 BoogieIcfgContainer [2019-11-25 08:47:55,384 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:47:55,384 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:47:55,384 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:47:55,384 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:47:55,385 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:47:40" (3/4) ... [2019-11-25 08:47:55,388 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 08:47:55,414 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-25 08:47:55,416 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 08:47:55,553 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_81758371-b122-42d9-b08a-d40655b88c8f/bin/uautomizer/witness.graphml [2019-11-25 08:47:55,553 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:47:55,554 INFO L168 Benchmark]: Toolchain (without parser) took 16275.58 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 948.7 MB in the beginning and 1.8 GB in the end (delta: -843.6 MB). Peak memory consumption was 210.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:55,554 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:47:55,555 INFO L168 Benchmark]: CACSL2BoogieTranslator took 471.78 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -159.4 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:55,556 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.89 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:55,556 INFO L168 Benchmark]: Boogie Preprocessor took 35.10 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-11-25 08:47:55,557 INFO L168 Benchmark]: RCFGBuilder took 731.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.6 MB). Peak memory consumption was 57.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:55,557 INFO L168 Benchmark]: TraceAbstraction took 14797.42 ms. Allocated memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: 936.9 MB). Free memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: -781.6 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-11-25 08:47:55,557 INFO L168 Benchmark]: Witness Printer took 169.06 ms. Allocated memory is still 2.1 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 32.9 MB). Peak memory consumption was 32.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:55,559 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 471.78 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -159.4 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.89 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.10 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. * RCFGBuilder took 731.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.6 MB). Peak memory consumption was 57.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14797.42 ms. Allocated memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: 936.9 MB). Free memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: -781.6 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 169.06 ms. Allocated memory is still 2.1 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 32.9 MB). Peak memory consumption was 32.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 548]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 182]: Loop Invariant Derived loop invariant: ((((s__state <= 4560 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4432 <= s__state) || (((s__state <= 4560 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state)) || ((4512 <= s__state && s__state <= 4560) && blastFlag <= 2) - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: ((blastFlag <= 4 && s__state <= 4448) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: blastFlag <= 2 && 12292 == s__state - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((s__state <= 4512 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state) || ((4512 <= s__state && s__state <= 4528) && blastFlag <= 2) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((blastFlag <= 4 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: (((!(0 == s__hit) && 4560 <= s__state) && s__state <= 4560) && blastFlag <= 2) || ((((4560 <= s__state && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((s__state <= 4464 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((s__state <= 4480 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 552]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: ((((!(0 == s__hit) && s__state <= 4352) && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state) || ((((s__state <= 4352 && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: s__state <= 4560 && blastFlag <= 2 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((((((((blastFlag <= 2 && 4368 == s__state) || (((!(0 == s__hit) && 4560 <= s__state) && s__state <= 4560) && blastFlag <= 2)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state)) || (((blastFlag <= 4 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4400 == s__state)) || ((blastFlag <= 2 && s__state <= 3) && 0 == s__hit)) || ((((s__state <= 4352 && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((((4560 <= s__state && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((4416 == s__state && blastFlag <= 4) && 0 == s__hit)) || ((((!(0 == s__hit) && s__state <= 4352) && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state)) || (blastFlag <= 2 && 4384 == s__state)) || ((blastFlag <= 2 && 0 == s__hit) && 4400 == s__state)) || ((4512 <= s__state && s__state <= 4528) && blastFlag <= 2) - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: ((s__state <= 4512 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: ((((blastFlag <= 4 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) || (((blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 127 locations, 1 error locations. Result: SAFE, OverallTime: 14.7s, OverallIterations: 25, TraceHistogramMax: 22, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.8s, HoareTripleCheckerStatistics: 4490 SDtfs, 2115 SDslu, 2318 SDs, 0 SdLazy, 2460 SolverSat, 611 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2456 GetRequests, 2421 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5709occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 25 MinimizatonAttempts, 4032 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 155 NumberOfFragments, 425 HoareAnnotationTreeSize, 22 FomulaSimplifications, 31460 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 22 FomulaSimplificationsInter, 24851 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 8555 NumberOfCodeBlocks, 8555 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 8525 ConstructedInterpolants, 0 QuantifiedInterpolants, 4552471 SizeOfPredicates, 7 NumberOfNonLiveVariables, 3948 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 30 InterpolantComputations, 22 PerfectInterpolantSequences, 38935/39021 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...