./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d4f551d5-fb28-4fa0-9fd0-ce0f2d9c9301/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d4f551d5-fb28-4fa0-9fd0-ce0f2d9c9301/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d4f551d5-fb28-4fa0-9fd0-ce0f2d9c9301/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d4f551d5-fb28-4fa0-9fd0-ce0f2d9c9301/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_d4f551d5-fb28-4fa0-9fd0-ce0f2d9c9301/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d4f551d5-fb28-4fa0-9fd0-ce0f2d9c9301/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 5377418547a5706dafa6030007433e8164dafce8 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 03:44:53,098 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 03:44:53,100 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 03:44:53,112 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 03:44:53,112 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 03:44:53,113 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 03:44:53,115 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 03:44:53,117 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 03:44:53,119 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 03:44:53,120 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 03:44:53,121 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 03:44:53,123 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 03:44:53,123 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 03:44:53,124 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 03:44:53,125 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 03:44:53,127 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 03:44:53,128 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 03:44:53,129 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 03:44:53,131 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 03:44:53,133 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 03:44:53,135 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 03:44:53,137 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 03:44:53,138 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 03:44:53,139 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 03:44:53,142 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 03:44:53,142 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 03:44:53,143 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 03:44:53,144 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 03:44:53,144 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 03:44:53,145 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 03:44:53,146 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 03:44:53,146 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 03:44:53,147 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 03:44:53,148 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 03:44:53,149 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 03:44:53,149 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 03:44:53,150 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 03:44:53,150 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 03:44:53,151 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 03:44:53,152 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 03:44:53,152 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 03:44:53,153 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d4f551d5-fb28-4fa0-9fd0-ce0f2d9c9301/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 03:44:53,168 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 03:44:53,168 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 03:44:53,169 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 03:44:53,169 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 03:44:53,170 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 03:44:53,170 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 03:44:53,170 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 03:44:53,170 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 03:44:53,171 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 03:44:53,171 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 03:44:53,171 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 03:44:53,171 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 03:44:53,172 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 03:44:53,172 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 03:44:53,172 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 03:44:53,172 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 03:44:53,173 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 03:44:53,173 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 03:44:53,173 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 03:44:53,174 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 03:44:53,174 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 03:44:53,174 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 03:44:53,174 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 03:44:53,175 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 03:44:53,175 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 03:44:53,175 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 03:44:53,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 03:44:53,176 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 03:44:53,176 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_d4f551d5-fb28-4fa0-9fd0-ce0f2d9c9301/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 -> 5377418547a5706dafa6030007433e8164dafce8 [2019-11-20 03:44:53,337 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 03:44:53,349 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 03:44:53,353 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 03:44:53,354 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 03:44:53,355 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 03:44:53,355 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d4f551d5-fb28-4fa0-9fd0-ce0f2d9c9301/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-1.c [2019-11-20 03:44:53,415 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d4f551d5-fb28-4fa0-9fd0-ce0f2d9c9301/bin/uautomizer/data/3195a0735/a054f14677304b408a6b5a1b5cc7c53b/FLAG8b851d698 [2019-11-20 03:44:53,885 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 03:44:53,886 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d4f551d5-fb28-4fa0-9fd0-ce0f2d9c9301/sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-1.c [2019-11-20 03:44:53,897 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d4f551d5-fb28-4fa0-9fd0-ce0f2d9c9301/bin/uautomizer/data/3195a0735/a054f14677304b408a6b5a1b5cc7c53b/FLAG8b851d698 [2019-11-20 03:44:54,238 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d4f551d5-fb28-4fa0-9fd0-ce0f2d9c9301/bin/uautomizer/data/3195a0735/a054f14677304b408a6b5a1b5cc7c53b [2019-11-20 03:44:54,241 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 03:44:54,242 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 03:44:54,243 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 03:44:54,243 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 03:44:54,247 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 03:44:54,248 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:44:54" (1/1) ... [2019-11-20 03:44:54,251 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5904642e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:44:54, skipping insertion in model container [2019-11-20 03:44:54,252 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:44:54" (1/1) ... [2019-11-20 03:44:54,259 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 03:44:54,312 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 03:44:54,634 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:44:54,638 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 03:44:54,715 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:44:54,729 INFO L192 MainTranslator]: Completed translation [2019-11-20 03:44:54,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:44:54 WrapperNode [2019-11-20 03:44:54,730 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 03:44:54,731 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 03:44:54,731 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 03:44:54,732 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 03:44:54,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:44:54" (1/1) ... [2019-11-20 03:44:54,752 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:44:54" (1/1) ... [2019-11-20 03:44:54,795 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 03:44:54,795 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 03:44:54,795 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 03:44:54,796 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 03:44:54,805 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:44:54" (1/1) ... [2019-11-20 03:44:54,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:44:54" (1/1) ... [2019-11-20 03:44:54,809 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:44:54" (1/1) ... [2019-11-20 03:44:54,809 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:44:54" (1/1) ... [2019-11-20 03:44:54,816 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:44:54" (1/1) ... [2019-11-20 03:44:54,834 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:44:54" (1/1) ... [2019-11-20 03:44:54,837 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:44:54" (1/1) ... [2019-11-20 03:44:54,841 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 03:44:54,842 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 03:44:54,842 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 03:44:54,842 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 03:44:54,843 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:44:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4f551d5-fb28-4fa0-9fd0-ce0f2d9c9301/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 03:44:54,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 03:44:54,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 03:44:55,112 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 03:44:55,733 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-20 03:44:55,734 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-20 03:44:55,735 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 03:44:55,736 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 03:44:55,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:44:55 BoogieIcfgContainer [2019-11-20 03:44:55,738 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 03:44:55,741 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 03:44:55,744 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 03:44:55,747 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 03:44:55,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:44:54" (1/3) ... [2019-11-20 03:44:55,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76da079d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:44:55, skipping insertion in model container [2019-11-20 03:44:55,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:44:54" (2/3) ... [2019-11-20 03:44:55,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76da079d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:44:55, skipping insertion in model container [2019-11-20 03:44:55,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:44:55" (3/3) ... [2019-11-20 03:44:55,753 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.cil-1.c [2019-11-20 03:44:55,766 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 03:44:55,779 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 03:44:55,789 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 03:44:55,814 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 03:44:55,814 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 03:44:55,815 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 03:44:55,815 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 03:44:55,815 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 03:44:55,815 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 03:44:55,815 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 03:44:55,815 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 03:44:55,836 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states. [2019-11-20 03:44:55,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 03:44:55,844 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:44:55,844 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-20 03:44:55,845 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:44:55,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:44:55,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1449578949, now seen corresponding path program 1 times [2019-11-20 03:44:55,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:44:55,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611817167] [2019-11-20 03:44:55,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:44:55,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:44:56,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:44:56,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611817167] [2019-11-20 03:44:56,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:44:56,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:44:56,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811155482] [2019-11-20 03:44:56,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:44:56,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:44:56,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:44:56,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:44:56,045 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 3 states. [2019-11-20 03:44:56,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:44:56,323 INFO L93 Difference]: Finished difference Result 243 states and 418 transitions. [2019-11-20 03:44:56,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:44:56,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-20 03:44:56,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:44:56,337 INFO L225 Difference]: With dead ends: 243 [2019-11-20 03:44:56,337 INFO L226 Difference]: Without dead ends: 111 [2019-11-20 03:44:56,341 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:44:56,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-20 03:44:56,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-11-20 03:44:56,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-20 03:44:56,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 168 transitions. [2019-11-20 03:44:56,390 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 168 transitions. Word has length 23 [2019-11-20 03:44:56,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:44:56,391 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 168 transitions. [2019-11-20 03:44:56,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:44:56,391 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 168 transitions. [2019-11-20 03:44:56,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 03:44:56,393 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:44:56,393 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] [2019-11-20 03:44:56,393 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:44:56,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:44:56,394 INFO L82 PathProgramCache]: Analyzing trace with hash 800883515, now seen corresponding path program 1 times [2019-11-20 03:44:56,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:44:56,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378925168] [2019-11-20 03:44:56,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:44:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:44:56,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:44:56,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378925168] [2019-11-20 03:44:56,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:44:56,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:44:56,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790695906] [2019-11-20 03:44:56,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:44:56,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:44:56,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:44:56,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:44:56,475 INFO L87 Difference]: Start difference. First operand 111 states and 168 transitions. Second operand 3 states. [2019-11-20 03:44:56,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:44:56,692 INFO L93 Difference]: Finished difference Result 231 states and 353 transitions. [2019-11-20 03:44:56,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:44:56,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-20 03:44:56,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:44:56,695 INFO L225 Difference]: With dead ends: 231 [2019-11-20 03:44:56,695 INFO L226 Difference]: Without dead ends: 129 [2019-11-20 03:44:56,697 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:44:56,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-20 03:44:56,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2019-11-20 03:44:56,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-20 03:44:56,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2019-11-20 03:44:56,728 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 35 [2019-11-20 03:44:56,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:44:56,729 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2019-11-20 03:44:56,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:44:56,729 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2019-11-20 03:44:56,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-20 03:44:56,732 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:44:56,733 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] [2019-11-20 03:44:56,733 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:44:56,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:44:56,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1382730084, now seen corresponding path program 1 times [2019-11-20 03:44:56,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:44:56,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862157049] [2019-11-20 03:44:56,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:44:56,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:44:56,827 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 03:44:56,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862157049] [2019-11-20 03:44:56,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:44:56,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:44:56,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108646651] [2019-11-20 03:44:56,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:44:56,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:44:56,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:44:56,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:44:56,834 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand 3 states. [2019-11-20 03:44:57,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:44:57,033 INFO L93 Difference]: Finished difference Result 265 states and 401 transitions. [2019-11-20 03:44:57,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:44:57,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-20 03:44:57,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:44:57,038 INFO L225 Difference]: With dead ends: 265 [2019-11-20 03:44:57,038 INFO L226 Difference]: Without dead ends: 148 [2019-11-20 03:44:57,039 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:44:57,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-11-20 03:44:57,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 143. [2019-11-20 03:44:57,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-20 03:44:57,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 210 transitions. [2019-11-20 03:44:57,065 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 210 transitions. Word has length 49 [2019-11-20 03:44:57,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:44:57,074 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 210 transitions. [2019-11-20 03:44:57,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:44:57,075 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 210 transitions. [2019-11-20 03:44:57,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-20 03:44:57,078 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:44:57,078 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] [2019-11-20 03:44:57,078 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:44:57,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:44:57,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1259053610, now seen corresponding path program 1 times [2019-11-20 03:44:57,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:44:57,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304619626] [2019-11-20 03:44:57,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:44:57,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:44:57,181 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 03:44:57,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304619626] [2019-11-20 03:44:57,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:44:57,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:44:57,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794759305] [2019-11-20 03:44:57,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:44:57,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:44:57,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:44:57,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:44:57,183 INFO L87 Difference]: Start difference. First operand 143 states and 210 transitions. Second operand 3 states. [2019-11-20 03:44:57,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:44:57,455 INFO L93 Difference]: Finished difference Result 327 states and 495 transitions. [2019-11-20 03:44:57,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:44:57,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-20 03:44:57,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:44:57,458 INFO L225 Difference]: With dead ends: 327 [2019-11-20 03:44:57,458 INFO L226 Difference]: Without dead ends: 192 [2019-11-20 03:44:57,460 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:44:57,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-20 03:44:57,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 184. [2019-11-20 03:44:57,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-11-20 03:44:57,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 260 transitions. [2019-11-20 03:44:57,475 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 260 transitions. Word has length 66 [2019-11-20 03:44:57,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:44:57,476 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 260 transitions. [2019-11-20 03:44:57,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:44:57,477 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 260 transitions. [2019-11-20 03:44:57,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-20 03:44:57,479 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:44:57,479 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] [2019-11-20 03:44:57,479 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:44:57,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:44:57,480 INFO L82 PathProgramCache]: Analyzing trace with hash -546384724, now seen corresponding path program 1 times [2019-11-20 03:44:57,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:44:57,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945306234] [2019-11-20 03:44:57,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:44:57,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:44:57,568 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 03:44:57,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945306234] [2019-11-20 03:44:57,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:44:57,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:44:57,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952730134] [2019-11-20 03:44:57,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:44:57,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:44:57,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:44:57,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:44:57,573 INFO L87 Difference]: Start difference. First operand 184 states and 260 transitions. Second operand 3 states. [2019-11-20 03:44:57,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:44:57,743 INFO L93 Difference]: Finished difference Result 382 states and 547 transitions. [2019-11-20 03:44:57,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:44:57,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-20 03:44:57,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:44:57,746 INFO L225 Difference]: With dead ends: 382 [2019-11-20 03:44:57,746 INFO L226 Difference]: Without dead ends: 207 [2019-11-20 03:44:57,747 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:44:57,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-11-20 03:44:57,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 203. [2019-11-20 03:44:57,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-11-20 03:44:57,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 284 transitions. [2019-11-20 03:44:57,771 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 284 transitions. Word has length 66 [2019-11-20 03:44:57,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:44:57,772 INFO L462 AbstractCegarLoop]: Abstraction has 203 states and 284 transitions. [2019-11-20 03:44:57,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:44:57,772 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 284 transitions. [2019-11-20 03:44:57,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-20 03:44:57,775 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:44:57,775 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] [2019-11-20 03:44:57,775 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:44:57,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:44:57,776 INFO L82 PathProgramCache]: Analyzing trace with hash 819829122, now seen corresponding path program 1 times [2019-11-20 03:44:57,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:44:57,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743486707] [2019-11-20 03:44:57,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:44:57,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:44:57,876 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-20 03:44:57,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743486707] [2019-11-20 03:44:57,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:44:57,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:44:57,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369192148] [2019-11-20 03:44:57,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:44:57,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:44:57,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:44:57,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:44:57,881 INFO L87 Difference]: Start difference. First operand 203 states and 284 transitions. Second operand 3 states. [2019-11-20 03:44:58,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:44:58,081 INFO L93 Difference]: Finished difference Result 421 states and 597 transitions. [2019-11-20 03:44:58,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:44:58,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-11-20 03:44:58,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:44:58,083 INFO L225 Difference]: With dead ends: 421 [2019-11-20 03:44:58,084 INFO L226 Difference]: Without dead ends: 227 [2019-11-20 03:44:58,084 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:44:58,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-11-20 03:44:58,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2019-11-20 03:44:58,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-11-20 03:44:58,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 310 transitions. [2019-11-20 03:44:58,096 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 310 transitions. Word has length 82 [2019-11-20 03:44:58,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:44:58,097 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 310 transitions. [2019-11-20 03:44:58,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:44:58,097 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 310 transitions. [2019-11-20 03:44:58,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-20 03:44:58,100 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:44:58,100 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] [2019-11-20 03:44:58,100 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:44:58,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:44:58,101 INFO L82 PathProgramCache]: Analyzing trace with hash 426015802, now seen corresponding path program 1 times [2019-11-20 03:44:58,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:44:58,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967785547] [2019-11-20 03:44:58,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:44:58,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:44:58,182 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-20 03:44:58,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967785547] [2019-11-20 03:44:58,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:44:58,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:44:58,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868807490] [2019-11-20 03:44:58,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:44:58,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:44:58,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:44:58,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:44:58,193 INFO L87 Difference]: Start difference. First operand 224 states and 310 transitions. Second operand 3 states. [2019-11-20 03:44:58,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:44:58,243 INFO L93 Difference]: Finished difference Result 652 states and 903 transitions. [2019-11-20 03:44:58,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:44:58,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-11-20 03:44:58,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:44:58,251 INFO L225 Difference]: With dead ends: 652 [2019-11-20 03:44:58,252 INFO L226 Difference]: Without dead ends: 437 [2019-11-20 03:44:58,252 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:44:58,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-11-20 03:44:58,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2019-11-20 03:44:58,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2019-11-20 03:44:58,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 603 transitions. [2019-11-20 03:44:58,286 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 603 transitions. Word has length 102 [2019-11-20 03:44:58,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:44:58,289 INFO L462 AbstractCegarLoop]: Abstraction has 437 states and 603 transitions. [2019-11-20 03:44:58,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:44:58,289 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 603 transitions. [2019-11-20 03:44:58,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-20 03:44:58,293 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:44:58,294 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-20 03:44:58,294 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:44:58,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:44:58,295 INFO L82 PathProgramCache]: Analyzing trace with hash -527041180, now seen corresponding path program 1 times [2019-11-20 03:44:58,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:44:58,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265041571] [2019-11-20 03:44:58,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:44:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:44:58,415 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-20 03:44:58,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265041571] [2019-11-20 03:44:58,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:44:58,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:44:58,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429509425] [2019-11-20 03:44:58,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:44:58,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:44:58,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:44:58,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:44:58,418 INFO L87 Difference]: Start difference. First operand 437 states and 603 transitions. Second operand 3 states. [2019-11-20 03:44:58,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:44:58,473 INFO L93 Difference]: Finished difference Result 652 states and 900 transitions. [2019-11-20 03:44:58,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:44:58,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-20 03:44:58,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:44:58,479 INFO L225 Difference]: With dead ends: 652 [2019-11-20 03:44:58,479 INFO L226 Difference]: Without dead ends: 650 [2019-11-20 03:44:58,480 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:44:58,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-11-20 03:44:58,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2019-11-20 03:44:58,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-11-20 03:44:58,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 898 transitions. [2019-11-20 03:44:58,505 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 898 transitions. Word has length 104 [2019-11-20 03:44:58,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:44:58,507 INFO L462 AbstractCegarLoop]: Abstraction has 650 states and 898 transitions. [2019-11-20 03:44:58,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:44:58,508 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 898 transitions. [2019-11-20 03:44:58,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-20 03:44:58,510 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:44:58,511 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:44:58,511 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:44:58,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:44:58,511 INFO L82 PathProgramCache]: Analyzing trace with hash -892474837, now seen corresponding path program 1 times [2019-11-20 03:44:58,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:44:58,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107563922] [2019-11-20 03:44:58,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:44:58,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:44:58,609 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-20 03:44:58,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107563922] [2019-11-20 03:44:58,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:44:58,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:44:58,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571554995] [2019-11-20 03:44:58,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:44:58,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:44:58,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:44:58,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:44:58,611 INFO L87 Difference]: Start difference. First operand 650 states and 898 transitions. Second operand 3 states. [2019-11-20 03:44:58,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:44:58,817 INFO L93 Difference]: Finished difference Result 1441 states and 2047 transitions. [2019-11-20 03:44:58,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:44:58,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-20 03:44:58,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:44:58,824 INFO L225 Difference]: With dead ends: 1441 [2019-11-20 03:44:58,824 INFO L226 Difference]: Without dead ends: 797 [2019-11-20 03:44:58,826 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:44:58,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2019-11-20 03:44:58,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 767. [2019-11-20 03:44:58,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2019-11-20 03:44:58,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1087 transitions. [2019-11-20 03:44:58,859 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1087 transitions. Word has length 158 [2019-11-20 03:44:58,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:44:58,860 INFO L462 AbstractCegarLoop]: Abstraction has 767 states and 1087 transitions. [2019-11-20 03:44:58,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:44:58,860 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1087 transitions. [2019-11-20 03:44:58,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-20 03:44:58,864 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:44:58,864 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:44:58,864 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:44:58,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:44:58,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1787424402, now seen corresponding path program 1 times [2019-11-20 03:44:58,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:44:58,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832702085] [2019-11-20 03:44:58,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:44:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:44:58,941 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-11-20 03:44:58,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832702085] [2019-11-20 03:44:58,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:44:58,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:44:58,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52153120] [2019-11-20 03:44:58,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:44:58,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:44:58,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:44:58,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:44:58,949 INFO L87 Difference]: Start difference. First operand 767 states and 1087 transitions. Second operand 3 states. [2019-11-20 03:44:59,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:44:59,164 INFO L93 Difference]: Finished difference Result 1803 states and 2628 transitions. [2019-11-20 03:44:59,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:44:59,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-11-20 03:44:59,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:44:59,171 INFO L225 Difference]: With dead ends: 1803 [2019-11-20 03:44:59,171 INFO L226 Difference]: Without dead ends: 994 [2019-11-20 03:44:59,173 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:44:59,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2019-11-20 03:44:59,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 956. [2019-11-20 03:44:59,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 956 states. [2019-11-20 03:44:59,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1339 transitions. [2019-11-20 03:44:59,205 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1339 transitions. Word has length 184 [2019-11-20 03:44:59,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:44:59,206 INFO L462 AbstractCegarLoop]: Abstraction has 956 states and 1339 transitions. [2019-11-20 03:44:59,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:44:59,206 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1339 transitions. [2019-11-20 03:44:59,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-11-20 03:44:59,210 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:44:59,210 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:44:59,211 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:44:59,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:44:59,211 INFO L82 PathProgramCache]: Analyzing trace with hash 78119093, now seen corresponding path program 1 times [2019-11-20 03:44:59,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:44:59,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804992210] [2019-11-20 03:44:59,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:44:59,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:44:59,297 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 402 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-11-20 03:44:59,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804992210] [2019-11-20 03:44:59,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:44:59,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:44:59,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932910569] [2019-11-20 03:44:59,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:44:59,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:44:59,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:44:59,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:44:59,300 INFO L87 Difference]: Start difference. First operand 956 states and 1339 transitions. Second operand 3 states. [2019-11-20 03:44:59,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:44:59,504 INFO L93 Difference]: Finished difference Result 2059 states and 2905 transitions. [2019-11-20 03:44:59,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:44:59,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-11-20 03:44:59,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:44:59,512 INFO L225 Difference]: With dead ends: 2059 [2019-11-20 03:44:59,512 INFO L226 Difference]: Without dead ends: 1067 [2019-11-20 03:44:59,514 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:44:59,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2019-11-20 03:44:59,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1031. [2019-11-20 03:44:59,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031 states. [2019-11-20 03:44:59,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1435 transitions. [2019-11-20 03:44:59,550 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1435 transitions. Word has length 205 [2019-11-20 03:44:59,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:44:59,551 INFO L462 AbstractCegarLoop]: Abstraction has 1031 states and 1435 transitions. [2019-11-20 03:44:59,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:44:59,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1435 transitions. [2019-11-20 03:44:59,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-11-20 03:44:59,556 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:44:59,556 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:44:59,557 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:44:59,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:44:59,557 INFO L82 PathProgramCache]: Analyzing trace with hash 2106820770, now seen corresponding path program 1 times [2019-11-20 03:44:59,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:44:59,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38881971] [2019-11-20 03:44:59,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:44:59,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:44:59,650 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 477 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-11-20 03:44:59,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38881971] [2019-11-20 03:44:59,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:44:59,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:44:59,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64663224] [2019-11-20 03:44:59,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:44:59,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:44:59,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:44:59,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:44:59,652 INFO L87 Difference]: Start difference. First operand 1031 states and 1435 transitions. Second operand 3 states. [2019-11-20 03:44:59,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:44:59,873 INFO L93 Difference]: Finished difference Result 2209 states and 3094 transitions. [2019-11-20 03:44:59,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:44:59,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-11-20 03:44:59,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:44:59,881 INFO L225 Difference]: With dead ends: 2209 [2019-11-20 03:44:59,881 INFO L226 Difference]: Without dead ends: 1148 [2019-11-20 03:44:59,883 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:44:59,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2019-11-20 03:44:59,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1115. [2019-11-20 03:44:59,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1115 states. [2019-11-20 03:44:59,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1546 transitions. [2019-11-20 03:44:59,919 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1546 transitions. Word has length 229 [2019-11-20 03:44:59,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:44:59,920 INFO L462 AbstractCegarLoop]: Abstraction has 1115 states and 1546 transitions. [2019-11-20 03:44:59,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:44:59,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1546 transitions. [2019-11-20 03:44:59,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-11-20 03:44:59,925 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:44:59,926 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:44:59,926 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:44:59,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:44:59,926 INFO L82 PathProgramCache]: Analyzing trace with hash 73426724, now seen corresponding path program 1 times [2019-11-20 03:44:59,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:44:59,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779933428] [2019-11-20 03:44:59,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:44:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:45:00,019 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 477 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-11-20 03:45:00,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779933428] [2019-11-20 03:45:00,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:45:00,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:45:00,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897916602] [2019-11-20 03:45:00,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:45:00,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:45:00,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:45:00,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:45:00,022 INFO L87 Difference]: Start difference. First operand 1115 states and 1546 transitions. Second operand 3 states. [2019-11-20 03:45:00,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:45:00,251 INFO L93 Difference]: Finished difference Result 2377 states and 3319 transitions. [2019-11-20 03:45:00,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:45:00,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-11-20 03:45:00,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:45:00,261 INFO L225 Difference]: With dead ends: 2377 [2019-11-20 03:45:00,261 INFO L226 Difference]: Without dead ends: 1244 [2019-11-20 03:45:00,263 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:45:00,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2019-11-20 03:45:00,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1208. [2019-11-20 03:45:00,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1208 states. [2019-11-20 03:45:00,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1678 transitions. [2019-11-20 03:45:00,317 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1678 transitions. Word has length 229 [2019-11-20 03:45:00,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:45:00,318 INFO L462 AbstractCegarLoop]: Abstraction has 1208 states and 1678 transitions. [2019-11-20 03:45:00,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:45:00,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1678 transitions. [2019-11-20 03:45:00,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-11-20 03:45:00,341 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:45:00,341 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:45:00,341 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:45:00,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:45:00,342 INFO L82 PathProgramCache]: Analyzing trace with hash 837799332, now seen corresponding path program 1 times [2019-11-20 03:45:00,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:45:00,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066985221] [2019-11-20 03:45:00,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:45:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:45:00,453 INFO L134 CoverageAnalysis]: Checked inductivity of 973 backedges. 552 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2019-11-20 03:45:00,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066985221] [2019-11-20 03:45:00,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:45:00,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:45:00,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707693175] [2019-11-20 03:45:00,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:45:00,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:45:00,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:45:00,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:45:00,456 INFO L87 Difference]: Start difference. First operand 1208 states and 1678 transitions. Second operand 3 states. [2019-11-20 03:45:00,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:45:00,677 INFO L93 Difference]: Finished difference Result 2560 states and 3577 transitions. [2019-11-20 03:45:00,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:45:00,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 259 [2019-11-20 03:45:00,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:45:00,687 INFO L225 Difference]: With dead ends: 2560 [2019-11-20 03:45:00,687 INFO L226 Difference]: Without dead ends: 1346 [2019-11-20 03:45:00,690 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:45:00,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2019-11-20 03:45:00,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1313. [2019-11-20 03:45:00,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1313 states. [2019-11-20 03:45:00,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 1834 transitions. [2019-11-20 03:45:00,733 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 1834 transitions. Word has length 259 [2019-11-20 03:45:00,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:45:00,733 INFO L462 AbstractCegarLoop]: Abstraction has 1313 states and 1834 transitions. [2019-11-20 03:45:00,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:45:00,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1834 transitions. [2019-11-20 03:45:00,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-11-20 03:45:00,740 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:45:00,741 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:45:00,741 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:45:00,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:45:00,742 INFO L82 PathProgramCache]: Analyzing trace with hash 298818312, now seen corresponding path program 1 times [2019-11-20 03:45:00,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:45:00,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975437056] [2019-11-20 03:45:00,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:45:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:45:00,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1167 backedges. 627 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2019-11-20 03:45:00,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975437056] [2019-11-20 03:45:00,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:45:00,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:45:00,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259221678] [2019-11-20 03:45:00,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:45:00,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:45:00,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:45:00,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:45:00,866 INFO L87 Difference]: Start difference. First operand 1313 states and 1834 transitions. Second operand 3 states. [2019-11-20 03:45:01,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:45:01,088 INFO L93 Difference]: Finished difference Result 2656 states and 3703 transitions. [2019-11-20 03:45:01,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:45:01,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 294 [2019-11-20 03:45:01,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:45:01,097 INFO L225 Difference]: With dead ends: 2656 [2019-11-20 03:45:01,097 INFO L226 Difference]: Without dead ends: 1343 [2019-11-20 03:45:01,101 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:45:01,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2019-11-20 03:45:01,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1310. [2019-11-20 03:45:01,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1310 states. [2019-11-20 03:45:01,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1816 transitions. [2019-11-20 03:45:01,145 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1816 transitions. Word has length 294 [2019-11-20 03:45:01,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:45:01,146 INFO L462 AbstractCegarLoop]: Abstraction has 1310 states and 1816 transitions. [2019-11-20 03:45:01,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:45:01,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1816 transitions. [2019-11-20 03:45:01,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-11-20 03:45:01,153 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:45:01,154 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:45:01,154 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:45:01,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:45:01,155 INFO L82 PathProgramCache]: Analyzing trace with hash 430194802, now seen corresponding path program 1 times [2019-11-20 03:45:01,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:45:01,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179445649] [2019-11-20 03:45:01,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:45:01,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:45:01,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1174 backedges. 561 proven. 0 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-11-20 03:45:01,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179445649] [2019-11-20 03:45:01,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:45:01,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:45:01,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724305738] [2019-11-20 03:45:01,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:45:01,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:45:01,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:45:01,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:45:01,316 INFO L87 Difference]: Start difference. First operand 1310 states and 1816 transitions. Second operand 3 states. [2019-11-20 03:45:01,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:45:01,504 INFO L93 Difference]: Finished difference Result 2638 states and 3652 transitions. [2019-11-20 03:45:01,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:45:01,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 304 [2019-11-20 03:45:01,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:45:01,515 INFO L225 Difference]: With dead ends: 2638 [2019-11-20 03:45:01,515 INFO L226 Difference]: Without dead ends: 1337 [2019-11-20 03:45:01,517 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:45:01,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1337 states. [2019-11-20 03:45:01,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1337 to 1310. [2019-11-20 03:45:01,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1310 states. [2019-11-20 03:45:01,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1789 transitions. [2019-11-20 03:45:01,562 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1789 transitions. Word has length 304 [2019-11-20 03:45:01,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:45:01,563 INFO L462 AbstractCegarLoop]: Abstraction has 1310 states and 1789 transitions. [2019-11-20 03:45:01,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:45:01,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1789 transitions. [2019-11-20 03:45:01,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-11-20 03:45:01,570 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:45:01,571 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:45:01,571 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:45:01,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:45:01,571 INFO L82 PathProgramCache]: Analyzing trace with hash 863432469, now seen corresponding path program 1 times [2019-11-20 03:45:01,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:45:01,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679884715] [2019-11-20 03:45:01,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:45:01,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:45:01,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1418 backedges. 729 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-20 03:45:01,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679884715] [2019-11-20 03:45:01,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:45:01,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:45:01,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444968214] [2019-11-20 03:45:01,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:45:01,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:45:01,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:45:01,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:45:01,701 INFO L87 Difference]: Start difference. First operand 1310 states and 1789 transitions. Second operand 3 states. [2019-11-20 03:45:01,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:45:01,917 INFO L93 Difference]: Finished difference Result 2761 states and 3742 transitions. [2019-11-20 03:45:01,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:45:01,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 331 [2019-11-20 03:45:01,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:45:01,928 INFO L225 Difference]: With dead ends: 2761 [2019-11-20 03:45:01,928 INFO L226 Difference]: Without dead ends: 1460 [2019-11-20 03:45:01,931 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:45:01,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2019-11-20 03:45:01,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1355. [2019-11-20 03:45:01,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1355 states. [2019-11-20 03:45:01,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 1849 transitions. [2019-11-20 03:45:01,982 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 1849 transitions. Word has length 331 [2019-11-20 03:45:01,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:45:01,983 INFO L462 AbstractCegarLoop]: Abstraction has 1355 states and 1849 transitions. [2019-11-20 03:45:01,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:45:01,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1849 transitions. [2019-11-20 03:45:01,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-11-20 03:45:01,991 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:45:01,992 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:45:01,992 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:45:01,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:45:01,993 INFO L82 PathProgramCache]: Analyzing trace with hash 762439870, now seen corresponding path program 1 times [2019-11-20 03:45:01,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:45:01,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906975859] [2019-11-20 03:45:01,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:45:02,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:45:02,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1418 backedges. 869 proven. 0 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2019-11-20 03:45:02,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906975859] [2019-11-20 03:45:02,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:45:02,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:45:02,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198898032] [2019-11-20 03:45:02,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:45:02,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:45:02,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:45:02,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:45:02,215 INFO L87 Difference]: Start difference. First operand 1355 states and 1849 transitions. Second operand 3 states. [2019-11-20 03:45:02,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:45:02,259 INFO L93 Difference]: Finished difference Result 3852 states and 5281 transitions. [2019-11-20 03:45:02,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:45:02,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-11-20 03:45:02,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:45:02,274 INFO L225 Difference]: With dead ends: 3852 [2019-11-20 03:45:02,274 INFO L226 Difference]: Without dead ends: 2506 [2019-11-20 03:45:02,276 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:45:02,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2019-11-20 03:45:02,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2504. [2019-11-20 03:45:02,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2504 states. [2019-11-20 03:45:02,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3435 transitions. [2019-11-20 03:45:02,344 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3435 transitions. Word has length 332 [2019-11-20 03:45:02,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:45:02,345 INFO L462 AbstractCegarLoop]: Abstraction has 2504 states and 3435 transitions. [2019-11-20 03:45:02,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:45:02,345 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3435 transitions. [2019-11-20 03:45:02,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-11-20 03:45:02,353 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:45:02,354 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:45:02,354 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:45:02,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:45:02,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1156712834, now seen corresponding path program 1 times [2019-11-20 03:45:02,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:45:02,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254995143] [2019-11-20 03:45:02,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:45:02,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:45:02,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 790 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-11-20 03:45:02,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254995143] [2019-11-20 03:45:02,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021811833] [2019-11-20 03:45:02,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4f551d5-fb28-4fa0-9fd0-ce0f2d9c9301/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:45:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:45:02,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 03:45:02,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:45:03,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 728 proven. 0 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2019-11-20 03:45:03,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 03:45:03,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-20 03:45:03,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587283892] [2019-11-20 03:45:03,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:45:03,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:45:03,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:45:03,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:45:03,030 INFO L87 Difference]: Start difference. First operand 2504 states and 3435 transitions. Second operand 3 states. [2019-11-20 03:45:03,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:45:03,110 INFO L93 Difference]: Finished difference Result 5826 states and 7988 transitions. [2019-11-20 03:45:03,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:45:03,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 342 [2019-11-20 03:45:03,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:45:03,132 INFO L225 Difference]: With dead ends: 5826 [2019-11-20 03:45:03,132 INFO L226 Difference]: Without dead ends: 3331 [2019-11-20 03:45:03,137 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:45:03,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3331 states. [2019-11-20 03:45:03,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3331 to 3331. [2019-11-20 03:45:03,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3331 states. [2019-11-20 03:45:03,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3331 states to 3331 states and 4560 transitions. [2019-11-20 03:45:03,250 INFO L78 Accepts]: Start accepts. Automaton has 3331 states and 4560 transitions. Word has length 342 [2019-11-20 03:45:03,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:45:03,251 INFO L462 AbstractCegarLoop]: Abstraction has 3331 states and 4560 transitions. [2019-11-20 03:45:03,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:45:03,251 INFO L276 IsEmpty]: Start isEmpty. Operand 3331 states and 4560 transitions. [2019-11-20 03:45:03,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-11-20 03:45:03,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:45:03,261 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:45:03,474 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:45:03,474 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:45:03,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:45:03,475 INFO L82 PathProgramCache]: Analyzing trace with hash 938688742, now seen corresponding path program 1 times [2019-11-20 03:45:03,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:45:03,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220975220] [2019-11-20 03:45:03,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:45:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:45:03,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 792 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-11-20 03:45:03,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220975220] [2019-11-20 03:45:03,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731246008] [2019-11-20 03:45:03,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4f551d5-fb28-4fa0-9fd0-ce0f2d9c9301/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:45:03,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:45:03,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 03:45:03,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:45:04,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 792 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-11-20 03:45:04,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:45:04,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 03:45:04,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933426230] [2019-11-20 03:45:04,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:45:04,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:45:04,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:45:04,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:45:04,010 INFO L87 Difference]: Start difference. First operand 3331 states and 4560 transitions. Second operand 4 states. [2019-11-20 03:45:04,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:45:04,459 INFO L93 Difference]: Finished difference Result 6603 states and 9028 transitions. [2019-11-20 03:45:04,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 03:45:04,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 344 [2019-11-20 03:45:04,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:45:04,490 INFO L225 Difference]: With dead ends: 6603 [2019-11-20 03:45:04,490 INFO L226 Difference]: Without dead ends: 4983 [2019-11-20 03:45:04,493 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:45:04,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4983 states. [2019-11-20 03:45:04,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4983 to 3683. [2019-11-20 03:45:04,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3683 states. [2019-11-20 03:45:04,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3683 states to 3683 states and 4980 transitions. [2019-11-20 03:45:04,640 INFO L78 Accepts]: Start accepts. Automaton has 3683 states and 4980 transitions. Word has length 344 [2019-11-20 03:45:04,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:45:04,641 INFO L462 AbstractCegarLoop]: Abstraction has 3683 states and 4980 transitions. [2019-11-20 03:45:04,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:45:04,641 INFO L276 IsEmpty]: Start isEmpty. Operand 3683 states and 4980 transitions. [2019-11-20 03:45:04,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-11-20 03:45:04,652 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:45:04,653 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] [2019-11-20 03:45:04,856 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:45:04,856 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:45:04,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:45:04,857 INFO L82 PathProgramCache]: Analyzing trace with hash 741254605, now seen corresponding path program 1 times [2019-11-20 03:45:04,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:45:04,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526674353] [2019-11-20 03:45:04,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:45:04,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:45:05,044 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-20 03:45:05,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526674353] [2019-11-20 03:45:05,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635715497] [2019-11-20 03:45:05,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4f551d5-fb28-4fa0-9fd0-ce0f2d9c9301/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:45:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:45:05,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 03:45:05,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:45:05,366 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-20 03:45:05,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:45:05,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 03:45:05,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258935183] [2019-11-20 03:45:05,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:45:05,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:45:05,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:45:05,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:45:05,370 INFO L87 Difference]: Start difference. First operand 3683 states and 4980 transitions. Second operand 4 states. [2019-11-20 03:45:05,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:45:05,783 INFO L93 Difference]: Finished difference Result 8481 states and 11469 transitions. [2019-11-20 03:45:05,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:45:05,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 370 [2019-11-20 03:45:05,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:45:05,826 INFO L225 Difference]: With dead ends: 8481 [2019-11-20 03:45:05,826 INFO L226 Difference]: Without dead ends: 4798 [2019-11-20 03:45:05,832 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:45:05,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4798 states. [2019-11-20 03:45:05,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4798 to 3841. [2019-11-20 03:45:05,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3841 states. [2019-11-20 03:45:05,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3841 states to 3841 states and 5140 transitions. [2019-11-20 03:45:05,972 INFO L78 Accepts]: Start accepts. Automaton has 3841 states and 5140 transitions. Word has length 370 [2019-11-20 03:45:05,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:45:05,973 INFO L462 AbstractCegarLoop]: Abstraction has 3841 states and 5140 transitions. [2019-11-20 03:45:05,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:45:05,973 INFO L276 IsEmpty]: Start isEmpty. Operand 3841 states and 5140 transitions. [2019-11-20 03:45:05,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-11-20 03:45:05,985 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:45:05,986 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] [2019-11-20 03:45:06,189 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:45:06,190 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:45:06,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:45:06,190 INFO L82 PathProgramCache]: Analyzing trace with hash 232077189, now seen corresponding path program 1 times [2019-11-20 03:45:06,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:45:06,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678040837] [2019-11-20 03:45:06,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:45:06,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:45:06,389 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-20 03:45:06,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678040837] [2019-11-20 03:45:06,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:45:06,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:45:06,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605288834] [2019-11-20 03:45:06,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:45:06,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:45:06,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:45:06,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:45:06,394 INFO L87 Difference]: Start difference. First operand 3841 states and 5140 transitions. Second operand 3 states. [2019-11-20 03:45:06,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:45:06,601 INFO L93 Difference]: Finished difference Result 7373 states and 9714 transitions. [2019-11-20 03:45:06,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:45:06,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 409 [2019-11-20 03:45:06,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:45:06,608 INFO L225 Difference]: With dead ends: 7373 [2019-11-20 03:45:06,608 INFO L226 Difference]: Without dead ends: 1985 [2019-11-20 03:45:06,615 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:45:06,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2019-11-20 03:45:06,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1893. [2019-11-20 03:45:06,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1893 states. [2019-11-20 03:45:06,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 2533 transitions. [2019-11-20 03:45:06,666 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 2533 transitions. Word has length 409 [2019-11-20 03:45:06,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:45:06,666 INFO L462 AbstractCegarLoop]: Abstraction has 1893 states and 2533 transitions. [2019-11-20 03:45:06,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:45:06,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2533 transitions. [2019-11-20 03:45:06,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2019-11-20 03:45:06,678 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:45:06,679 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:45:06,679 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:45:06,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:45:06,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1256651121, now seen corresponding path program 1 times [2019-11-20 03:45:06,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:45:06,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542848215] [2019-11-20 03:45:06,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:45:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:45:07,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2606 backedges. 1545 proven. 14 refuted. 0 times theorem prover too weak. 1047 trivial. 0 not checked. [2019-11-20 03:45:07,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542848215] [2019-11-20 03:45:07,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577063550] [2019-11-20 03:45:07,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4f551d5-fb28-4fa0-9fd0-ce0f2d9c9301/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:45:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:45:07,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 03:45:07,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:45:07,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2606 backedges. 268 proven. 0 refuted. 0 times theorem prover too weak. 2338 trivial. 0 not checked. [2019-11-20 03:45:07,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 03:45:07,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-20 03:45:07,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883323704] [2019-11-20 03:45:07,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:45:07,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:45:07,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:45:07,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:45:07,378 INFO L87 Difference]: Start difference. First operand 1893 states and 2533 transitions. Second operand 3 states. [2019-11-20 03:45:07,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:45:07,576 INFO L93 Difference]: Finished difference Result 3956 states and 5317 transitions. [2019-11-20 03:45:07,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:45:07,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 493 [2019-11-20 03:45:07,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:45:07,582 INFO L225 Difference]: With dead ends: 3956 [2019-11-20 03:45:07,582 INFO L226 Difference]: Without dead ends: 1991 [2019-11-20 03:45:07,585 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:45:07,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2019-11-20 03:45:07,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1987. [2019-11-20 03:45:07,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1987 states. [2019-11-20 03:45:07,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1987 states and 2576 transitions. [2019-11-20 03:45:07,639 INFO L78 Accepts]: Start accepts. Automaton has 1987 states and 2576 transitions. Word has length 493 [2019-11-20 03:45:07,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:45:07,640 INFO L462 AbstractCegarLoop]: Abstraction has 1987 states and 2576 transitions. [2019-11-20 03:45:07,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:45:07,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 2576 transitions. [2019-11-20 03:45:07,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2019-11-20 03:45:07,646 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:45:07,647 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:45:07,852 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:45:07,853 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:45:07,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:45:07,853 INFO L82 PathProgramCache]: Analyzing trace with hash 709390269, now seen corresponding path program 1 times [2019-11-20 03:45:07,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:45:07,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645480334] [2019-11-20 03:45:07,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:45:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:45:08,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1570 proven. 14 refuted. 0 times theorem prover too weak. 1127 trivial. 0 not checked. [2019-11-20 03:45:08,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645480334] [2019-11-20 03:45:08,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380811867] [2019-11-20 03:45:08,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4f551d5-fb28-4fa0-9fd0-ce0f2d9c9301/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-20 03:45:08,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:45:08,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 03:45:08,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:45:08,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1019 proven. 0 refuted. 0 times theorem prover too weak. 1692 trivial. 0 not checked. [2019-11-20 03:45:08,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 03:45:08,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-20 03:45:08,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515057249] [2019-11-20 03:45:08,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:45:08,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:45:08,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:45:08,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:45:08,626 INFO L87 Difference]: Start difference. First operand 1987 states and 2576 transitions. Second operand 3 states. [2019-11-20 03:45:08,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:45:08,654 INFO L93 Difference]: Finished difference Result 2038 states and 2641 transitions. [2019-11-20 03:45:08,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:45:08,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 493 [2019-11-20 03:45:08,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:45:08,659 INFO L225 Difference]: With dead ends: 2038 [2019-11-20 03:45:08,659 INFO L226 Difference]: Without dead ends: 1835 [2019-11-20 03:45:08,660 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:45:08,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2019-11-20 03:45:08,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1786. [2019-11-20 03:45:08,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1786 states. [2019-11-20 03:45:08,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 2314 transitions. [2019-11-20 03:45:08,703 INFO L78 Accepts]: Start accepts. Automaton has 1786 states and 2314 transitions. Word has length 493 [2019-11-20 03:45:08,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:45:08,704 INFO L462 AbstractCegarLoop]: Abstraction has 1786 states and 2314 transitions. [2019-11-20 03:45:08,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:45:08,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 2314 transitions. [2019-11-20 03:45:08,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2019-11-20 03:45:08,711 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:45:08,712 INFO L410 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:45:08,915 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:45:08,916 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:45:08,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:45:08,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1730430293, now seen corresponding path program 2 times [2019-11-20 03:45:08,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:45:08,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002027494] [2019-11-20 03:45:08,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:45:08,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:45:09,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3925 backedges. 2052 proven. 14 refuted. 0 times theorem prover too weak. 1859 trivial. 0 not checked. [2019-11-20 03:45:09,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002027494] [2019-11-20 03:45:09,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154205654] [2019-11-20 03:45:09,359 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4f551d5-fb28-4fa0-9fd0-ce0f2d9c9301/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:45:09,532 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 03:45:09,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 03:45:09,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 882 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 03:45:09,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:45:09,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3925 backedges. 2052 proven. 14 refuted. 0 times theorem prover too weak. 1859 trivial. 0 not checked. [2019-11-20 03:45:09,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:45:09,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 03:45:09,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608061404] [2019-11-20 03:45:09,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:45:09,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:45:09,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:45:09,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:45:09,784 INFO L87 Difference]: Start difference. First operand 1786 states and 2314 transitions. Second operand 4 states. [2019-11-20 03:45:09,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:45:09,965 INFO L93 Difference]: Finished difference Result 2046 states and 2645 transitions. [2019-11-20 03:45:09,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:45:09,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 603 [2019-11-20 03:45:09,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:45:09,967 INFO L225 Difference]: With dead ends: 2046 [2019-11-20 03:45:09,967 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 03:45:09,969 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 605 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:45:09,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 03:45:09,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 03:45:09,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 03:45:09,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 03:45:09,970 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 603 [2019-11-20 03:45:09,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:45:09,971 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 03:45:09,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:45:09,971 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 03:45:09,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 03:45:10,176 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:45:10,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 03:45:10,731 WARN L191 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 103 [2019-11-20 03:45:10,962 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 30 [2019-11-20 03:45:11,157 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 24 [2019-11-20 03:45:11,494 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 27 [2019-11-20 03:45:11,602 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2019-11-20 03:45:11,854 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 7 [2019-11-20 03:45:11,985 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2019-11-20 03:45:12,907 WARN L191 SmtUtils]: Spent 830.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 62 [2019-11-20 03:45:13,027 INFO L444 ceAbstractionStarter]: For program point L366(lines 366 370) no Hoare annotation was computed. [2019-11-20 03:45:13,027 INFO L444 ceAbstractionStarter]: For program point L366-2(lines 366 370) no Hoare annotation was computed. [2019-11-20 03:45:13,027 INFO L444 ceAbstractionStarter]: For program point L565(lines 565 593) no Hoare annotation was computed. [2019-11-20 03:45:13,027 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 540) no Hoare annotation was computed. [2019-11-20 03:45:13,027 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 551) no Hoare annotation was computed. [2019-11-20 03:45:13,027 INFO L444 ceAbstractionStarter]: For program point L103(lines 103 562) no Hoare annotation was computed. [2019-11-20 03:45:13,027 INFO L444 ceAbstractionStarter]: For program point L566(lines 566 590) no Hoare annotation was computed. [2019-11-20 03:45:13,027 INFO L444 ceAbstractionStarter]: For program point L500-1(lines 198 528) no Hoare annotation was computed. [2019-11-20 03:45:13,027 INFO L444 ceAbstractionStarter]: For program point L335(lines 335 340) no Hoare annotation was computed. [2019-11-20 03:45:13,028 INFO L444 ceAbstractionStarter]: For program point L302-1(lines 302 316) no Hoare annotation was computed. [2019-11-20 03:45:13,028 INFO L440 ceAbstractionStarter]: At program point L203(lines 100 563) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) [2019-11-20 03:45:13,028 INFO L440 ceAbstractionStarter]: At program point L170(lines 166 541) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512)) (.cse1 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse3 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse3) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse2 .cse3) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 .cse2 .cse3))) [2019-11-20 03:45:13,028 INFO L444 ceAbstractionStarter]: For program point L600(lines 600 604) no Hoare annotation was computed. [2019-11-20 03:45:13,028 INFO L444 ceAbstractionStarter]: For program point L567(lines 567 576) no Hoare annotation was computed. [2019-11-20 03:45:13,028 INFO L444 ceAbstractionStarter]: For program point L600-2(lines 600 604) no Hoare annotation was computed. [2019-11-20 03:45:13,028 INFO L444 ceAbstractionStarter]: For program point L567-2(lines 566 588) no Hoare annotation was computed. [2019-11-20 03:45:13,028 INFO L444 ceAbstractionStarter]: For program point L270(lines 270 274) no Hoare annotation was computed. [2019-11-20 03:45:13,029 INFO L444 ceAbstractionStarter]: For program point L172(lines 172 539) no Hoare annotation was computed. [2019-11-20 03:45:13,029 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 550) no Hoare annotation was computed. [2019-11-20 03:45:13,029 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 561) no Hoare annotation was computed. [2019-11-20 03:45:13,029 INFO L444 ceAbstractionStarter]: For program point L569(lines 569 573) no Hoare annotation was computed. [2019-11-20 03:45:13,029 INFO L444 ceAbstractionStarter]: For program point L437(lines 437 442) no Hoare annotation was computed. [2019-11-20 03:45:13,029 INFO L440 ceAbstractionStarter]: At program point L140(lines 136 551) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4448)) (.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse2 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse0 .cse1 .cse2))) [2019-11-20 03:45:13,029 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 82) no Hoare annotation was computed. [2019-11-20 03:45:13,029 INFO L444 ceAbstractionStarter]: For program point L471(lines 471 475) no Hoare annotation was computed. [2019-11-20 03:45:13,029 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 310) no Hoare annotation was computed. [2019-11-20 03:45:13,029 INFO L444 ceAbstractionStarter]: For program point L306-2(lines 304 316) no Hoare annotation was computed. [2019-11-20 03:45:13,030 INFO L444 ceAbstractionStarter]: For program point L505-1(lines 505 509) no Hoare annotation was computed. [2019-11-20 03:45:13,030 INFO L444 ceAbstractionStarter]: For program point L406(lines 406 410) no Hoare annotation was computed. [2019-11-20 03:45:13,030 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 212) no Hoare annotation was computed. [2019-11-20 03:45:13,030 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 538) no Hoare annotation was computed. [2019-11-20 03:45:13,030 INFO L444 ceAbstractionStarter]: For program point L142(lines 142 549) no Hoare annotation was computed. [2019-11-20 03:45:13,030 INFO L444 ceAbstractionStarter]: For program point L208-2(lines 198 528) no Hoare annotation was computed. [2019-11-20 03:45:13,030 INFO L444 ceAbstractionStarter]: For program point L109(lines 109 560) no Hoare annotation was computed. [2019-11-20 03:45:13,030 INFO L440 ceAbstractionStarter]: At program point L176(lines 172 539) the Hoare annotation is: (let ((.cse5 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse3 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse4 (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse1 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 .cse2 .cse3) (and .cse4 (and .cse0 .cse5)) (and .cse0 .cse5 .cse2 .cse3) (and .cse4 .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)))) [2019-11-20 03:45:13,030 INFO L444 ceAbstractionStarter]: For program point L77(lines 77 81) no Hoare annotation was computed. [2019-11-20 03:45:13,030 INFO L444 ceAbstractionStarter]: For program point L77-2(lines 74 82) no Hoare annotation was computed. [2019-11-20 03:45:13,031 INFO L447 ceAbstractionStarter]: At program point L607(lines 7 609) the Hoare annotation is: true [2019-11-20 03:45:13,031 INFO L444 ceAbstractionStarter]: For program point L244(lines 244 249) no Hoare annotation was computed. [2019-11-20 03:45:13,031 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 537) no Hoare annotation was computed. [2019-11-20 03:45:13,031 INFO L444 ceAbstractionStarter]: For program point L145(lines 145 548) no Hoare annotation was computed. [2019-11-20 03:45:13,031 INFO L444 ceAbstractionStarter]: For program point L112(lines 112 559) no Hoare annotation was computed. [2019-11-20 03:45:13,031 INFO L444 ceAbstractionStarter]: For program point L476(lines 476 480) no Hoare annotation was computed. [2019-11-20 03:45:13,031 INFO L444 ceAbstractionStarter]: For program point L476-2(lines 476 480) no Hoare annotation was computed. [2019-11-20 03:45:13,031 INFO L440 ceAbstractionStarter]: At program point L146(lines 142 549) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4464)) (.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse2 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse1 .cse2))) [2019-11-20 03:45:13,031 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 382) no Hoare annotation was computed. [2019-11-20 03:45:13,031 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 349) no Hoare annotation was computed. [2019-11-20 03:45:13,032 INFO L444 ceAbstractionStarter]: For program point L279(lines 279 287) no Hoare annotation was computed. [2019-11-20 03:45:13,032 INFO L440 ceAbstractionStarter]: At program point L346(lines 60 608) the Hoare annotation is: false [2019-11-20 03:45:13,032 INFO L444 ceAbstractionStarter]: For program point L181(lines 181 536) no Hoare annotation was computed. [2019-11-20 03:45:13,032 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 547) no Hoare annotation was computed. [2019-11-20 03:45:13,032 INFO L444 ceAbstractionStarter]: For program point L115(lines 115 558) no Hoare annotation was computed. [2019-11-20 03:45:13,032 INFO L444 ceAbstractionStarter]: For program point L578(lines 578 584) no Hoare annotation was computed. [2019-11-20 03:45:13,032 INFO L444 ceAbstractionStarter]: For program point L512(lines 512 516) no Hoare annotation was computed. [2019-11-20 03:45:13,032 INFO L444 ceAbstractionStarter]: For program point L512-2(lines 512 516) no Hoare annotation was computed. [2019-11-20 03:45:13,032 INFO L440 ceAbstractionStarter]: At program point L182(lines 178 537) the Hoare annotation is: (let ((.cse4 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse3 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse3) (and (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) .cse0 .cse4) (and .cse0 .cse4 .cse2 .cse3) (and .cse0 (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 .cse2 .cse3)))) [2019-11-20 03:45:13,035 INFO L440 ceAbstractionStarter]: At program point L116(lines 112 559) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-20 03:45:13,035 INFO L444 ceAbstractionStarter]: For program point L447(lines 447 451) no Hoare annotation was computed. [2019-11-20 03:45:13,036 INFO L444 ceAbstractionStarter]: For program point L282(lines 282 286) no Hoare annotation was computed. [2019-11-20 03:45:13,036 INFO L444 ceAbstractionStarter]: For program point L282-2(lines 198 528) no Hoare annotation was computed. [2019-11-20 03:45:13,036 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 92) no Hoare annotation was computed. [2019-11-20 03:45:13,036 INFO L444 ceAbstractionStarter]: For program point L184(lines 184 535) no Hoare annotation was computed. [2019-11-20 03:45:13,036 INFO L444 ceAbstractionStarter]: For program point L151(lines 151 546) no Hoare annotation was computed. [2019-11-20 03:45:13,036 INFO L444 ceAbstractionStarter]: For program point L118(lines 118 557) no Hoare annotation was computed. [2019-11-20 03:45:13,037 INFO L444 ceAbstractionStarter]: For program point L85(lines 85 89) no Hoare annotation was computed. [2019-11-20 03:45:13,037 INFO L444 ceAbstractionStarter]: For program point L350(lines 350 354) no Hoare annotation was computed. [2019-11-20 03:45:13,037 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 03:45:13,037 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 484 496) no Hoare annotation was computed. [2019-11-20 03:45:13,037 INFO L444 ceAbstractionStarter]: For program point L418(lines 418 422) no Hoare annotation was computed. [2019-11-20 03:45:13,037 INFO L444 ceAbstractionStarter]: For program point L220(lines 220 237) no Hoare annotation was computed. [2019-11-20 03:45:13,037 INFO L444 ceAbstractionStarter]: For program point L187(lines 187 534) no Hoare annotation was computed. [2019-11-20 03:45:13,038 INFO L444 ceAbstractionStarter]: For program point L154(lines 154 545) no Hoare annotation was computed. [2019-11-20 03:45:13,038 INFO L444 ceAbstractionStarter]: For program point L220-2(lines 198 528) no Hoare annotation was computed. [2019-11-20 03:45:13,038 INFO L444 ceAbstractionStarter]: For program point L121(lines 121 556) no Hoare annotation was computed. [2019-11-20 03:45:13,038 INFO L440 ceAbstractionStarter]: At program point L188(lines 184 535) the Hoare annotation is: (let ((.cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse4 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse3 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse5 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2))) (or (and .cse0 .cse1 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse2 .cse4) (and (not .cse3) .cse0 .cse1 .cse5))) [2019-11-20 03:45:13,038 INFO L440 ceAbstractionStarter]: At program point L122(lines 118 557) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-20 03:45:13,039 INFO L447 ceAbstractionStarter]: At program point L618(lines 610 620) the Hoare annotation is: true [2019-11-20 03:45:13,039 INFO L444 ceAbstractionStarter]: For program point L519(lines 519 523) no Hoare annotation was computed. [2019-11-20 03:45:13,039 INFO L444 ceAbstractionStarter]: For program point L222(lines 222 227) no Hoare annotation was computed. [2019-11-20 03:45:13,039 INFO L444 ceAbstractionStarter]: For program point L487(lines 487 492) no Hoare annotation was computed. [2019-11-20 03:45:13,039 INFO L444 ceAbstractionStarter]: For program point L454(lines 454 465) no Hoare annotation was computed. [2019-11-20 03:45:13,039 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 454 465) no Hoare annotation was computed. [2019-11-20 03:45:13,040 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 03:45:13,040 INFO L444 ceAbstractionStarter]: For program point L190(lines 190 533) no Hoare annotation was computed. [2019-11-20 03:45:13,041 INFO L444 ceAbstractionStarter]: For program point L157(lines 157 544) no Hoare annotation was computed. [2019-11-20 03:45:13,041 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 555) no Hoare annotation was computed. [2019-11-20 03:45:13,041 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 393) no Hoare annotation was computed. [2019-11-20 03:45:13,041 INFO L444 ceAbstractionStarter]: For program point L323(lines 323 327) no Hoare annotation was computed. [2019-11-20 03:45:13,041 INFO L444 ceAbstractionStarter]: For program point L323-2(lines 198 528) no Hoare annotation was computed. [2019-11-20 03:45:13,043 INFO L440 ceAbstractionStarter]: At program point L191(lines 190 533) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse2 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse3 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse4 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse5 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560))) (or (and .cse0 (not .cse1) .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse3) (and (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse2 .cse3 .cse4 .cse1 .cse5) (and .cse0 .cse2 .cse3 .cse4 .cse1 .cse5))) [2019-11-20 03:45:13,043 INFO L440 ceAbstractionStarter]: At program point L158(lines 148 547) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4480)) (.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse2 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2))) [2019-11-20 03:45:13,043 INFO L444 ceAbstractionStarter]: For program point L456(lines 456 462) no Hoare annotation was computed. [2019-11-20 03:45:13,044 INFO L444 ceAbstractionStarter]: For program point L258(lines 258 262) no Hoare annotation was computed. [2019-11-20 03:45:13,044 INFO L444 ceAbstractionStarter]: For program point L258-2(lines 198 528) no Hoare annotation was computed. [2019-11-20 03:45:13,044 INFO L444 ceAbstractionStarter]: For program point L193(lines 193 532) no Hoare annotation was computed. [2019-11-20 03:45:13,044 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 543) no Hoare annotation was computed. [2019-11-20 03:45:13,044 INFO L444 ceAbstractionStarter]: For program point L127(lines 127 554) no Hoare annotation was computed. [2019-11-20 03:45:13,044 INFO L444 ceAbstractionStarter]: For program point L94-1(lines 60 608) no Hoare annotation was computed. [2019-11-20 03:45:13,045 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 03:45:13,045 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 297) no Hoare annotation was computed. [2019-11-20 03:45:13,045 INFO L444 ceAbstractionStarter]: For program point L293-2(lines 293 297) no Hoare annotation was computed. [2019-11-20 03:45:13,045 INFO L447 ceAbstractionStarter]: At program point L194(lines 193 532) the Hoare annotation is: true [2019-11-20 03:45:13,045 INFO L440 ceAbstractionStarter]: At program point L128(lines 124 555) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse0 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)))) [2019-11-20 03:45:13,046 INFO L444 ceAbstractionStarter]: For program point L95(line 95) no Hoare annotation was computed. [2019-11-20 03:45:13,046 INFO L444 ceAbstractionStarter]: For program point L426(lines 426 430) no Hoare annotation was computed. [2019-11-20 03:45:13,046 INFO L444 ceAbstractionStarter]: For program point L426-2(lines 198 528) no Hoare annotation was computed. [2019-11-20 03:45:13,046 INFO L444 ceAbstractionStarter]: For program point L228(lines 228 233) no Hoare annotation was computed. [2019-11-20 03:45:13,046 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 365) no Hoare annotation was computed. [2019-11-20 03:45:13,046 INFO L444 ceAbstractionStarter]: For program point L163(lines 163 542) no Hoare annotation was computed. [2019-11-20 03:45:13,047 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 553) no Hoare annotation was computed. [2019-11-20 03:45:13,047 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 564) no Hoare annotation was computed. [2019-11-20 03:45:13,047 INFO L444 ceAbstractionStarter]: For program point L395(lines 395 400) no Hoare annotation was computed. [2019-11-20 03:45:13,047 INFO L444 ceAbstractionStarter]: For program point L395-2(lines 395 400) no Hoare annotation was computed. [2019-11-20 03:45:13,047 INFO L447 ceAbstractionStarter]: At program point L197(lines 196 531) the Hoare annotation is: true [2019-11-20 03:45:13,048 INFO L440 ceAbstractionStarter]: At program point L164(lines 160 543) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512)) (.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse2 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse1 .cse2))) [2019-11-20 03:45:13,048 INFO L440 ceAbstractionStarter]: At program point L98(lines 97 564) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (= 12292 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-20 03:45:13,048 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 606) no Hoare annotation was computed. [2019-11-20 03:45:13,049 INFO L440 ceAbstractionStarter]: At program point L529(lines 94 595) the Hoare annotation is: (let ((.cse10 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (let ((.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 3)) (.cse3 (not .cse10)) (.cse6 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse7 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse11 (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse15 (= 4400 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse13 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse8 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)) (.cse12 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse14 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse4 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse5 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse9 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse16 (= 4416 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2))) (or (and .cse0 (= 4368 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse5) (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse2) (and .cse0 .cse1 .cse10) (and .cse6 .cse7 .cse0 .cse9 .cse2) (and .cse1 .cse8 .cse2) (and .cse3 .cse6 .cse7 .cse0) (and .cse11 .cse12 .cse0) (and .cse12 .cse13 .cse8 .cse10 .cse14) (and .cse8 .cse4 .cse5 .cse9 .cse10 .cse2) (and .cse8 .cse15 .cse13 .cse10 .cse2) (and (= ULTIMATE.start_ssl3_connect_~s__state~0 4384) .cse0) (and .cse11 .cse12 .cse8 .cse10 .cse2) (and .cse0 .cse10 .cse15) (and .cse16 .cse13 .cse8 .cse10) (and .cse12 .cse0 .cse10 .cse14) (and .cse0 .cse4 .cse5 .cse9 .cse10 .cse2) (and .cse16 .cse0 .cse10)))) [2019-11-20 03:45:13,049 INFO L444 ceAbstractionStarter]: For program point L166(lines 166 541) no Hoare annotation was computed. [2019-11-20 03:45:13,050 INFO L444 ceAbstractionStarter]: For program point L133(lines 133 552) no Hoare annotation was computed. [2019-11-20 03:45:13,050 INFO L444 ceAbstractionStarter]: For program point L100(lines 100 563) no Hoare annotation was computed. [2019-11-20 03:45:13,050 INFO L447 ceAbstractionStarter]: At program point L596(lines 93 597) the Hoare annotation is: true [2019-11-20 03:45:13,050 INFO L440 ceAbstractionStarter]: At program point L134(lines 130 553) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse0 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse1 .cse2))) [2019-11-20 03:45:13,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 03:45:13 BoogieIcfgContainer [2019-11-20 03:45:13,097 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 03:45:13,098 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 03:45:13,098 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 03:45:13,098 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 03:45:13,099 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:44:55" (3/4) ... [2019-11-20 03:45:13,103 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 03:45:13,131 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-20 03:45:13,132 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 03:45:13,295 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d4f551d5-fb28-4fa0-9fd0-ce0f2d9c9301/bin/uautomizer/witness.graphml [2019-11-20 03:45:13,295 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 03:45:13,297 INFO L168 Benchmark]: Toolchain (without parser) took 19054.89 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.0 GB). Free memory was 947.3 MB in the beginning and 1.9 GB in the end (delta: -962.2 MB). Peak memory consumption was 74.9 MB. Max. memory is 11.5 GB. [2019-11-20 03:45:13,297 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:45:13,297 INFO L168 Benchmark]: CACSL2BoogieTranslator took 487.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -187.7 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-20 03:45:13,298 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-11-20 03:45:13,298 INFO L168 Benchmark]: Boogie Preprocessor took 46.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-20 03:45:13,299 INFO L168 Benchmark]: RCFGBuilder took 896.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.0 MB). Peak memory consumption was 48.0 MB. Max. memory is 11.5 GB. [2019-11-20 03:45:13,299 INFO L168 Benchmark]: TraceAbstraction took 17355.77 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 895.5 MB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -857.8 MB). Peak memory consumption was 880.6 MB. Max. memory is 11.5 GB. [2019-11-20 03:45:13,299 INFO L168 Benchmark]: Witness Printer took 197.67 ms. Allocated memory is still 2.1 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 31.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2019-11-20 03:45:13,302 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 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 487.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -187.7 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 896.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.0 MB). Peak memory consumption was 48.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17355.77 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 895.5 MB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -857.8 MB). Peak memory consumption was 880.6 MB. Max. memory is 11.5 GB. * Witness Printer took 197.67 ms. Allocated memory is still 2.1 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 31.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 606]: 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: 118]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: ((((((s__state <= 4528 && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && 4432 <= s__state) || (4512 <= s__state && s__state <= 4528 && blastFlag <= 2)) || (((s__state <= 4528 && blastFlag <= 2) && 0 == s__hit) && 4432 <= s__state)) || ((((4512 <= s__state && s__state <= 4528) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 130]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit) || ((((blastFlag <= 4 && s__state <= 4432) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 4352 <= s__state) && 0 == s__hit) - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: ((((((4560 <= s__state && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) || ((((4560 <= s__state && s__state <= 4560) && blastFlag <= 2) && 4560 <= s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 4560)) || (((!(0 == s__hit) && 4560 <= s__state) && s__state <= 4560) && blastFlag <= 2) - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: (((s__state <= 4464 && blastFlag <= 2) && 0 == s__hit) && 4432 <= s__state) || ((((s__state <= 4464 && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && 4432 <= s__state) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: ((((s__state <= 4480 && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && 4432 <= s__state) || (((s__state <= 4480 && blastFlag <= 2) && 0 == s__hit) && 4432 <= s__state) - InvariantResult [Line: 610]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 190]: Loop Invariant Derived loop invariant: (((((blastFlag <= 2 && !(0 == s__hit)) && s__state <= 4352) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state) || ((((((s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0 && s__state <= 4352) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || (((((blastFlag <= 2 && 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: 166]: Loop Invariant Derived loop invariant: (((((s__state <= 4512 && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4432 <= s__state) || (((s__state <= 4512 && blastFlag <= 2) && 0 == s__hit) && 4432 <= s__state)) || ((((s__state <= 4512 && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && 4432 <= s__state) - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit) || (((((blastFlag <= 4 && s__state <= 4432) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 4352 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: s__state <= 4560 && blastFlag <= 2 - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: ((((((s__state <= 4560 && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4432 <= s__state) || ((4512 <= s__state && s__state <= 4560) && blastFlag <= 2)) || (((s__state <= 4560 && blastFlag <= 2) && 0 == s__hit) && 4432 <= s__state)) || (s__state <= 4560 && ((blastFlag <= 4 && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && 4432 <= s__state) - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && s__state <= 4448) && 0 == s__hit) && 4432 <= s__state) || ((((blastFlag <= 4 && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && s__state <= 4448) && 0 == s__hit) && 4432 <= s__state) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: blastFlag <= 2 && 12292 == s__state - InvariantResult [Line: 94]: Loop Invariant Derived loop invariant: ((((((((((((((((((blastFlag <= 2 && 4368 == s__state) || ((blastFlag <= 2 && s__state <= 3) && s__s3__tmp__next_state___0 <= 4560)) || ((((blastFlag <= 2 && !(0 == s__hit)) && s__state <= 4352) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state)) || (((((4560 <= s__state && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((blastFlag <= 2 && s__state <= 3) && 0 == s__hit)) || ((((4560 <= s__state && s__state <= 4560) && blastFlag <= 2) && 4560 <= s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 4560)) || ((s__state <= 3 && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && s__s3__tmp__next_state___0 <= 4560)) || (((!(0 == s__hit) && 4560 <= s__state) && s__state <= 4560) && blastFlag <= 2)) || ((4512 <= s__state && s__state <= 4528) && blastFlag <= 2)) || ((((s__state <= 4528 && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && 4432 <= s__state)) || ((((((s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0 && s__state <= 4352) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || (((((s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0 && 4400 == s__state) && blastFlag <= 4) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || (s__state == 4384 && blastFlag <= 2)) || ((((4512 <= s__state && s__state <= 4528) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((blastFlag <= 2 && 0 == s__hit) && 4400 == s__state)) || (((4416 == s__state && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit)) || (((s__state <= 4528 && blastFlag <= 2) && 0 == s__hit) && 4432 <= s__state)) || (((((blastFlag <= 2 && s__state <= 4352) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((4416 == s__state && blastFlag <= 2) && 0 == s__hit) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: (((s__state <= 4512 && blastFlag <= 2) && 0 == s__hit) && 4432 <= s__state) || ((((s__state <= 4512 && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && 4432 <= s__state) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 123 locations, 1 error locations. Result: SAFE, OverallTime: 17.2s, OverallIterations: 25, TraceHistogramMax: 21, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.8s, HoareTripleCheckerStatistics: 4391 SDtfs, 2019 SDslu, 2246 SDs, 0 SdLazy, 2459 SolverSat, 611 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2725 GetRequests, 2688 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3841occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 2798 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 127 NumberOfFragments, 826 HoareAnnotationTreeSize, 22 FomulaSimplifications, 28203 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 22 FomulaSimplificationsInter, 24378 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 8751 NumberOfCodeBlocks, 8751 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 8720 ConstructedInterpolants, 0 QuantifiedInterpolants, 4981326 SizeOfPredicates, 8 NumberOfNonLiveVariables, 4110 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 31 InterpolantComputations, 22 PerfectInterpolantSequences, 39090/39192 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...