./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_7.cil.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_965e64b4-4bad-4d9d-858a-51daba7bd5f7/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_965e64b4-4bad-4d9d-858a-51daba7bd5f7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_965e64b4-4bad-4d9d-858a-51daba7bd5f7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_965e64b4-4bad-4d9d-858a-51daba7bd5f7/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_7.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_965e64b4-4bad-4d9d-858a-51daba7bd5f7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_965e64b4-4bad-4d9d-858a-51daba7bd5f7/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 bde6b0d7476cc0073434242dc88ffbb328415efe ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 00:37:32,952 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 00:37:32,954 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 00:37:32,967 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 00:37:32,967 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 00:37:32,968 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 00:37:32,973 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 00:37:32,981 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 00:37:32,985 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 00:37:32,988 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 00:37:32,989 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 00:37:32,990 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 00:37:32,990 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 00:37:32,991 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 00:37:32,991 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 00:37:32,992 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 00:37:32,993 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 00:37:32,994 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 00:37:32,995 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 00:37:32,997 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 00:37:33,002 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 00:37:33,003 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 00:37:33,004 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 00:37:33,005 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 00:37:33,007 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 00:37:33,007 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 00:37:33,008 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 00:37:33,008 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 00:37:33,009 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 00:37:33,009 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 00:37:33,010 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 00:37:33,010 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 00:37:33,011 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 00:37:33,011 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 00:37:33,012 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 00:37:33,012 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 00:37:33,013 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 00:37:33,013 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 00:37:33,013 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 00:37:33,019 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 00:37:33,021 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 00:37:33,021 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_965e64b4-4bad-4d9d-858a-51daba7bd5f7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 00:37:33,047 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 00:37:33,047 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 00:37:33,048 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 00:37:33,049 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 00:37:33,049 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 00:37:33,049 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 00:37:33,049 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 00:37:33,049 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 00:37:33,050 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 00:37:33,050 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 00:37:33,050 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 00:37:33,050 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 00:37:33,050 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 00:37:33,050 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 00:37:33,051 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 00:37:33,051 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 00:37:33,051 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 00:37:33,051 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 00:37:33,051 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 00:37:33,051 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 00:37:33,052 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 00:37:33,052 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 00:37:33,052 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 00:37:33,052 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 00:37:33,052 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 00:37:33,053 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 00:37:33,053 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 00:37:33,053 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 00:37:33,053 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_965e64b4-4bad-4d9d-858a-51daba7bd5f7/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 -> bde6b0d7476cc0073434242dc88ffbb328415efe [2019-11-20 00:37:33,183 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 00:37:33,193 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 00:37:33,196 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 00:37:33,197 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 00:37:33,198 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 00:37:33,198 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_965e64b4-4bad-4d9d-858a-51daba7bd5f7/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_srvr_7.cil.c [2019-11-20 00:37:33,246 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_965e64b4-4bad-4d9d-858a-51daba7bd5f7/bin/uautomizer/data/775ab3a73/7239583201a2443996faba3e21d0626f/FLAG745f7acde [2019-11-20 00:37:33,715 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 00:37:33,715 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_965e64b4-4bad-4d9d-858a-51daba7bd5f7/sv-benchmarks/c/ssh-simplified/s3_srvr_7.cil.c [2019-11-20 00:37:33,746 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_965e64b4-4bad-4d9d-858a-51daba7bd5f7/bin/uautomizer/data/775ab3a73/7239583201a2443996faba3e21d0626f/FLAG745f7acde [2019-11-20 00:37:33,760 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_965e64b4-4bad-4d9d-858a-51daba7bd5f7/bin/uautomizer/data/775ab3a73/7239583201a2443996faba3e21d0626f [2019-11-20 00:37:33,763 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 00:37:33,764 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 00:37:33,766 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 00:37:33,766 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 00:37:33,769 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 00:37:33,769 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:37:33" (1/1) ... [2019-11-20 00:37:33,771 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16e8c0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:37:33, skipping insertion in model container [2019-11-20 00:37:33,771 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:37:33" (1/1) ... [2019-11-20 00:37:33,779 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 00:37:33,819 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 00:37:34,067 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:37:34,071 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 00:37:34,141 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:37:34,158 INFO L192 MainTranslator]: Completed translation [2019-11-20 00:37:34,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:37:34 WrapperNode [2019-11-20 00:37:34,159 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 00:37:34,160 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 00:37:34,160 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 00:37:34,160 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 00:37:34,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:37:34" (1/1) ... [2019-11-20 00:37:34,173 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:37:34" (1/1) ... [2019-11-20 00:37:34,217 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 00:37:34,217 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 00:37:34,227 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 00:37:34,228 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 00:37:34,236 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:37:34" (1/1) ... [2019-11-20 00:37:34,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:37:34" (1/1) ... [2019-11-20 00:37:34,249 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:37:34" (1/1) ... [2019-11-20 00:37:34,249 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:37:34" (1/1) ... [2019-11-20 00:37:34,271 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:37:34" (1/1) ... [2019-11-20 00:37:34,278 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:37:34" (1/1) ... [2019-11-20 00:37:34,281 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:37:34" (1/1) ... [2019-11-20 00:37:34,284 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 00:37:34,285 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 00:37:34,285 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 00:37:34,285 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 00:37:34,310 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:37:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_965e64b4-4bad-4d9d-858a-51daba7bd5f7/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 00:37:34,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 00:37:34,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 00:37:34,479 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 00:37:35,054 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-20 00:37:35,054 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-20 00:37:35,056 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 00:37:35,056 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 00:37:35,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:37:35 BoogieIcfgContainer [2019-11-20 00:37:35,057 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 00:37:35,058 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 00:37:35,058 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 00:37:35,060 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 00:37:35,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:37:33" (1/3) ... [2019-11-20 00:37:35,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2166dbb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:37:35, skipping insertion in model container [2019-11-20 00:37:35,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:37:34" (2/3) ... [2019-11-20 00:37:35,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2166dbb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:37:35, skipping insertion in model container [2019-11-20 00:37:35,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:37:35" (3/3) ... [2019-11-20 00:37:35,063 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_7.cil.c [2019-11-20 00:37:35,070 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 00:37:35,078 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 00:37:35,088 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 00:37:35,106 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 00:37:35,107 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 00:37:35,107 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 00:37:35,107 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 00:37:35,107 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 00:37:35,107 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 00:37:35,107 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 00:37:35,108 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 00:37:35,124 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states. [2019-11-20 00:37:35,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-20 00:37:35,131 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:37:35,131 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:37:35,132 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:37:35,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:37:35,137 INFO L82 PathProgramCache]: Analyzing trace with hash -356314755, now seen corresponding path program 1 times [2019-11-20 00:37:35,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:37:35,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107262723] [2019-11-20 00:37:35,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:37:35,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:35,335 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 00:37:35,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107262723] [2019-11-20 00:37:35,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:37:35,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:37:35,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026860011] [2019-11-20 00:37:35,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:37:35,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:37:35,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:37:35,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:37:35,362 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 3 states. [2019-11-20 00:37:35,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:37:35,653 INFO L93 Difference]: Finished difference Result 328 states and 564 transitions. [2019-11-20 00:37:35,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:37:35,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-20 00:37:35,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:37:35,674 INFO L225 Difference]: With dead ends: 328 [2019-11-20 00:37:35,675 INFO L226 Difference]: Without dead ends: 170 [2019-11-20 00:37:35,682 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 00:37:35,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-20 00:37:35,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 159. [2019-11-20 00:37:35,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-11-20 00:37:35,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 254 transitions. [2019-11-20 00:37:35,726 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 254 transitions. Word has length 32 [2019-11-20 00:37:35,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:37:35,726 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 254 transitions. [2019-11-20 00:37:35,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:37:35,727 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 254 transitions. [2019-11-20 00:37:35,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-20 00:37:35,728 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:37:35,728 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:37:35,728 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:37:35,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:37:35,729 INFO L82 PathProgramCache]: Analyzing trace with hash 863724593, now seen corresponding path program 1 times [2019-11-20 00:37:35,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:37:35,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491122556] [2019-11-20 00:37:35,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:37:35,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:35,785 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 00:37:35,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491122556] [2019-11-20 00:37:35,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:37:35,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:37:35,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957931101] [2019-11-20 00:37:35,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:37:35,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:37:35,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:37:35,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:37:35,788 INFO L87 Difference]: Start difference. First operand 159 states and 254 transitions. Second operand 3 states. [2019-11-20 00:37:36,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:37:36,000 INFO L93 Difference]: Finished difference Result 350 states and 565 transitions. [2019-11-20 00:37:36,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:37:36,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-20 00:37:36,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:37:36,003 INFO L225 Difference]: With dead ends: 350 [2019-11-20 00:37:36,003 INFO L226 Difference]: Without dead ends: 198 [2019-11-20 00:37:36,004 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 00:37:36,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-11-20 00:37:36,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 187. [2019-11-20 00:37:36,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-11-20 00:37:36,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 305 transitions. [2019-11-20 00:37:36,019 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 305 transitions. Word has length 33 [2019-11-20 00:37:36,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:37:36,020 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 305 transitions. [2019-11-20 00:37:36,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:37:36,020 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 305 transitions. [2019-11-20 00:37:36,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-20 00:37:36,022 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:37:36,022 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:37:36,023 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:37:36,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:37:36,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1579131565, now seen corresponding path program 1 times [2019-11-20 00:37:36,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:37:36,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565642148] [2019-11-20 00:37:36,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:37:36,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:36,087 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 00:37:36,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565642148] [2019-11-20 00:37:36,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:37:36,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:37:36,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052029109] [2019-11-20 00:37:36,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:37:36,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:37:36,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:37:36,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:37:36,089 INFO L87 Difference]: Start difference. First operand 187 states and 305 transitions. Second operand 3 states. [2019-11-20 00:37:36,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:37:36,296 INFO L93 Difference]: Finished difference Result 411 states and 676 transitions. [2019-11-20 00:37:36,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:37:36,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-20 00:37:36,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:37:36,300 INFO L225 Difference]: With dead ends: 411 [2019-11-20 00:37:36,300 INFO L226 Difference]: Without dead ends: 231 [2019-11-20 00:37:36,303 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:37:36,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-11-20 00:37:36,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 225. [2019-11-20 00:37:36,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-11-20 00:37:36,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 374 transitions. [2019-11-20 00:37:36,326 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 374 transitions. Word has length 39 [2019-11-20 00:37:36,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:37:36,326 INFO L462 AbstractCegarLoop]: Abstraction has 225 states and 374 transitions. [2019-11-20 00:37:36,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:37:36,327 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 374 transitions. [2019-11-20 00:37:36,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-20 00:37:36,329 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:37:36,329 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:37:36,330 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:37:36,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:37:36,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1701430900, now seen corresponding path program 1 times [2019-11-20 00:37:36,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:37:36,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048954138] [2019-11-20 00:37:36,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:37:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:36,439 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 00:37:36,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048954138] [2019-11-20 00:37:36,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:37:36,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:37:36,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575522597] [2019-11-20 00:37:36,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:37:36,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:37:36,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:37:36,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:37:36,441 INFO L87 Difference]: Start difference. First operand 225 states and 374 transitions. Second operand 3 states. [2019-11-20 00:37:36,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:37:36,638 INFO L93 Difference]: Finished difference Result 460 states and 766 transitions. [2019-11-20 00:37:36,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:37:36,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-20 00:37:36,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:37:36,640 INFO L225 Difference]: With dead ends: 460 [2019-11-20 00:37:36,640 INFO L226 Difference]: Without dead ends: 242 [2019-11-20 00:37:36,641 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 00:37:36,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-11-20 00:37:36,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 236. [2019-11-20 00:37:36,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-11-20 00:37:36,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 395 transitions. [2019-11-20 00:37:36,656 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 395 transitions. Word has length 40 [2019-11-20 00:37:36,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:37:36,656 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 395 transitions. [2019-11-20 00:37:36,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:37:36,657 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 395 transitions. [2019-11-20 00:37:36,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-20 00:37:36,660 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:37:36,660 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:37:36,660 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:37:36,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:37:36,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1035045975, now seen corresponding path program 1 times [2019-11-20 00:37:36,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:37:36,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288148603] [2019-11-20 00:37:36,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:37:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:36,746 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:37:36,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288148603] [2019-11-20 00:37:36,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:37:36,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:37:36,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199833815] [2019-11-20 00:37:36,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:37:36,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:37:36,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:37:36,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:37:36,749 INFO L87 Difference]: Start difference. First operand 236 states and 395 transitions. Second operand 3 states. [2019-11-20 00:37:36,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:37:36,915 INFO L93 Difference]: Finished difference Result 504 states and 848 transitions. [2019-11-20 00:37:36,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:37:36,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-11-20 00:37:36,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:37:36,918 INFO L225 Difference]: With dead ends: 504 [2019-11-20 00:37:36,918 INFO L226 Difference]: Without dead ends: 275 [2019-11-20 00:37:36,919 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 00:37:36,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-11-20 00:37:36,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 261. [2019-11-20 00:37:36,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-11-20 00:37:36,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 438 transitions. [2019-11-20 00:37:36,932 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 438 transitions. Word has length 58 [2019-11-20 00:37:36,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:37:36,932 INFO L462 AbstractCegarLoop]: Abstraction has 261 states and 438 transitions. [2019-11-20 00:37:36,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:37:36,933 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 438 transitions. [2019-11-20 00:37:36,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-20 00:37:36,936 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:37:36,936 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 00:37:36,936 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:37:36,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:37:36,941 INFO L82 PathProgramCache]: Analyzing trace with hash 629766653, now seen corresponding path program 1 times [2019-11-20 00:37:36,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:37:36,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271934517] [2019-11-20 00:37:36,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:37:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:37,004 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:37:37,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271934517] [2019-11-20 00:37:37,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:37:37,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:37:37,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690623333] [2019-11-20 00:37:37,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:37:37,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:37:37,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:37:37,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:37:37,007 INFO L87 Difference]: Start difference. First operand 261 states and 438 transitions. Second operand 3 states. [2019-11-20 00:37:37,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:37:37,178 INFO L93 Difference]: Finished difference Result 529 states and 888 transitions. [2019-11-20 00:37:37,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:37:37,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-11-20 00:37:37,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:37:37,181 INFO L225 Difference]: With dead ends: 529 [2019-11-20 00:37:37,181 INFO L226 Difference]: Without dead ends: 275 [2019-11-20 00:37:37,181 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 00:37:37,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-11-20 00:37:37,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 261. [2019-11-20 00:37:37,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-11-20 00:37:37,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 435 transitions. [2019-11-20 00:37:37,196 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 435 transitions. Word has length 59 [2019-11-20 00:37:37,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:37:37,198 INFO L462 AbstractCegarLoop]: Abstraction has 261 states and 435 transitions. [2019-11-20 00:37:37,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:37:37,199 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 435 transitions. [2019-11-20 00:37:37,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-20 00:37:37,201 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:37:37,208 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 00:37:37,208 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:37:37,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:37:37,209 INFO L82 PathProgramCache]: Analyzing trace with hash -525858366, now seen corresponding path program 1 times [2019-11-20 00:37:37,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:37:37,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357523259] [2019-11-20 00:37:37,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:37:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:37,307 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:37:37,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357523259] [2019-11-20 00:37:37,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:37:37,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:37:37,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834810889] [2019-11-20 00:37:37,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:37:37,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:37:37,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:37:37,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:37:37,309 INFO L87 Difference]: Start difference. First operand 261 states and 435 transitions. Second operand 3 states. [2019-11-20 00:37:37,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:37:37,471 INFO L93 Difference]: Finished difference Result 546 states and 913 transitions. [2019-11-20 00:37:37,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:37:37,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-11-20 00:37:37,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:37:37,473 INFO L225 Difference]: With dead ends: 546 [2019-11-20 00:37:37,474 INFO L226 Difference]: Without dead ends: 292 [2019-11-20 00:37:37,474 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 00:37:37,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-11-20 00:37:37,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2019-11-20 00:37:37,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-11-20 00:37:37,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 487 transitions. [2019-11-20 00:37:37,486 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 487 transitions. Word has length 60 [2019-11-20 00:37:37,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:37:37,487 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 487 transitions. [2019-11-20 00:37:37,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:37:37,487 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 487 transitions. [2019-11-20 00:37:37,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-20 00:37:37,490 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:37:37,490 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 00:37:37,490 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:37:37,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:37:37,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1083403756, now seen corresponding path program 1 times [2019-11-20 00:37:37,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:37:37,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505661855] [2019-11-20 00:37:37,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:37:37,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:37,531 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-20 00:37:37,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505661855] [2019-11-20 00:37:37,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:37:37,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:37:37,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050800157] [2019-11-20 00:37:37,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:37:37,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:37:37,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:37:37,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:37:37,536 INFO L87 Difference]: Start difference. First operand 292 states and 487 transitions. Second operand 3 states. [2019-11-20 00:37:37,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:37:37,669 INFO L93 Difference]: Finished difference Result 594 states and 991 transitions. [2019-11-20 00:37:37,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:37:37,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-20 00:37:37,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:37:37,672 INFO L225 Difference]: With dead ends: 594 [2019-11-20 00:37:37,672 INFO L226 Difference]: Without dead ends: 309 [2019-11-20 00:37:37,672 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 00:37:37,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-11-20 00:37:37,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 307. [2019-11-20 00:37:37,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-11-20 00:37:37,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 508 transitions. [2019-11-20 00:37:37,684 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 508 transitions. Word has length 72 [2019-11-20 00:37:37,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:37:37,684 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 508 transitions. [2019-11-20 00:37:37,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:37:37,685 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 508 transitions. [2019-11-20 00:37:37,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-20 00:37:37,686 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:37:37,686 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:37:37,686 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:37:37,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:37:37,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1891971647, now seen corresponding path program 1 times [2019-11-20 00:37:37,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:37:37,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619614033] [2019-11-20 00:37:37,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:37:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:37,731 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:37:37,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619614033] [2019-11-20 00:37:37,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:37:37,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:37:37,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287939126] [2019-11-20 00:37:37,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:37:37,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:37:37,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:37:37,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:37:37,733 INFO L87 Difference]: Start difference. First operand 307 states and 508 transitions. Second operand 3 states. [2019-11-20 00:37:37,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:37:37,901 INFO L93 Difference]: Finished difference Result 645 states and 1069 transitions. [2019-11-20 00:37:37,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:37:37,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-20 00:37:37,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:37:37,904 INFO L225 Difference]: With dead ends: 645 [2019-11-20 00:37:37,904 INFO L226 Difference]: Without dead ends: 345 [2019-11-20 00:37:37,905 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 00:37:37,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-11-20 00:37:37,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2019-11-20 00:37:37,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-11-20 00:37:37,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 568 transitions. [2019-11-20 00:37:37,919 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 568 transitions. Word has length 72 [2019-11-20 00:37:37,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:37:37,920 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 568 transitions. [2019-11-20 00:37:37,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:37:37,920 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 568 transitions. [2019-11-20 00:37:37,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-20 00:37:37,921 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:37:37,921 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:37:37,922 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:37:37,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:37:37,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1471078304, now seen corresponding path program 1 times [2019-11-20 00:37:37,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:37:37,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121692182] [2019-11-20 00:37:37,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:37:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:37,956 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-20 00:37:37,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121692182] [2019-11-20 00:37:37,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:37:37,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:37:37,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212452869] [2019-11-20 00:37:37,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:37:37,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:37:37,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:37:37,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:37:37,961 INFO L87 Difference]: Start difference. First operand 343 states and 568 transitions. Second operand 3 states. [2019-11-20 00:37:38,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:37:38,084 INFO L93 Difference]: Finished difference Result 681 states and 1127 transitions. [2019-11-20 00:37:38,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:37:38,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-20 00:37:38,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:37:38,087 INFO L225 Difference]: With dead ends: 681 [2019-11-20 00:37:38,087 INFO L226 Difference]: Without dead ends: 345 [2019-11-20 00:37:38,088 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:37:38,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-11-20 00:37:38,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2019-11-20 00:37:38,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-11-20 00:37:38,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 562 transitions. [2019-11-20 00:37:38,102 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 562 transitions. Word has length 73 [2019-11-20 00:37:38,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:37:38,103 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 562 transitions. [2019-11-20 00:37:38,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:37:38,104 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 562 transitions. [2019-11-20 00:37:38,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-20 00:37:38,109 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:37:38,109 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:37:38,110 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:37:38,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:37:38,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1412542918, now seen corresponding path program 1 times [2019-11-20 00:37:38,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:37:38,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649246509] [2019-11-20 00:37:38,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:37:38,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:38,142 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:37:38,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649246509] [2019-11-20 00:37:38,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:37:38,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:37:38,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872604694] [2019-11-20 00:37:38,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:37:38,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:37:38,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:37:38,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:37:38,144 INFO L87 Difference]: Start difference. First operand 343 states and 562 transitions. Second operand 3 states. [2019-11-20 00:37:38,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:37:38,295 INFO L93 Difference]: Finished difference Result 681 states and 1115 transitions. [2019-11-20 00:37:38,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:37:38,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-20 00:37:38,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:37:38,298 INFO L225 Difference]: With dead ends: 681 [2019-11-20 00:37:38,298 INFO L226 Difference]: Without dead ends: 345 [2019-11-20 00:37:38,299 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 00:37:38,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-11-20 00:37:38,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2019-11-20 00:37:38,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-11-20 00:37:38,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 560 transitions. [2019-11-20 00:37:38,312 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 560 transitions. Word has length 73 [2019-11-20 00:37:38,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:37:38,312 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 560 transitions. [2019-11-20 00:37:38,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:37:38,312 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 560 transitions. [2019-11-20 00:37:38,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-20 00:37:38,314 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:37:38,314 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:37:38,314 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:37:38,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:37:38,314 INFO L82 PathProgramCache]: Analyzing trace with hash 842422756, now seen corresponding path program 1 times [2019-11-20 00:37:38,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:37:38,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582491160] [2019-11-20 00:37:38,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:37:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:38,356 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-20 00:37:38,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582491160] [2019-11-20 00:37:38,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:37:38,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:37:38,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860496374] [2019-11-20 00:37:38,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:37:38,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:37:38,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:37:38,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:37:38,358 INFO L87 Difference]: Start difference. First operand 343 states and 560 transitions. Second operand 3 states. [2019-11-20 00:37:38,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:37:38,496 INFO L93 Difference]: Finished difference Result 708 states and 1157 transitions. [2019-11-20 00:37:38,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:37:38,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-11-20 00:37:38,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:37:38,499 INFO L225 Difference]: With dead ends: 708 [2019-11-20 00:37:38,499 INFO L226 Difference]: Without dead ends: 372 [2019-11-20 00:37:38,500 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 00:37:38,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-11-20 00:37:38,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 367. [2019-11-20 00:37:38,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-11-20 00:37:38,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 595 transitions. [2019-11-20 00:37:38,513 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 595 transitions. Word has length 79 [2019-11-20 00:37:38,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:37:38,514 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 595 transitions. [2019-11-20 00:37:38,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:37:38,514 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 595 transitions. [2019-11-20 00:37:38,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 00:37:38,515 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:37:38,515 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:37:38,516 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:37:38,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:37:38,516 INFO L82 PathProgramCache]: Analyzing trace with hash 2073472880, now seen corresponding path program 1 times [2019-11-20 00:37:38,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:37:38,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055150215] [2019-11-20 00:37:38,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:37:38,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:38,560 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-20 00:37:38,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055150215] [2019-11-20 00:37:38,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:37:38,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:37:38,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555505827] [2019-11-20 00:37:38,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:37:38,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:37:38,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:37:38,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:37:38,562 INFO L87 Difference]: Start difference. First operand 367 states and 595 transitions. Second operand 3 states. [2019-11-20 00:37:38,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:37:38,698 INFO L93 Difference]: Finished difference Result 732 states and 1186 transitions. [2019-11-20 00:37:38,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:37:38,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-11-20 00:37:38,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:37:38,701 INFO L225 Difference]: With dead ends: 732 [2019-11-20 00:37:38,701 INFO L226 Difference]: Without dead ends: 372 [2019-11-20 00:37:38,702 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 00:37:38,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-11-20 00:37:38,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 367. [2019-11-20 00:37:38,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-11-20 00:37:38,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 589 transitions. [2019-11-20 00:37:38,715 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 589 transitions. Word has length 80 [2019-11-20 00:37:38,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:37:38,715 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 589 transitions. [2019-11-20 00:37:38,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:37:38,715 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 589 transitions. [2019-11-20 00:37:38,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 00:37:38,716 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:37:38,717 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-11-20 00:37:38,717 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:37:38,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:37:38,717 INFO L82 PathProgramCache]: Analyzing trace with hash 269550751, now seen corresponding path program 1 times [2019-11-20 00:37:38,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:37:38,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531895640] [2019-11-20 00:37:38,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:37:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:38,745 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-11-20 00:37:38,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531895640] [2019-11-20 00:37:38,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:37:38,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:37:38,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106252018] [2019-11-20 00:37:38,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:37:38,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:37:38,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:37:38,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:37:38,747 INFO L87 Difference]: Start difference. First operand 367 states and 589 transitions. Second operand 3 states. [2019-11-20 00:37:38,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:37:38,862 INFO L93 Difference]: Finished difference Result 736 states and 1179 transitions. [2019-11-20 00:37:38,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:37:38,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-20 00:37:38,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:37:38,865 INFO L225 Difference]: With dead ends: 736 [2019-11-20 00:37:38,865 INFO L226 Difference]: Without dead ends: 376 [2019-11-20 00:37:38,866 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 00:37:38,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-11-20 00:37:38,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2019-11-20 00:37:38,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-11-20 00:37:38,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 592 transitions. [2019-11-20 00:37:38,882 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 592 transitions. Word has length 85 [2019-11-20 00:37:38,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:37:38,882 INFO L462 AbstractCegarLoop]: Abstraction has 376 states and 592 transitions. [2019-11-20 00:37:38,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:37:38,883 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 592 transitions. [2019-11-20 00:37:38,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 00:37:38,884 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:37:38,884 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:37:38,885 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:37:38,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:37:38,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1732524919, now seen corresponding path program 1 times [2019-11-20 00:37:38,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:37:38,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246560358] [2019-11-20 00:37:38,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:37:38,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:38,923 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-20 00:37:38,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246560358] [2019-11-20 00:37:38,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:37:38,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:37:38,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121157335] [2019-11-20 00:37:38,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:37:38,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:37:38,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:37:38,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:37:38,926 INFO L87 Difference]: Start difference. First operand 376 states and 592 transitions. Second operand 3 states. [2019-11-20 00:37:39,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:37:39,077 INFO L93 Difference]: Finished difference Result 776 states and 1220 transitions. [2019-11-20 00:37:39,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:37:39,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-11-20 00:37:39,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:37:39,080 INFO L225 Difference]: With dead ends: 776 [2019-11-20 00:37:39,080 INFO L226 Difference]: Without dead ends: 407 [2019-11-20 00:37:39,081 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 00:37:39,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-11-20 00:37:39,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 405. [2019-11-20 00:37:39,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-11-20 00:37:39,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 633 transitions. [2019-11-20 00:37:39,101 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 633 transitions. Word has length 86 [2019-11-20 00:37:39,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:37:39,101 INFO L462 AbstractCegarLoop]: Abstraction has 405 states and 633 transitions. [2019-11-20 00:37:39,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:37:39,102 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 633 transitions. [2019-11-20 00:37:39,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 00:37:39,103 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:37:39,103 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:37:39,104 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:37:39,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:37:39,104 INFO L82 PathProgramCache]: Analyzing trace with hash -59923555, now seen corresponding path program 1 times [2019-11-20 00:37:39,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:37:39,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647563819] [2019-11-20 00:37:39,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:37:39,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:39,147 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-20 00:37:39,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647563819] [2019-11-20 00:37:39,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:37:39,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:37:39,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938240320] [2019-11-20 00:37:39,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:37:39,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:37:39,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:37:39,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:37:39,151 INFO L87 Difference]: Start difference. First operand 405 states and 633 transitions. Second operand 3 states. [2019-11-20 00:37:39,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:37:39,291 INFO L93 Difference]: Finished difference Result 805 states and 1257 transitions. [2019-11-20 00:37:39,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:37:39,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-11-20 00:37:39,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:37:39,294 INFO L225 Difference]: With dead ends: 805 [2019-11-20 00:37:39,294 INFO L226 Difference]: Without dead ends: 407 [2019-11-20 00:37:39,295 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 00:37:39,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-11-20 00:37:39,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 405. [2019-11-20 00:37:39,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-11-20 00:37:39,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 629 transitions. [2019-11-20 00:37:39,311 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 629 transitions. Word has length 87 [2019-11-20 00:37:39,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:37:39,311 INFO L462 AbstractCegarLoop]: Abstraction has 405 states and 629 transitions. [2019-11-20 00:37:39,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:37:39,311 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 629 transitions. [2019-11-20 00:37:39,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 00:37:39,313 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:37:39,313 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:37:39,313 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:37:39,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:37:39,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1911070133, now seen corresponding path program 1 times [2019-11-20 00:37:39,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:37:39,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058714981] [2019-11-20 00:37:39,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:37:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:39,340 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-20 00:37:39,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058714981] [2019-11-20 00:37:39,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:37:39,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:37:39,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439520916] [2019-11-20 00:37:39,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:37:39,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:37:39,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:37:39,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:37:39,342 INFO L87 Difference]: Start difference. First operand 405 states and 629 transitions. Second operand 3 states. [2019-11-20 00:37:39,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:37:39,477 INFO L93 Difference]: Finished difference Result 828 states and 1288 transitions. [2019-11-20 00:37:39,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:37:39,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-20 00:37:39,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:37:39,480 INFO L225 Difference]: With dead ends: 828 [2019-11-20 00:37:39,480 INFO L226 Difference]: Without dead ends: 430 [2019-11-20 00:37:39,481 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 00:37:39,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-11-20 00:37:39,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 426. [2019-11-20 00:37:39,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-11-20 00:37:39,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 656 transitions. [2019-11-20 00:37:39,498 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 656 transitions. Word has length 100 [2019-11-20 00:37:39,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:37:39,498 INFO L462 AbstractCegarLoop]: Abstraction has 426 states and 656 transitions. [2019-11-20 00:37:39,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:37:39,499 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 656 transitions. [2019-11-20 00:37:39,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-20 00:37:39,500 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:37:39,500 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:37:39,500 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:37:39,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:37:39,501 INFO L82 PathProgramCache]: Analyzing trace with hash 75615305, now seen corresponding path program 1 times [2019-11-20 00:37:39,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:37:39,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835740227] [2019-11-20 00:37:39,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:37:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:39,527 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-20 00:37:39,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835740227] [2019-11-20 00:37:39,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:37:39,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:37:39,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028584359] [2019-11-20 00:37:39,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:37:39,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:37:39,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:37:39,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:37:39,533 INFO L87 Difference]: Start difference. First operand 426 states and 656 transitions. Second operand 3 states. [2019-11-20 00:37:39,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:37:39,675 INFO L93 Difference]: Finished difference Result 849 states and 1307 transitions. [2019-11-20 00:37:39,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:37:39,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-11-20 00:37:39,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:37:39,679 INFO L225 Difference]: With dead ends: 849 [2019-11-20 00:37:39,679 INFO L226 Difference]: Without dead ends: 430 [2019-11-20 00:37:39,679 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 00:37:39,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-11-20 00:37:39,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 426. [2019-11-20 00:37:39,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-11-20 00:37:39,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 648 transitions. [2019-11-20 00:37:39,696 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 648 transitions. Word has length 101 [2019-11-20 00:37:39,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:37:39,696 INFO L462 AbstractCegarLoop]: Abstraction has 426 states and 648 transitions. [2019-11-20 00:37:39,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:37:39,697 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 648 transitions. [2019-11-20 00:37:39,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-20 00:37:39,698 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:37:39,698 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:37:39,699 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:37:39,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:37:39,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1557354836, now seen corresponding path program 1 times [2019-11-20 00:37:39,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:37:39,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082961640] [2019-11-20 00:37:39,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:37:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:39,739 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-20 00:37:39,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082961640] [2019-11-20 00:37:39,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:37:39,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:37:39,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791777426] [2019-11-20 00:37:39,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:37:39,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:37:39,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:37:39,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:37:39,742 INFO L87 Difference]: Start difference. First operand 426 states and 648 transitions. Second operand 3 states. [2019-11-20 00:37:39,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:37:39,915 INFO L93 Difference]: Finished difference Result 890 states and 1351 transitions. [2019-11-20 00:37:39,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:37:39,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-11-20 00:37:39,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:37:39,918 INFO L225 Difference]: With dead ends: 890 [2019-11-20 00:37:39,918 INFO L226 Difference]: Without dead ends: 471 [2019-11-20 00:37:39,919 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 00:37:39,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-11-20 00:37:39,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 468. [2019-11-20 00:37:39,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2019-11-20 00:37:39,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 709 transitions. [2019-11-20 00:37:39,936 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 709 transitions. Word has length 102 [2019-11-20 00:37:39,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:37:39,936 INFO L462 AbstractCegarLoop]: Abstraction has 468 states and 709 transitions. [2019-11-20 00:37:39,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:37:39,936 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 709 transitions. [2019-11-20 00:37:39,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 00:37:39,938 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:37:39,938 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:37:39,938 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:37:39,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:37:39,939 INFO L82 PathProgramCache]: Analyzing trace with hash -2007457582, now seen corresponding path program 1 times [2019-11-20 00:37:39,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:37:39,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722345129] [2019-11-20 00:37:39,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:37:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:39,972 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-20 00:37:39,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722345129] [2019-11-20 00:37:39,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:37:39,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:37:39,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557506241] [2019-11-20 00:37:39,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:37:39,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:37:39,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:37:39,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:37:39,974 INFO L87 Difference]: Start difference. First operand 468 states and 709 transitions. Second operand 3 states. [2019-11-20 00:37:40,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:37:40,120 INFO L93 Difference]: Finished difference Result 965 states and 1459 transitions. [2019-11-20 00:37:40,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:37:40,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-11-20 00:37:40,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:37:40,124 INFO L225 Difference]: With dead ends: 965 [2019-11-20 00:37:40,124 INFO L226 Difference]: Without dead ends: 504 [2019-11-20 00:37:40,125 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 00:37:40,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-11-20 00:37:40,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 502. [2019-11-20 00:37:40,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-11-20 00:37:40,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 755 transitions. [2019-11-20 00:37:40,142 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 755 transitions. Word has length 103 [2019-11-20 00:37:40,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:37:40,143 INFO L462 AbstractCegarLoop]: Abstraction has 502 states and 755 transitions. [2019-11-20 00:37:40,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:37:40,143 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 755 transitions. [2019-11-20 00:37:40,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 00:37:40,144 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:37:40,145 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:37:40,145 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:37:40,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:37:40,145 INFO L82 PathProgramCache]: Analyzing trace with hash -426212883, now seen corresponding path program 1 times [2019-11-20 00:37:40,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:37:40,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944872232] [2019-11-20 00:37:40,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:37:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:40,176 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-20 00:37:40,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944872232] [2019-11-20 00:37:40,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:37:40,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:37:40,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039762242] [2019-11-20 00:37:40,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:37:40,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:37:40,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:37:40,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:37:40,178 INFO L87 Difference]: Start difference. First operand 502 states and 755 transitions. Second operand 3 states. [2019-11-20 00:37:40,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:37:40,351 INFO L93 Difference]: Finished difference Result 1004 states and 1510 transitions. [2019-11-20 00:37:40,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:37:40,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-11-20 00:37:40,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:37:40,354 INFO L225 Difference]: With dead ends: 1004 [2019-11-20 00:37:40,354 INFO L226 Difference]: Without dead ends: 507 [2019-11-20 00:37:40,355 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 00:37:40,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-11-20 00:37:40,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 504. [2019-11-20 00:37:40,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-11-20 00:37:40,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 758 transitions. [2019-11-20 00:37:40,373 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 758 transitions. Word has length 103 [2019-11-20 00:37:40,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:37:40,374 INFO L462 AbstractCegarLoop]: Abstraction has 504 states and 758 transitions. [2019-11-20 00:37:40,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:37:40,374 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 758 transitions. [2019-11-20 00:37:40,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-20 00:37:40,375 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:37:40,376 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:37:40,376 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:37:40,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:37:40,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1947800103, now seen corresponding path program 1 times [2019-11-20 00:37:40,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:37:40,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672840914] [2019-11-20 00:37:40,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:37:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:40,412 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-20 00:37:40,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672840914] [2019-11-20 00:37:40,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:37:40,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:37:40,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674002640] [2019-11-20 00:37:40,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:37:40,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:37:40,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:37:40,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:37:40,414 INFO L87 Difference]: Start difference. First operand 504 states and 758 transitions. Second operand 3 states. [2019-11-20 00:37:40,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:37:40,567 INFO L93 Difference]: Finished difference Result 1003 states and 1507 transitions. [2019-11-20 00:37:40,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:37:40,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-20 00:37:40,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:37:40,571 INFO L225 Difference]: With dead ends: 1003 [2019-11-20 00:37:40,571 INFO L226 Difference]: Without dead ends: 506 [2019-11-20 00:37:40,572 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 00:37:40,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-11-20 00:37:40,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 504. [2019-11-20 00:37:40,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-11-20 00:37:40,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 754 transitions. [2019-11-20 00:37:40,590 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 754 transitions. Word has length 104 [2019-11-20 00:37:40,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:37:40,591 INFO L462 AbstractCegarLoop]: Abstraction has 504 states and 754 transitions. [2019-11-20 00:37:40,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:37:40,591 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 754 transitions. [2019-11-20 00:37:40,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-20 00:37:40,595 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:37:40,595 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:37:40,595 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:37:40,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:37:40,595 INFO L82 PathProgramCache]: Analyzing trace with hash -2026242603, now seen corresponding path program 1 times [2019-11-20 00:37:40,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:37:40,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902990283] [2019-11-20 00:37:40,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:37:40,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:40,639 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-11-20 00:37:40,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902990283] [2019-11-20 00:37:40,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:37:40,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:37:40,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084804668] [2019-11-20 00:37:40,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:37:40,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:37:40,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:37:40,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:37:40,644 INFO L87 Difference]: Start difference. First operand 504 states and 754 transitions. Second operand 3 states. [2019-11-20 00:37:40,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:37:40,693 INFO L93 Difference]: Finished difference Result 1491 states and 2227 transitions. [2019-11-20 00:37:40,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:37:40,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-11-20 00:37:40,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:37:40,700 INFO L225 Difference]: With dead ends: 1491 [2019-11-20 00:37:40,700 INFO L226 Difference]: Without dead ends: 994 [2019-11-20 00:37:40,702 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 00:37:40,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2019-11-20 00:37:40,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 505. [2019-11-20 00:37:40,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-11-20 00:37:40,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 755 transitions. [2019-11-20 00:37:40,730 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 755 transitions. Word has length 116 [2019-11-20 00:37:40,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:37:40,730 INFO L462 AbstractCegarLoop]: Abstraction has 505 states and 755 transitions. [2019-11-20 00:37:40,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:37:40,731 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 755 transitions. [2019-11-20 00:37:40,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-20 00:37:40,732 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:37:40,733 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:37:40,733 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:37:40,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:37:40,734 INFO L82 PathProgramCache]: Analyzing trace with hash 24741395, now seen corresponding path program 1 times [2019-11-20 00:37:40,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:37:40,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651723492] [2019-11-20 00:37:40,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:37:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:40,791 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-20 00:37:40,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651723492] [2019-11-20 00:37:40,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:37:40,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:37:40,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662096180] [2019-11-20 00:37:40,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:37:40,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:37:40,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:37:40,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:37:40,793 INFO L87 Difference]: Start difference. First operand 505 states and 755 transitions. Second operand 3 states. [2019-11-20 00:37:40,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:37:40,891 INFO L93 Difference]: Finished difference Result 1499 states and 2242 transitions. [2019-11-20 00:37:40,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:37:40,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-11-20 00:37:40,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:37:40,897 INFO L225 Difference]: With dead ends: 1499 [2019-11-20 00:37:40,897 INFO L226 Difference]: Without dead ends: 1001 [2019-11-20 00:37:40,899 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 00:37:40,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2019-11-20 00:37:40,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 1001. [2019-11-20 00:37:40,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2019-11-20 00:37:40,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1492 transitions. [2019-11-20 00:37:40,937 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1492 transitions. Word has length 116 [2019-11-20 00:37:40,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:37:40,937 INFO L462 AbstractCegarLoop]: Abstraction has 1001 states and 1492 transitions. [2019-11-20 00:37:40,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:37:40,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1492 transitions. [2019-11-20 00:37:40,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-20 00:37:40,940 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:37:40,940 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:37:40,940 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:37:40,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:37:40,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1829844413, now seen corresponding path program 1 times [2019-11-20 00:37:40,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:37:40,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671502152] [2019-11-20 00:37:40,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:37:40,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:40,992 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-11-20 00:37:40,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671502152] [2019-11-20 00:37:40,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:37:40,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:37:40,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179628355] [2019-11-20 00:37:40,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:37:40,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:37:40,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:37:40,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:37:40,994 INFO L87 Difference]: Start difference. First operand 1001 states and 1492 transitions. Second operand 3 states. [2019-11-20 00:37:41,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:37:41,080 INFO L93 Difference]: Finished difference Result 2493 states and 3717 transitions. [2019-11-20 00:37:41,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:37:41,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-11-20 00:37:41,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:37:41,088 INFO L225 Difference]: With dead ends: 2493 [2019-11-20 00:37:41,089 INFO L226 Difference]: Without dead ends: 1499 [2019-11-20 00:37:41,090 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 00:37:41,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2019-11-20 00:37:41,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1497. [2019-11-20 00:37:41,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1497 states. [2019-11-20 00:37:41,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 2233 transitions. [2019-11-20 00:37:41,145 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 2233 transitions. Word has length 118 [2019-11-20 00:37:41,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:37:41,146 INFO L462 AbstractCegarLoop]: Abstraction has 1497 states and 2233 transitions. [2019-11-20 00:37:41,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:37:41,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 2233 transitions. [2019-11-20 00:37:41,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-20 00:37:41,148 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:37:41,149 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:37:41,149 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:37:41,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:37:41,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1992320337, now seen corresponding path program 1 times [2019-11-20 00:37:41,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:37:41,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834352717] [2019-11-20 00:37:41,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:37:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:41,196 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-11-20 00:37:41,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834352717] [2019-11-20 00:37:41,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:37:41,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:37:41,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142347109] [2019-11-20 00:37:41,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:37:41,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:37:41,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:37:41,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:37:41,198 INFO L87 Difference]: Start difference. First operand 1497 states and 2233 transitions. Second operand 3 states. [2019-11-20 00:37:41,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:37:41,290 INFO L93 Difference]: Finished difference Result 1997 states and 2978 transitions. [2019-11-20 00:37:41,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:37:41,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-11-20 00:37:41,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:37:41,301 INFO L225 Difference]: With dead ends: 1997 [2019-11-20 00:37:41,301 INFO L226 Difference]: Without dead ends: 1995 [2019-11-20 00:37:41,303 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:37:41,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2019-11-20 00:37:41,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1993. [2019-11-20 00:37:41,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1993 states. [2019-11-20 00:37:41,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 2975 transitions. [2019-11-20 00:37:41,388 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 2975 transitions. Word has length 119 [2019-11-20 00:37:41,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:37:41,389 INFO L462 AbstractCegarLoop]: Abstraction has 1993 states and 2975 transitions. [2019-11-20 00:37:41,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:37:41,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 2975 transitions. [2019-11-20 00:37:41,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-20 00:37:41,393 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:37:41,393 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-11-20 00:37:41,393 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:37:41,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:37:41,393 INFO L82 PathProgramCache]: Analyzing trace with hash -364234556, now seen corresponding path program 1 times [2019-11-20 00:37:41,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:37:41,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781234271] [2019-11-20 00:37:41,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:37:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:41,433 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-11-20 00:37:41,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781234271] [2019-11-20 00:37:41,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:37:41,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:37:41,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990726020] [2019-11-20 00:37:41,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:37:41,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:37:41,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:37:41,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:37:41,435 INFO L87 Difference]: Start difference. First operand 1993 states and 2975 transitions. Second operand 3 states. [2019-11-20 00:37:41,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:37:41,634 INFO L93 Difference]: Finished difference Result 4167 states and 6200 transitions. [2019-11-20 00:37:41,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:37:41,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-11-20 00:37:41,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:37:41,645 INFO L225 Difference]: With dead ends: 4167 [2019-11-20 00:37:41,646 INFO L226 Difference]: Without dead ends: 2181 [2019-11-20 00:37:41,648 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 00:37:41,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2181 states. [2019-11-20 00:37:41,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2181 to 2157. [2019-11-20 00:37:41,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2157 states. [2019-11-20 00:37:41,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 2157 states and 3195 transitions. [2019-11-20 00:37:41,716 INFO L78 Accepts]: Start accepts. Automaton has 2157 states and 3195 transitions. Word has length 149 [2019-11-20 00:37:41,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:37:41,716 INFO L462 AbstractCegarLoop]: Abstraction has 2157 states and 3195 transitions. [2019-11-20 00:37:41,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:37:41,717 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 3195 transitions. [2019-11-20 00:37:41,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-20 00:37:41,720 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:37:41,720 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:37:41,721 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:37:41,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:37:41,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1201845333, now seen corresponding path program 1 times [2019-11-20 00:37:41,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:37:41,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672313151] [2019-11-20 00:37:41,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:37:41,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:41,764 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-11-20 00:37:41,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672313151] [2019-11-20 00:37:41,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:37:41,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:37:41,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442758981] [2019-11-20 00:37:41,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:37:41,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:37:41,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:37:41,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:37:41,766 INFO L87 Difference]: Start difference. First operand 2157 states and 3195 transitions. Second operand 3 states. [2019-11-20 00:37:41,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:37:41,963 INFO L93 Difference]: Finished difference Result 4331 states and 6412 transitions. [2019-11-20 00:37:41,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:37:41,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-11-20 00:37:41,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:37:41,974 INFO L225 Difference]: With dead ends: 4331 [2019-11-20 00:37:41,974 INFO L226 Difference]: Without dead ends: 2149 [2019-11-20 00:37:41,977 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 00:37:41,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2149 states. [2019-11-20 00:37:42,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2149 to 2125. [2019-11-20 00:37:42,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2125 states. [2019-11-20 00:37:42,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 2125 states and 3139 transitions. [2019-11-20 00:37:42,045 INFO L78 Accepts]: Start accepts. Automaton has 2125 states and 3139 transitions. Word has length 150 [2019-11-20 00:37:42,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:37:42,045 INFO L462 AbstractCegarLoop]: Abstraction has 2125 states and 3139 transitions. [2019-11-20 00:37:42,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:37:42,046 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 3139 transitions. [2019-11-20 00:37:42,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-20 00:37:42,050 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:37:42,050 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:37:42,050 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:37:42,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:37:42,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1088692113, now seen corresponding path program 1 times [2019-11-20 00:37:42,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:37:42,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573531677] [2019-11-20 00:37:42,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:37:42,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:42,170 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 174 proven. 26 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-20 00:37:42,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573531677] [2019-11-20 00:37:42,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675234209] [2019-11-20 00:37:42,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_965e64b4-4bad-4d9d-858a-51daba7bd5f7/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 00:37:42,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:42,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 00:37:42,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:37:42,371 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-11-20 00:37:42,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 00:37:42,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-20 00:37:42,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718219924] [2019-11-20 00:37:42,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:37:42,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:37:42,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:37:42,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:37:42,374 INFO L87 Difference]: Start difference. First operand 2125 states and 3139 transitions. Second operand 3 states. [2019-11-20 00:37:42,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:37:42,503 INFO L93 Difference]: Finished difference Result 4774 states and 7050 transitions. [2019-11-20 00:37:42,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:37:42,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-11-20 00:37:42,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:37:42,517 INFO L225 Difference]: With dead ends: 4774 [2019-11-20 00:37:42,517 INFO L226 Difference]: Without dead ends: 2656 [2019-11-20 00:37:42,522 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 182 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 00:37:42,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2656 states. [2019-11-20 00:37:42,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2656 to 2654. [2019-11-20 00:37:42,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2654 states. [2019-11-20 00:37:42,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2654 states to 2654 states and 3900 transitions. [2019-11-20 00:37:42,622 INFO L78 Accepts]: Start accepts. Automaton has 2654 states and 3900 transitions. Word has length 182 [2019-11-20 00:37:42,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:37:42,622 INFO L462 AbstractCegarLoop]: Abstraction has 2654 states and 3900 transitions. [2019-11-20 00:37:42,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:37:42,623 INFO L276 IsEmpty]: Start isEmpty. Operand 2654 states and 3900 transitions. [2019-11-20 00:37:42,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-20 00:37:42,627 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:37:42,628 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:37:42,833 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:37:42,834 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:37:42,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:37:42,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1478070071, now seen corresponding path program 1 times [2019-11-20 00:37:42,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:37:42,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121490452] [2019-11-20 00:37:42,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:37:42,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:42,899 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-20 00:37:42,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121490452] [2019-11-20 00:37:42,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:37:42,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:37:42,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446372897] [2019-11-20 00:37:42,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:37:42,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:37:42,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:37:42,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:37:42,901 INFO L87 Difference]: Start difference. First operand 2654 states and 3900 transitions. Second operand 3 states. [2019-11-20 00:37:43,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:37:43,021 INFO L93 Difference]: Finished difference Result 4243 states and 6236 transitions. [2019-11-20 00:37:43,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:37:43,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-11-20 00:37:43,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:37:43,038 INFO L225 Difference]: With dead ends: 4243 [2019-11-20 00:37:43,038 INFO L226 Difference]: Without dead ends: 3183 [2019-11-20 00:37:43,040 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 00:37:43,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3183 states. [2019-11-20 00:37:43,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3183 to 3183. [2019-11-20 00:37:43,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3183 states. [2019-11-20 00:37:43,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 4680 transitions. [2019-11-20 00:37:43,147 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 4680 transitions. Word has length 186 [2019-11-20 00:37:43,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:37:43,147 INFO L462 AbstractCegarLoop]: Abstraction has 3183 states and 4680 transitions. [2019-11-20 00:37:43,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:37:43,148 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 4680 transitions. [2019-11-20 00:37:43,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-11-20 00:37:43,155 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:37:43,156 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-11-20 00:37:43,156 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:37:43,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:37:43,156 INFO L82 PathProgramCache]: Analyzing trace with hash -88686584, now seen corresponding path program 1 times [2019-11-20 00:37:43,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:37:43,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786626362] [2019-11-20 00:37:43,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:37:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:43,231 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 395 proven. 0 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2019-11-20 00:37:43,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786626362] [2019-11-20 00:37:43,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:37:43,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:37:43,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336854360] [2019-11-20 00:37:43,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:37:43,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:37:43,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:37:43,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:37:43,233 INFO L87 Difference]: Start difference. First operand 3183 states and 4680 transitions. Second operand 3 states. [2019-11-20 00:37:43,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:37:43,480 INFO L93 Difference]: Finished difference Result 6419 states and 9421 transitions. [2019-11-20 00:37:43,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:37:43,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 264 [2019-11-20 00:37:43,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:37:43,496 INFO L225 Difference]: With dead ends: 6419 [2019-11-20 00:37:43,496 INFO L226 Difference]: Without dead ends: 3243 [2019-11-20 00:37:43,500 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 00:37:43,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3243 states. [2019-11-20 00:37:43,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3243 to 3183. [2019-11-20 00:37:43,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3183 states. [2019-11-20 00:37:43,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 4632 transitions. [2019-11-20 00:37:43,630 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 4632 transitions. Word has length 264 [2019-11-20 00:37:43,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:37:43,630 INFO L462 AbstractCegarLoop]: Abstraction has 3183 states and 4632 transitions. [2019-11-20 00:37:43,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:37:43,630 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 4632 transitions. [2019-11-20 00:37:43,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-11-20 00:37:43,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:37:43,640 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:37:43,640 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:37:43,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:37:43,640 INFO L82 PathProgramCache]: Analyzing trace with hash -304543522, now seen corresponding path program 1 times [2019-11-20 00:37:43,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:37:43,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040040265] [2019-11-20 00:37:43,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:37:43,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:43,782 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 442 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-11-20 00:37:43,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040040265] [2019-11-20 00:37:43,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:37:43,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:37:43,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947257076] [2019-11-20 00:37:43,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:37:43,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:37:43,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:37:43,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:37:43,785 INFO L87 Difference]: Start difference. First operand 3183 states and 4632 transitions. Second operand 3 states. [2019-11-20 00:37:44,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:37:44,024 INFO L93 Difference]: Finished difference Result 6455 states and 9367 transitions. [2019-11-20 00:37:44,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:37:44,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 268 [2019-11-20 00:37:44,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:37:44,034 INFO L225 Difference]: With dead ends: 6455 [2019-11-20 00:37:44,034 INFO L226 Difference]: Without dead ends: 3279 [2019-11-20 00:37:44,038 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 00:37:44,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3279 states. [2019-11-20 00:37:44,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3279 to 3183. [2019-11-20 00:37:44,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3183 states. [2019-11-20 00:37:44,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 4416 transitions. [2019-11-20 00:37:44,145 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 4416 transitions. Word has length 268 [2019-11-20 00:37:44,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:37:44,146 INFO L462 AbstractCegarLoop]: Abstraction has 3183 states and 4416 transitions. [2019-11-20 00:37:44,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:37:44,146 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 4416 transitions. [2019-11-20 00:37:44,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-11-20 00:37:44,154 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:37:44,154 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-11-20 00:37:44,155 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:37:44,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:37:44,155 INFO L82 PathProgramCache]: Analyzing trace with hash -854799102, now seen corresponding path program 1 times [2019-11-20 00:37:44,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:37:44,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393899089] [2019-11-20 00:37:44,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:37:44,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:44,245 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 382 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2019-11-20 00:37:44,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393899089] [2019-11-20 00:37:44,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:37:44,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:37:44,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55779568] [2019-11-20 00:37:44,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:37:44,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:37:44,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:37:44,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:37:44,247 INFO L87 Difference]: Start difference. First operand 3183 states and 4416 transitions. Second operand 3 states. [2019-11-20 00:37:44,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:37:44,479 INFO L93 Difference]: Finished difference Result 6437 states and 8913 transitions. [2019-11-20 00:37:44,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:37:44,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 278 [2019-11-20 00:37:44,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:37:44,485 INFO L225 Difference]: With dead ends: 6437 [2019-11-20 00:37:44,485 INFO L226 Difference]: Without dead ends: 3261 [2019-11-20 00:37:44,490 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 00:37:44,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3261 states. [2019-11-20 00:37:44,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3261 to 3183. [2019-11-20 00:37:44,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3183 states. [2019-11-20 00:37:44,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 4260 transitions. [2019-11-20 00:37:44,591 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 4260 transitions. Word has length 278 [2019-11-20 00:37:44,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:37:44,591 INFO L462 AbstractCegarLoop]: Abstraction has 3183 states and 4260 transitions. [2019-11-20 00:37:44,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:37:44,592 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 4260 transitions. [2019-11-20 00:37:44,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-11-20 00:37:44,599 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:37:44,600 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 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] [2019-11-20 00:37:44,600 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:37:44,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:37:44,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1536158541, now seen corresponding path program 1 times [2019-11-20 00:37:44,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:37:44,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578495402] [2019-11-20 00:37:44,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:37:44,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:44,711 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 600 proven. 26 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2019-11-20 00:37:44,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578495402] [2019-11-20 00:37:44,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507095940] [2019-11-20 00:37:44,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_965e64b4-4bad-4d9d-858a-51daba7bd5f7/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 00:37:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:44,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 00:37:44,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:37:44,967 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 488 proven. 0 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2019-11-20 00:37:44,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 00:37:44,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-20 00:37:44,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046025663] [2019-11-20 00:37:44,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:37:44,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:37:44,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:37:44,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:37:44,969 INFO L87 Difference]: Start difference. First operand 3183 states and 4260 transitions. Second operand 3 states. [2019-11-20 00:37:45,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:37:45,122 INFO L93 Difference]: Finished difference Result 9373 states and 12524 transitions. [2019-11-20 00:37:45,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:37:45,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 288 [2019-11-20 00:37:45,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:37:45,132 INFO L225 Difference]: With dead ends: 9373 [2019-11-20 00:37:45,132 INFO L226 Difference]: Without dead ends: 6197 [2019-11-20 00:37:45,136 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 288 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 00:37:45,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6197 states. [2019-11-20 00:37:45,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6197 to 6195. [2019-11-20 00:37:45,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6195 states. [2019-11-20 00:37:45,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6195 states to 6195 states and 8256 transitions. [2019-11-20 00:37:45,319 INFO L78 Accepts]: Start accepts. Automaton has 6195 states and 8256 transitions. Word has length 288 [2019-11-20 00:37:45,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:37:45,319 INFO L462 AbstractCegarLoop]: Abstraction has 6195 states and 8256 transitions. [2019-11-20 00:37:45,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:37:45,319 INFO L276 IsEmpty]: Start isEmpty. Operand 6195 states and 8256 transitions. [2019-11-20 00:37:45,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-11-20 00:37:45,330 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:37:45,330 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 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] [2019-11-20 00:37:45,534 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:37:45,534 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:37:45,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:37:45,534 INFO L82 PathProgramCache]: Analyzing trace with hash 2096858319, now seen corresponding path program 1 times [2019-11-20 00:37:45,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:37:45,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381733679] [2019-11-20 00:37:45,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:37:45,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:45,647 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 600 proven. 26 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2019-11-20 00:37:45,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381733679] [2019-11-20 00:37:45,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352362422] [2019-11-20 00:37:45,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_965e64b4-4bad-4d9d-858a-51daba7bd5f7/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 00:37:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:45,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 00:37:45,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:37:45,827 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 600 proven. 26 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2019-11-20 00:37:45,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:37:45,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 00:37:45,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096116897] [2019-11-20 00:37:45,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:37:45,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:37:45,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:37:45,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:37:45,829 INFO L87 Difference]: Start difference. First operand 6195 states and 8256 transitions. Second operand 4 states. [2019-11-20 00:37:46,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:37:46,473 INFO L93 Difference]: Finished difference Result 17795 states and 23500 transitions. [2019-11-20 00:37:46,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 00:37:46,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 288 [2019-11-20 00:37:46,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:37:46,494 INFO L225 Difference]: With dead ends: 17795 [2019-11-20 00:37:46,494 INFO L226 Difference]: Without dead ends: 11451 [2019-11-20 00:37:46,504 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 290 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 00:37:46,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11451 states. [2019-11-20 00:37:46,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11451 to 6339. [2019-11-20 00:37:46,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6339 states. [2019-11-20 00:37:46,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6339 states to 6339 states and 8448 transitions. [2019-11-20 00:37:46,825 INFO L78 Accepts]: Start accepts. Automaton has 6339 states and 8448 transitions. Word has length 288 [2019-11-20 00:37:46,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:37:46,826 INFO L462 AbstractCegarLoop]: Abstraction has 6339 states and 8448 transitions. [2019-11-20 00:37:46,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:37:46,826 INFO L276 IsEmpty]: Start isEmpty. Operand 6339 states and 8448 transitions. [2019-11-20 00:37:46,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-11-20 00:37:46,838 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:37:46,839 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:37:47,042 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:37:47,042 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:37:47,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:37:47,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1896545040, now seen corresponding path program 1 times [2019-11-20 00:37:47,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:37:47,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783483756] [2019-11-20 00:37:47,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:37:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:47,147 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 631 proven. 26 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2019-11-20 00:37:47,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783483756] [2019-11-20 00:37:47,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991186265] [2019-11-20 00:37:47,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_965e64b4-4bad-4d9d-858a-51daba7bd5f7/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 00:37:47,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:47,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 00:37:47,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:37:47,323 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 631 proven. 26 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2019-11-20 00:37:47,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:37:47,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 00:37:47,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588328925] [2019-11-20 00:37:47,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:37:47,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:37:47,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:37:47,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:37:47,325 INFO L87 Difference]: Start difference. First operand 6339 states and 8448 transitions. Second operand 4 states. [2019-11-20 00:37:47,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:37:47,843 INFO L93 Difference]: Finished difference Result 14214 states and 18779 transitions. [2019-11-20 00:37:47,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 00:37:47,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 297 [2019-11-20 00:37:47,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:37:47,855 INFO L225 Difference]: With dead ends: 14214 [2019-11-20 00:37:47,856 INFO L226 Difference]: Without dead ends: 7852 [2019-11-20 00:37:47,863 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 299 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 00:37:47,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7852 states. [2019-11-20 00:37:48,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7852 to 6153. [2019-11-20 00:37:48,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6153 states. [2019-11-20 00:37:48,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6153 states to 6153 states and 8148 transitions. [2019-11-20 00:37:48,063 INFO L78 Accepts]: Start accepts. Automaton has 6153 states and 8148 transitions. Word has length 297 [2019-11-20 00:37:48,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:37:48,063 INFO L462 AbstractCegarLoop]: Abstraction has 6153 states and 8148 transitions. [2019-11-20 00:37:48,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:37:48,063 INFO L276 IsEmpty]: Start isEmpty. Operand 6153 states and 8148 transitions. [2019-11-20 00:37:48,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-11-20 00:37:48,074 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:37:48,074 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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 00:37:48,278 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:37:48,278 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:37:48,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:37:48,279 INFO L82 PathProgramCache]: Analyzing trace with hash -231299850, now seen corresponding path program 1 times [2019-11-20 00:37:48,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:37:48,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748133629] [2019-11-20 00:37:48,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:37:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:48,373 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 560 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2019-11-20 00:37:48,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748133629] [2019-11-20 00:37:48,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:37:48,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:37:48,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524744420] [2019-11-20 00:37:48,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:37:48,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:37:48,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:37:48,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:37:48,375 INFO L87 Difference]: Start difference. First operand 6153 states and 8148 transitions. Second operand 3 states. [2019-11-20 00:37:48,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:37:48,721 INFO L93 Difference]: Finished difference Result 12695 states and 16825 transitions. [2019-11-20 00:37:48,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:37:48,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2019-11-20 00:37:48,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:37:48,731 INFO L225 Difference]: With dead ends: 12695 [2019-11-20 00:37:48,731 INFO L226 Difference]: Without dead ends: 6333 [2019-11-20 00:37:48,738 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 00:37:48,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6333 states. [2019-11-20 00:37:48,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6333 to 6333. [2019-11-20 00:37:48,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6333 states. [2019-11-20 00:37:48,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6333 states to 6333 states and 8322 transitions. [2019-11-20 00:37:48,932 INFO L78 Accepts]: Start accepts. Automaton has 6333 states and 8322 transitions. Word has length 306 [2019-11-20 00:37:48,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:37:48,933 INFO L462 AbstractCegarLoop]: Abstraction has 6333 states and 8322 transitions. [2019-11-20 00:37:48,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:37:48,933 INFO L276 IsEmpty]: Start isEmpty. Operand 6333 states and 8322 transitions. [2019-11-20 00:37:48,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-11-20 00:37:48,945 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:37:48,947 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2019-11-20 00:37:48,947 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:37:48,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:37:48,947 INFO L82 PathProgramCache]: Analyzing trace with hash -707716365, now seen corresponding path program 1 times [2019-11-20 00:37:48,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:37:48,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312796217] [2019-11-20 00:37:48,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:37:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:49,059 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 691 proven. 16 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-11-20 00:37:49,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312796217] [2019-11-20 00:37:49,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351820308] [2019-11-20 00:37:49,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_965e64b4-4bad-4d9d-858a-51daba7bd5f7/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 00:37:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:49,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 00:37:49,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:37:49,242 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 691 proven. 16 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-11-20 00:37:49,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:37:49,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 00:37:49,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721142346] [2019-11-20 00:37:49,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:37:49,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:37:49,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:37:49,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:37:49,244 INFO L87 Difference]: Start difference. First operand 6333 states and 8322 transitions. Second operand 4 states. [2019-11-20 00:37:49,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:37:49,699 INFO L93 Difference]: Finished difference Result 13044 states and 16947 transitions. [2019-11-20 00:37:49,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 00:37:49,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 318 [2019-11-20 00:37:49,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:37:49,708 INFO L225 Difference]: With dead ends: 13044 [2019-11-20 00:37:49,709 INFO L226 Difference]: Without dead ends: 6718 [2019-11-20 00:37:49,716 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 320 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 00:37:49,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6718 states. [2019-11-20 00:37:49,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6718 to 4032. [2019-11-20 00:37:49,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4032 states. [2019-11-20 00:37:49,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4032 states to 4032 states and 5147 transitions. [2019-11-20 00:37:49,858 INFO L78 Accepts]: Start accepts. Automaton has 4032 states and 5147 transitions. Word has length 318 [2019-11-20 00:37:49,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:37:49,859 INFO L462 AbstractCegarLoop]: Abstraction has 4032 states and 5147 transitions. [2019-11-20 00:37:49,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:37:49,859 INFO L276 IsEmpty]: Start isEmpty. Operand 4032 states and 5147 transitions. [2019-11-20 00:37:49,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-11-20 00:37:49,868 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:37:49,869 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2019-11-20 00:37:50,073 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:37:50,073 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:37:50,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:37:50,073 INFO L82 PathProgramCache]: Analyzing trace with hash -899029058, now seen corresponding path program 1 times [2019-11-20 00:37:50,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:37:50,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647740192] [2019-11-20 00:37:50,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:37:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:50,175 INFO L134 CoverageAnalysis]: Checked inductivity of 971 backedges. 563 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-11-20 00:37:50,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647740192] [2019-11-20 00:37:50,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:37:50,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:37:50,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452656580] [2019-11-20 00:37:50,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:37:50,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:37:50,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:37:50,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:37:50,178 INFO L87 Difference]: Start difference. First operand 4032 states and 5147 transitions. Second operand 3 states. [2019-11-20 00:37:50,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:37:50,456 INFO L93 Difference]: Finished difference Result 8177 states and 10418 transitions. [2019-11-20 00:37:50,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:37:50,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2019-11-20 00:37:50,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:37:50,463 INFO L225 Difference]: With dead ends: 8177 [2019-11-20 00:37:50,463 INFO L226 Difference]: Without dead ends: 4152 [2019-11-20 00:37:50,467 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 00:37:50,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4152 states. [2019-11-20 00:37:50,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4152 to 4032. [2019-11-20 00:37:50,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4032 states. [2019-11-20 00:37:50,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4032 states to 4032 states and 5069 transitions. [2019-11-20 00:37:50,680 INFO L78 Accepts]: Start accepts. Automaton has 4032 states and 5069 transitions. Word has length 321 [2019-11-20 00:37:50,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:37:50,681 INFO L462 AbstractCegarLoop]: Abstraction has 4032 states and 5069 transitions. [2019-11-20 00:37:50,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:37:50,681 INFO L276 IsEmpty]: Start isEmpty. Operand 4032 states and 5069 transitions. [2019-11-20 00:37:50,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-11-20 00:37:50,690 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:37:50,690 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:37:50,691 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:37:50,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:37:50,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1605204832, now seen corresponding path program 1 times [2019-11-20 00:37:50,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:37:50,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734966644] [2019-11-20 00:37:50,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:37:50,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:50,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1358 backedges. 674 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-11-20 00:37:50,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734966644] [2019-11-20 00:37:50,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:37:50,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:37:50,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47640780] [2019-11-20 00:37:50,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:37:50,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:37:50,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:37:50,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:37:50,806 INFO L87 Difference]: Start difference. First operand 4032 states and 5069 transitions. Second operand 3 states. [2019-11-20 00:37:51,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:37:51,017 INFO L93 Difference]: Finished difference Result 7108 states and 8996 transitions. [2019-11-20 00:37:51,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:37:51,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 364 [2019-11-20 00:37:51,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:37:51,023 INFO L225 Difference]: With dead ends: 7108 [2019-11-20 00:37:51,023 INFO L226 Difference]: Without dead ends: 4088 [2019-11-20 00:37:51,029 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 00:37:51,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4088 states. [2019-11-20 00:37:51,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4088 to 4032. [2019-11-20 00:37:51,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4032 states. [2019-11-20 00:37:51,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4032 states to 4032 states and 5063 transitions. [2019-11-20 00:37:51,153 INFO L78 Accepts]: Start accepts. Automaton has 4032 states and 5063 transitions. Word has length 364 [2019-11-20 00:37:51,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:37:51,154 INFO L462 AbstractCegarLoop]: Abstraction has 4032 states and 5063 transitions. [2019-11-20 00:37:51,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:37:51,154 INFO L276 IsEmpty]: Start isEmpty. Operand 4032 states and 5063 transitions. [2019-11-20 00:37:51,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-11-20 00:37:51,164 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:37:51,164 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 7, 7, 7, 7, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:37:51,165 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:37:51,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:37:51,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1700300854, now seen corresponding path program 1 times [2019-11-20 00:37:51,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:37:51,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296986654] [2019-11-20 00:37:51,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:37:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:51,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 863 proven. 0 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2019-11-20 00:37:51,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296986654] [2019-11-20 00:37:51,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:37:51,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:37:51,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204060635] [2019-11-20 00:37:51,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:37:51,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:37:51,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:37:51,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:37:51,297 INFO L87 Difference]: Start difference. First operand 4032 states and 5063 transitions. Second operand 3 states. [2019-11-20 00:37:51,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:37:51,527 INFO L93 Difference]: Finished difference Result 7064 states and 8910 transitions. [2019-11-20 00:37:51,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:37:51,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 387 [2019-11-20 00:37:51,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:37:51,534 INFO L225 Difference]: With dead ends: 7064 [2019-11-20 00:37:51,534 INFO L226 Difference]: Without dead ends: 4044 [2019-11-20 00:37:51,536 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 00:37:51,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4044 states. [2019-11-20 00:37:51,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4044 to 4032. [2019-11-20 00:37:51,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4032 states. [2019-11-20 00:37:51,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4032 states to 4032 states and 5057 transitions. [2019-11-20 00:37:51,665 INFO L78 Accepts]: Start accepts. Automaton has 4032 states and 5057 transitions. Word has length 387 [2019-11-20 00:37:51,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:37:51,666 INFO L462 AbstractCegarLoop]: Abstraction has 4032 states and 5057 transitions. [2019-11-20 00:37:51,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:37:51,666 INFO L276 IsEmpty]: Start isEmpty. Operand 4032 states and 5057 transitions. [2019-11-20 00:37:51,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-11-20 00:37:51,676 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:37:51,677 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 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 00:37:51,677 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:37:51,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:37:51,677 INFO L82 PathProgramCache]: Analyzing trace with hash -510666558, now seen corresponding path program 1 times [2019-11-20 00:37:51,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:37:51,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334707385] [2019-11-20 00:37:51,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:37:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:51,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 868 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-11-20 00:37:51,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334707385] [2019-11-20 00:37:51,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:37:51,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:37:51,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723129028] [2019-11-20 00:37:51,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:37:51,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:37:51,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:37:51,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:37:51,807 INFO L87 Difference]: Start difference. First operand 4032 states and 5057 transitions. Second operand 3 states. [2019-11-20 00:37:51,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:37:51,998 INFO L93 Difference]: Finished difference Result 7517 states and 9443 transitions. [2019-11-20 00:37:51,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:37:51,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 387 [2019-11-20 00:37:51,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:37:52,004 INFO L225 Difference]: With dead ends: 7517 [2019-11-20 00:37:52,004 INFO L226 Difference]: Without dead ends: 3371 [2019-11-20 00:37:52,006 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 00:37:52,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3371 states. [2019-11-20 00:37:52,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3371 to 3282. [2019-11-20 00:37:52,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3282 states. [2019-11-20 00:37:52,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3282 states to 3282 states and 4095 transitions. [2019-11-20 00:37:52,174 INFO L78 Accepts]: Start accepts. Automaton has 3282 states and 4095 transitions. Word has length 387 [2019-11-20 00:37:52,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:37:52,174 INFO L462 AbstractCegarLoop]: Abstraction has 3282 states and 4095 transitions. [2019-11-20 00:37:52,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:37:52,174 INFO L276 IsEmpty]: Start isEmpty. Operand 3282 states and 4095 transitions. [2019-11-20 00:37:52,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-11-20 00:37:52,186 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:37:52,186 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 8, 8, 8, 8, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:37:52,186 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:37:52,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:37:52,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1519747608, now seen corresponding path program 1 times [2019-11-20 00:37:52,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:37:52,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590558513] [2019-11-20 00:37:52,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:37:52,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:52,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1898 backedges. 518 proven. 22 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-11-20 00:37:52,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590558513] [2019-11-20 00:37:52,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963377107] [2019-11-20 00:37:52,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_965e64b4-4bad-4d9d-858a-51daba7bd5f7/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 00:37:52,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:37:52,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 00:37:52,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:37:52,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1898 backedges. 518 proven. 22 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-11-20 00:37:52,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:37:52,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 00:37:52,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939814992] [2019-11-20 00:37:52,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:37:52,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:37:52,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:37:52,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:37:52,618 INFO L87 Difference]: Start difference. First operand 3282 states and 4095 transitions. Second operand 4 states. [2019-11-20 00:37:52,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:37:52,845 INFO L93 Difference]: Finished difference Result 5377 states and 6760 transitions. [2019-11-20 00:37:52,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:37:52,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 421 [2019-11-20 00:37:52,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:37:52,846 INFO L225 Difference]: With dead ends: 5377 [2019-11-20 00:37:52,846 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 00:37:52,850 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 423 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 00:37:52,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 00:37:52,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 00:37:52,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 00:37:52,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 00:37:52,852 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 421 [2019-11-20 00:37:52,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:37:52,854 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 00:37:52,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:37:52,854 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 00:37:52,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 00:37:53,058 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:37:53,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 00:37:53,180 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 112 [2019-11-20 00:37:53,290 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 131 [2019-11-20 00:37:53,419 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 132 [2019-11-20 00:37:53,646 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 155 [2019-11-20 00:37:56,440 WARN L191 SmtUtils]: Spent 2.69 s on a formula simplification. DAG size of input: 618 DAG size of output: 420 [2019-11-20 00:37:56,549 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 121 [2019-11-20 00:37:56,838 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 155 [2019-11-20 00:37:58,616 WARN L191 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 618 DAG size of output: 420 [2019-11-20 00:37:59,850 WARN L191 SmtUtils]: Spent 755.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 52 [2019-11-20 00:38:00,607 WARN L191 SmtUtils]: Spent 754.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 79 [2019-11-20 00:38:01,150 WARN L191 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 21 [2019-11-20 00:38:01,758 WARN L191 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 21 [2019-11-20 00:38:02,178 WARN L191 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 52 [2019-11-20 00:38:07,834 WARN L191 SmtUtils]: Spent 5.65 s on a formula simplification. DAG size of input: 362 DAG size of output: 107 [2019-11-20 00:38:08,403 WARN L191 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 43 [2019-11-20 00:38:08,864 WARN L191 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 24 [2019-11-20 00:38:09,160 WARN L191 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 23 [2019-11-20 00:38:09,339 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 54 [2019-11-20 00:38:09,857 WARN L191 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 36 [2019-11-20 00:38:13,949 WARN L191 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 362 DAG size of output: 107 [2019-11-20 00:38:14,334 WARN L191 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 29 [2019-11-20 00:38:14,724 WARN L191 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 62 [2019-11-20 00:38:15,185 WARN L191 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 24 [2019-11-20 00:38:15,533 WARN L191 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 52 [2019-11-20 00:38:15,968 WARN L191 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 28 [2019-11-20 00:38:16,293 WARN L191 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 52 [2019-11-20 00:38:16,628 WARN L191 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 38 [2019-11-20 00:38:17,029 WARN L191 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 24 [2019-11-20 00:38:17,464 WARN L191 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 58 [2019-11-20 00:38:17,466 INFO L444 ceAbstractionStarter]: For program point L597(lines 597 602) no Hoare annotation was computed. [2019-11-20 00:38:17,466 INFO L444 ceAbstractionStarter]: For program point L597-2(lines 596 610) no Hoare annotation was computed. [2019-11-20 00:38:17,466 INFO L444 ceAbstractionStarter]: For program point L465(lines 465 467) no Hoare annotation was computed. [2019-11-20 00:38:17,466 INFO L440 ceAbstractionStarter]: At program point L201(lines 197 562) the Hoare annotation is: (let ((.cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 4)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (and .cse0 .cse1 (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2))) [2019-11-20 00:38:17,466 INFO L440 ceAbstractionStarter]: At program point L102(lines 101 594) the Hoare annotation is: false [2019-11-20 00:38:17,467 INFO L444 ceAbstractionStarter]: For program point L499(lines 499 502) no Hoare annotation was computed. [2019-11-20 00:38:17,467 INFO L444 ceAbstractionStarter]: For program point L599(lines 599 601) no Hoare annotation was computed. [2019-11-20 00:38:17,467 INFO L444 ceAbstractionStarter]: For program point L434-1(lines 434 442) no Hoare annotation was computed. [2019-11-20 00:38:17,467 INFO L444 ceAbstractionStarter]: For program point L335(lines 335 372) no Hoare annotation was computed. [2019-11-20 00:38:17,467 INFO L444 ceAbstractionStarter]: For program point L335-1(lines 335 372) no Hoare annotation was computed. [2019-11-20 00:38:17,467 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 560) no Hoare annotation was computed. [2019-11-20 00:38:17,467 INFO L444 ceAbstractionStarter]: For program point L170(lines 170 571) no Hoare annotation was computed. [2019-11-20 00:38:17,467 INFO L444 ceAbstractionStarter]: For program point L137(lines 137 582) no Hoare annotation was computed. [2019-11-20 00:38:17,467 INFO L444 ceAbstractionStarter]: For program point L104(lines 104 593) no Hoare annotation was computed. [2019-11-20 00:38:17,467 INFO L440 ceAbstractionStarter]: At program point L402(lines 393 414) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (<= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4))) [2019-11-20 00:38:17,467 INFO L444 ceAbstractionStarter]: For program point L336(lines 336 369) no Hoare annotation was computed. [2019-11-20 00:38:17,468 INFO L444 ceAbstractionStarter]: For program point L303(lines 303 313) no Hoare annotation was computed. [2019-11-20 00:38:17,468 INFO L444 ceAbstractionStarter]: For program point L303-2(lines 303 313) no Hoare annotation was computed. [2019-11-20 00:38:17,468 INFO L440 ceAbstractionStarter]: At program point L204(lines 203 560) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) [2019-11-20 00:38:17,468 INFO L440 ceAbstractionStarter]: At program point L171(lines 167 572) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (<= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse8 .cse9 .cse10 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-11-20 00:38:17,468 INFO L440 ceAbstractionStarter]: At program point L138(lines 134 583) the Hoare annotation is: (let ((.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)) (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse10 .cse11 .cse12)))) [2019-11-20 00:38:17,468 INFO L444 ceAbstractionStarter]: For program point L535(lines 535 539) no Hoare annotation was computed. [2019-11-20 00:38:17,468 INFO L444 ceAbstractionStarter]: For program point L535-2(lines 535 539) no Hoare annotation was computed. [2019-11-20 00:38:17,468 INFO L444 ceAbstractionStarter]: For program point L437(lines 437 440) no Hoare annotation was computed. [2019-11-20 00:38:17,468 INFO L440 ceAbstractionStarter]: At program point L206(lines 205 560) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) [2019-11-20 00:38:17,469 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 570) no Hoare annotation was computed. [2019-11-20 00:38:17,469 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 581) no Hoare annotation was computed. [2019-11-20 00:38:17,469 INFO L444 ceAbstractionStarter]: For program point L107(lines 107 592) no Hoare annotation was computed. [2019-11-20 00:38:17,469 INFO L447 ceAbstractionStarter]: At program point L636(lines 627 638) the Hoare annotation is: true [2019-11-20 00:38:17,469 INFO L444 ceAbstractionStarter]: For program point L504(lines 504 514) no Hoare annotation was computed. [2019-11-20 00:38:17,469 INFO L444 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2019-11-20 00:38:17,469 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 275) no Hoare annotation was computed. [2019-11-20 00:38:17,469 INFO L444 ceAbstractionStarter]: For program point L273-2(lines 207 557) no Hoare annotation was computed. [2019-11-20 00:38:17,469 INFO L444 ceAbstractionStarter]: For program point L604(lines 604 608) no Hoare annotation was computed. [2019-11-20 00:38:17,469 INFO L444 ceAbstractionStarter]: For program point L307(lines 307 309) no Hoare annotation was computed. [2019-11-20 00:38:17,469 INFO L444 ceAbstractionStarter]: For program point L307-2(lines 305 313) no Hoare annotation was computed. [2019-11-20 00:38:17,469 INFO L444 ceAbstractionStarter]: For program point L341(lines 341 367) no Hoare annotation was computed. [2019-11-20 00:38:17,469 INFO L444 ceAbstractionStarter]: For program point L242(lines 242 252) no Hoare annotation was computed. [2019-11-20 00:38:17,469 INFO L444 ceAbstractionStarter]: For program point L176(lines 176 569) no Hoare annotation was computed. [2019-11-20 00:38:17,470 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 580) no Hoare annotation was computed. [2019-11-20 00:38:17,470 INFO L444 ceAbstractionStarter]: For program point L110(lines 110 591) no Hoare annotation was computed. [2019-11-20 00:38:17,470 INFO L444 ceAbstractionStarter]: For program point L507(lines 507 513) no Hoare annotation was computed. [2019-11-20 00:38:17,470 INFO L444 ceAbstractionStarter]: For program point L474(lines 474 476) no Hoare annotation was computed. [2019-11-20 00:38:17,470 INFO L444 ceAbstractionStarter]: For program point L408(lines 408 410) no Hoare annotation was computed. [2019-11-20 00:38:17,470 INFO L444 ceAbstractionStarter]: For program point L243(lines 243 246) no Hoare annotation was computed. [2019-11-20 00:38:17,470 INFO L440 ceAbstractionStarter]: At program point L210(lines 104 593) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (or (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0) .cse1 .cse2) (and (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0) .cse2) .cse1))) [2019-11-20 00:38:17,471 INFO L440 ceAbstractionStarter]: At program point L177(lines 173 570) the Hoare annotation is: (let ((.cse1 (<= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (or (and .cse0 (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2) .cse0))) [2019-11-20 00:38:17,471 INFO L440 ceAbstractionStarter]: At program point L144(lines 140 581) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse13 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13) (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13))) [2019-11-20 00:38:17,471 INFO L444 ceAbstractionStarter]: For program point L344(lines 344 348) no Hoare annotation was computed. [2019-11-20 00:38:17,471 INFO L444 ceAbstractionStarter]: For program point L344-2(lines 344 348) no Hoare annotation was computed. [2019-11-20 00:38:17,471 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 568) no Hoare annotation was computed. [2019-11-20 00:38:17,471 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 579) no Hoare annotation was computed. [2019-11-20 00:38:17,471 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 590) no Hoare annotation was computed. [2019-11-20 00:38:17,471 INFO L444 ceAbstractionStarter]: For program point L510(lines 510 512) no Hoare annotation was computed. [2019-11-20 00:38:17,472 INFO L444 ceAbstractionStarter]: For program point L510-2(lines 207 557) no Hoare annotation was computed. [2019-11-20 00:38:17,472 INFO L444 ceAbstractionStarter]: For program point L81(lines 81 87) no Hoare annotation was computed. [2019-11-20 00:38:17,472 INFO L444 ceAbstractionStarter]: For program point L545(lines 545 551) no Hoare annotation was computed. [2019-11-20 00:38:17,472 INFO L444 ceAbstractionStarter]: For program point L545-1(lines 545 551) no Hoare annotation was computed. [2019-11-20 00:38:17,472 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 217) no Hoare annotation was computed. [2019-11-20 00:38:17,472 INFO L444 ceAbstractionStarter]: For program point L182(lines 182 567) no Hoare annotation was computed. [2019-11-20 00:38:17,472 INFO L444 ceAbstractionStarter]: For program point L149(lines 149 578) no Hoare annotation was computed. [2019-11-20 00:38:17,472 INFO L444 ceAbstractionStarter]: For program point L215-2(lines 215 217) no Hoare annotation was computed. [2019-11-20 00:38:17,472 INFO L444 ceAbstractionStarter]: For program point L116(lines 116 589) no Hoare annotation was computed. [2019-11-20 00:38:17,472 INFO L444 ceAbstractionStarter]: For program point L381(lines 381 416) no Hoare annotation was computed. [2019-11-20 00:38:17,472 INFO L440 ceAbstractionStarter]: At program point L183(lines 179 568) the Hoare annotation is: (let ((.cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (<= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse5 (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8)))) [2019-11-20 00:38:17,473 INFO L440 ceAbstractionStarter]: At program point L150(lines 146 579) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse13 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13) (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13))) [2019-11-20 00:38:17,473 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 86) no Hoare annotation was computed. [2019-11-20 00:38:17,473 INFO L444 ceAbstractionStarter]: For program point L84-2(lines 81 87) no Hoare annotation was computed. [2019-11-20 00:38:17,473 INFO L444 ceAbstractionStarter]: For program point L448(lines 448 450) no Hoare annotation was computed. [2019-11-20 00:38:17,473 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 388) no Hoare annotation was computed. [2019-11-20 00:38:17,473 INFO L447 ceAbstractionStarter]: At program point L614(lines 97 615) the Hoare annotation is: true [2019-11-20 00:38:17,473 INFO L444 ceAbstractionStarter]: For program point L548(lines 548 550) no Hoare annotation was computed. [2019-11-20 00:38:17,473 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 00:38:17,473 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 566) no Hoare annotation was computed. [2019-11-20 00:38:17,474 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 577) no Hoare annotation was computed. [2019-11-20 00:38:17,474 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 588) no Hoare annotation was computed. [2019-11-20 00:38:17,474 INFO L444 ceAbstractionStarter]: For program point L483(lines 483 485) no Hoare annotation was computed. [2019-11-20 00:38:17,474 INFO L440 ceAbstractionStarter]: At program point L120(lines 116 589) the Hoare annotation is: (let ((.cse1 (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)))) (.cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3 .cse4) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse4 .cse0 .cse3))) [2019-11-20 00:38:17,474 INFO L440 ceAbstractionStarter]: At program point L484(lines 71 625) the Hoare annotation is: false [2019-11-20 00:38:17,474 INFO L444 ceAbstractionStarter]: For program point L451(lines 451 460) no Hoare annotation was computed. [2019-11-20 00:38:17,474 INFO L444 ceAbstractionStarter]: For program point L352(lines 352 363) no Hoare annotation was computed. [2019-11-20 00:38:17,474 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 288) no Hoare annotation was computed. [2019-11-20 00:38:17,474 INFO L444 ceAbstractionStarter]: For program point L220(lines 220 222) no Hoare annotation was computed. [2019-11-20 00:38:17,474 INFO L444 ceAbstractionStarter]: For program point L286-2(lines 207 557) no Hoare annotation was computed. [2019-11-20 00:38:17,475 INFO L440 ceAbstractionStarter]: At program point L353(lines 329 374) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse13 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13) (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13))) [2019-11-20 00:38:17,475 INFO L444 ceAbstractionStarter]: For program point L188(lines 188 565) no Hoare annotation was computed. [2019-11-20 00:38:17,475 INFO L444 ceAbstractionStarter]: For program point L155(lines 155 576) no Hoare annotation was computed. [2019-11-20 00:38:17,475 INFO L444 ceAbstractionStarter]: For program point L122(lines 122 587) no Hoare annotation was computed. [2019-11-20 00:38:17,475 INFO L444 ceAbstractionStarter]: For program point L89(lines 89 93) no Hoare annotation was computed. [2019-11-20 00:38:17,475 INFO L444 ceAbstractionStarter]: For program point L89-1(lines 71 625) no Hoare annotation was computed. [2019-11-20 00:38:17,475 INFO L444 ceAbstractionStarter]: For program point L486(lines 486 488) no Hoare annotation was computed. [2019-11-20 00:38:17,476 INFO L440 ceAbstractionStarter]: At program point L189(lines 185 566) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse3 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 4)) (.cse4 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse0 .cse1 .cse2 .cse3) (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2) .cse3) (and (and .cse2 (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4)) .cse3) (and .cse1 .cse2 .cse3 (and .cse0 .cse4)))) [2019-11-20 00:38:17,476 INFO L440 ceAbstractionStarter]: At program point L156(lines 152 577) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (<= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4))) [2019-11-20 00:38:17,476 INFO L440 ceAbstractionStarter]: At program point L123(lines 122 587) the Hoare annotation is: (let ((.cse11 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse14 .cse15) (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15)) (and .cse0 (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15)))) [2019-11-20 00:38:17,476 INFO L444 ceAbstractionStarter]: For program point L90(lines 90 92) no Hoare annotation was computed. [2019-11-20 00:38:17,476 INFO L444 ceAbstractionStarter]: For program point L619(lines 619 621) no Hoare annotation was computed. [2019-11-20 00:38:17,476 INFO L444 ceAbstractionStarter]: For program point L619-2(lines 619 621) no Hoare annotation was computed. [2019-11-20 00:38:17,476 INFO L444 ceAbstractionStarter]: For program point L520(lines 520 523) no Hoare annotation was computed. [2019-11-20 00:38:17,476 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 357) no Hoare annotation was computed. [2019-11-20 00:38:17,476 INFO L444 ceAbstractionStarter]: For program point L355-2(lines 352 361) no Hoare annotation was computed. [2019-11-20 00:38:17,476 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 00:38:17,476 INFO L444 ceAbstractionStarter]: For program point L455(lines 455 457) no Hoare annotation was computed. [2019-11-20 00:38:17,477 INFO L444 ceAbstractionStarter]: For program point L323(lines 323 327) no Hoare annotation was computed. [2019-11-20 00:38:17,477 INFO L444 ceAbstractionStarter]: For program point L323-2(lines 207 557) no Hoare annotation was computed. [2019-11-20 00:38:17,477 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 564) no Hoare annotation was computed. [2019-11-20 00:38:17,477 INFO L444 ceAbstractionStarter]: For program point L158(lines 158 575) no Hoare annotation was computed. [2019-11-20 00:38:17,477 INFO L444 ceAbstractionStarter]: For program point L125(lines 125 586) no Hoare annotation was computed. [2019-11-20 00:38:17,477 INFO L444 ceAbstractionStarter]: For program point L489(lines 489 493) no Hoare annotation was computed. [2019-11-20 00:38:17,477 INFO L444 ceAbstractionStarter]: For program point L489-2(lines 489 493) no Hoare annotation was computed. [2019-11-20 00:38:17,478 INFO L440 ceAbstractionStarter]: At program point L390(lines 381 416) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (<= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4))) [2019-11-20 00:38:17,478 INFO L444 ceAbstractionStarter]: For program point L258(lines 258 260) no Hoare annotation was computed. [2019-11-20 00:38:17,478 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 236) no Hoare annotation was computed. [2019-11-20 00:38:17,478 INFO L444 ceAbstractionStarter]: For program point L225-2(lines 207 557) no Hoare annotation was computed. [2019-11-20 00:38:17,478 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 296) no Hoare annotation was computed. [2019-11-20 00:38:17,478 INFO L444 ceAbstractionStarter]: For program point L292-2(lines 292 296) no Hoare annotation was computed. [2019-11-20 00:38:17,478 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 00:38:17,478 INFO L444 ceAbstractionStarter]: For program point L227(lines 227 230) no Hoare annotation was computed. [2019-11-20 00:38:17,479 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 563) no Hoare annotation was computed. [2019-11-20 00:38:17,479 INFO L444 ceAbstractionStarter]: For program point L161(lines 161 574) no Hoare annotation was computed. [2019-11-20 00:38:17,479 INFO L444 ceAbstractionStarter]: For program point L128(lines 128 585) no Hoare annotation was computed. [2019-11-20 00:38:17,479 INFO L447 ceAbstractionStarter]: At program point L624(lines 10 626) the Hoare annotation is: true [2019-11-20 00:38:17,480 INFO L440 ceAbstractionStarter]: At program point L558(lines 98 613) the Hoare annotation is: (let ((.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse10 (<= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse22 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse28 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse27 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse23 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 4)) (.cse29 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse6 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse30 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse24 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7)) (.cse25 (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse20 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (and (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14) (and (and .cse6 .cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) .cse7 .cse8 .cse9 .cse16 .cse17 .cse13 .cse18 .cse19 .cse20 .cse21) .cse4) (and .cse4 .cse5 .cse22 .cse23 .cse3) (and .cse4 (and .cse6 .cse15 .cse8 .cse16 .cse17 .cse13 .cse2 .cse18 .cse19 .cse20 .cse21)) (and .cse0 .cse1 .cse23) (and .cse8 .cse10 .cse14 .cse24 .cse25 .cse11 .cse12 .cse13 .cse2) (and .cse4 (and .cse15 .cse8 .cse16 .cse17 .cse24 .cse25 .cse13 .cse2 .cse18 .cse19 .cse20 .cse21)) (and (and .cse6 .cse26 .cse1 .cse27) .cse28) (and .cse0 .cse1 .cse25 .cse2) (and .cse29 .cse22 .cse23 .cse3) (and .cse29 .cse6) (and .cse22 .cse23 .cse3 .cse14 .cse28) (and (and .cse26 .cse1 .cse24 .cse27 .cse25 .cse2) .cse28) (and .cse29 (and .cse24 .cse25 .cse2)) (and .cse26 .cse28 .cse1 .cse27 .cse23 .cse2 .cse3) (and .cse29 .cse2 .cse3) (and .cse6 .cse30 .cse20 .cse2) (and .cse30 .cse24 .cse25 .cse20 .cse2))) [2019-11-20 00:38:17,480 INFO L444 ceAbstractionStarter]: For program point L426(lines 426 428) no Hoare annotation was computed. [2019-11-20 00:38:17,480 INFO L444 ceAbstractionStarter]: For program point L393(lines 393 414) no Hoare annotation was computed. [2019-11-20 00:38:17,480 INFO L440 ceAbstractionStarter]: At program point L195(lines 191 564) the Hoare annotation is: (let ((.cse4 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse5 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and (and .cse0 (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse1 .cse2 .cse3) .cse4) .cse5) (and (and .cse0 (and .cse1 .cse2 .cse3) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) .cse4) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse5) (and (and .cse0 (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3)) .cse5))) [2019-11-20 00:38:17,481 INFO L440 ceAbstractionStarter]: At program point L162(lines 158 575) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse1 (<= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3 .cse4) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4))) [2019-11-20 00:38:17,481 INFO L444 ceAbstractionStarter]: For program point L394(lines 394 400) no Hoare annotation was computed. [2019-11-20 00:38:17,481 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 562) no Hoare annotation was computed. [2019-11-20 00:38:17,482 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 573) no Hoare annotation was computed. [2019-11-20 00:38:17,482 INFO L444 ceAbstractionStarter]: For program point L131(lines 131 584) no Hoare annotation was computed. [2019-11-20 00:38:17,482 INFO L440 ceAbstractionStarter]: At program point L98-2(lines 98 613) the Hoare annotation is: (let ((.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse10 (<= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse22 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse28 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse27 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse23 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 4)) (.cse29 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse6 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse30 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse24 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7)) (.cse25 (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse20 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (and (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14) (and (and .cse6 .cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) .cse7 .cse8 .cse9 .cse16 .cse17 .cse13 .cse18 .cse19 .cse20 .cse21) .cse4) (and .cse4 .cse5 .cse22 .cse23 .cse3) (and .cse4 (and .cse6 .cse15 .cse8 .cse16 .cse17 .cse13 .cse2 .cse18 .cse19 .cse20 .cse21)) (and .cse0 .cse1 .cse23) (and .cse8 .cse10 .cse14 .cse24 .cse25 .cse11 .cse12 .cse13 .cse2) (and .cse4 (and .cse15 .cse8 .cse16 .cse17 .cse24 .cse25 .cse13 .cse2 .cse18 .cse19 .cse20 .cse21)) (and (and .cse6 .cse26 .cse1 .cse27) .cse28) (and .cse0 .cse1 .cse25 .cse2) (and .cse29 .cse22 .cse23 .cse3) (and .cse29 .cse6) (and .cse22 .cse23 .cse3 .cse14 .cse28) (and (and .cse26 .cse1 .cse24 .cse27 .cse25 .cse2) .cse28) (and .cse29 (and .cse24 .cse25 .cse2)) (and .cse26 .cse28 .cse1 .cse27 .cse23 .cse2 .cse3) (and .cse29 .cse2 .cse3) (and .cse6 .cse30 .cse20 .cse2) (and .cse30 .cse24 .cse25 .cse20 .cse2))) [2019-11-20 00:38:17,482 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 623) no Hoare annotation was computed. [2019-11-20 00:38:17,483 INFO L444 ceAbstractionStarter]: For program point L528(lines 528 530) no Hoare annotation was computed. [2019-11-20 00:38:17,483 INFO L444 ceAbstractionStarter]: For program point L528-2(lines 207 557) no Hoare annotation was computed. [2019-11-20 00:38:17,483 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 234) no Hoare annotation was computed. [2019-11-20 00:38:17,484 INFO L440 ceAbstractionStarter]: At program point L165(lines 164 573) the Hoare annotation is: (let ((.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (and .cse0 .cse1 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)))) [2019-11-20 00:38:17,484 INFO L440 ceAbstractionStarter]: At program point L132(lines 125 586) the Hoare annotation is: (let ((.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse11 .cse12 .cse13 .cse14)) (and .cse0 (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)))) [2019-11-20 00:38:17,484 INFO L444 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-20 00:38:17,484 INFO L444 ceAbstractionStarter]: For program point L595(lines 595 611) no Hoare annotation was computed. [2019-11-20 00:38:17,484 INFO L444 ceAbstractionStarter]: For program point L596(lines 596 610) no Hoare annotation was computed. [2019-11-20 00:38:17,485 INFO L444 ceAbstractionStarter]: For program point L332(lines 332 373) no Hoare annotation was computed. [2019-11-20 00:38:17,485 INFO L444 ceAbstractionStarter]: For program point L200(lines 200 561) no Hoare annotation was computed. [2019-11-20 00:38:17,485 INFO L444 ceAbstractionStarter]: For program point L167(lines 167 572) no Hoare annotation was computed. [2019-11-20 00:38:17,485 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 583) no Hoare annotation was computed. [2019-11-20 00:38:17,485 INFO L444 ceAbstractionStarter]: For program point L101(lines 101 594) no Hoare annotation was computed. [2019-11-20 00:38:17,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:38:17 BoogieIcfgContainer [2019-11-20 00:38:17,551 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 00:38:17,552 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 00:38:17,552 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 00:38:17,552 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 00:38:17,552 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:37:35" (3/4) ... [2019-11-20 00:38:17,555 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 00:38:17,579 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-20 00:38:17,580 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 00:38:17,687 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_965e64b4-4bad-4d9d-858a-51daba7bd5f7/bin/uautomizer/witness.graphml [2019-11-20 00:38:17,688 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 00:38:17,689 INFO L168 Benchmark]: Toolchain (without parser) took 43924.49 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.7 GB). Free memory was 951.4 MB in the beginning and 1.8 GB in the end (delta: -836.0 MB). Peak memory consumption was 853.8 MB. Max. memory is 11.5 GB. [2019-11-20 00:38:17,689 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:38:17,689 INFO L168 Benchmark]: CACSL2BoogieTranslator took 393.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -172.2 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-11-20 00:38:17,690 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-20 00:38:17,690 INFO L168 Benchmark]: Boogie Preprocessor took 67.25 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.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-20 00:38:17,690 INFO L168 Benchmark]: RCFGBuilder took 772.50 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: 64.8 MB). Peak memory consumption was 64.8 MB. Max. memory is 11.5 GB. [2019-11-20 00:38:17,691 INFO L168 Benchmark]: TraceAbstraction took 42493.27 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -749.5 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-11-20 00:38:17,691 INFO L168 Benchmark]: Witness Printer took 135.99 ms. Allocated memory is still 2.7 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 11.5 GB. [2019-11-20 00:38:17,693 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 393.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -172.2 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 67.25 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.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 772.50 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: 64.8 MB). Peak memory consumption was 64.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 42493.27 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -749.5 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 135.99 ms. Allocated memory is still 2.7 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 623]: 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: 71]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: (((((((((((((((!(s__state == 8528) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8496)) && blastFlag <= 7) && 6 <= blastFlag) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state) || ((((((((((((((blastFlag <= 2 && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8496)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: (s__state <= 8640 && (((blastFlag <= 7 && 6 <= blastFlag) && 8544 <= s__state) && ((((((((((((((((((!(s__state == 8608) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8609)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8641)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8480)) && 0 == s__hit) || (((blastFlag <= 2 && 8544 <= s__state) && ((((((((((((((((((!(s__state == 8608) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8609)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8641)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8480)) && s__state <= 8640) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: ((((blastFlag <= 7 && 6 <= blastFlag) && !(s__state == 8448)) && s__state <= 8448) && 0 == s__hit) || (((blastFlag <= 2 && !(s__state == 8448)) && 0 == s__hit) && s__state <= 8448) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: (((8672 <= s__state && !(s__state == 12292)) && blastFlag <= 4) || (((8672 <= s__state && !(s__state == 12292)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8640)) || (((8672 <= s__state && !(s__state == 12292)) && 6 <= blastFlag) && 0 == s__hit) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (8448 <= s__state && (((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8545)) && !(s__state == 8448)) && s__state <= 8576) && !(s__state == 8480)) || (8448 <= s__state && (((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && blastFlag <= 7) && 6 <= blastFlag) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8448)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: (((((((((((((((((((((8672 <= s__state && s__state <= 8672) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8640) || (((8448 <= s__state && s__state <= 8448) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3)) || ((((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && 8544 <= s__state) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__state <= 8640)) || ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state)) || ((((8448 <= s__state && s__state <= 8448) && 8640 <= s__s3__tmp__next_state___0) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640)) || (8448 <= s__state && (((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || ((8672 <= s__state && s__state <= 8672) && blastFlag <= 4)) || ((((((((!(s__state == 8561) && 8544 <= s__state) && s__state <= 8640) && blastFlag <= 7) && 6 <= blastFlag) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && 0 == s__hit)) || (8448 <= s__state && ((((((((((!(s__state == 8513) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && blastFlag <= 7) && 6 <= blastFlag) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || ((((blastFlag <= 2 && !(s__state == 8641)) && s__state <= 8672) && !(s__state == 8657)) && 8640 <= s__state)) || (((8672 <= s__state && s__state <= 8672) && 6 <= blastFlag) && 0 == s__hit)) || (((s__state <= 3 && 8640 <= s__s3__tmp__next_state___0) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640)) || (s__state <= 3 && blastFlag <= 2)) || ((((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8640) && 8640 <= s__state)) || ((((((!(s__state == 8641) && s__state <= 8672) && blastFlag <= 7) && !(s__state == 8657)) && 6 <= blastFlag) && 0 == s__hit) && 8640 <= s__state)) || (s__state <= 3 && (blastFlag <= 7 && 6 <= blastFlag) && 0 == s__hit)) || ((((((!(s__state == 8641) && 8640 <= s__state) && s__state <= 8672) && !(s__state == 8657)) && blastFlag <= 4) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8640)) || ((s__state <= 3 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8640)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && 0 == s__hit)) || ((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 7) && 6 <= blastFlag) && s__state <= 8576) && 0 == s__hit) - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: (((((((((((blastFlag <= 2 && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && 8544 <= s__state) && s__state <= 8640) && !(s__state == 8640)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) || (((((((((((((!(s__state == 8608) && !(s__state == 8592)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && 8544 <= s__state) && s__state <= 8640) && !(s__state == 8640)) && blastFlag <= 7) && 6 <= blastFlag) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && 0 == s__hit) - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: ((((((!(s__state == 8560) && !(s__state == 8561)) && 8544 <= s__state) && blastFlag <= 7) && 6 <= blastFlag) && 0 == s__hit) && s__state <= 8576) || (((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8561)) && 8544 <= s__state) && 0 == s__hit) && s__state <= 8576) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: !(s__state == 8544) - InvariantResult [Line: 627]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((((!(s__state == 8544) && 8544 <= s__state) && blastFlag <= 7) && 6 <= blastFlag) && !(s__state == 8545)) && 0 == s__hit) && s__state <= 8576) || (((((blastFlag <= 2 && !(s__state == 8544)) && 8544 <= s__state) && !(s__state == 8545)) && 0 == s__hit) && s__state <= 8576) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: ((((((s__s3__tmp__next_state___0 <= 8576 && (((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8497)) && (((!(s__state == 8544) && !(s__state == 8529)) && !(s__state == 8448)) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 8496)) && blastFlag <= 7) && 6 <= blastFlag) && 8448 <= s__state) && s__state <= 8576) && 0 == s__hit) || (((((blastFlag <= 2 && (((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8497)) && (((!(s__state == 8544) && !(s__state == 8529)) && !(s__state == 8448)) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 8496)) && 8448 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: (((((s__state <= 8672 && 6 <= blastFlag) && ((blastFlag <= 7 && !(s__state == 8672)) && !(s__state == 8641)) && !(s__state == 8640)) && 0 == s__hit) && 8640 <= s__state) || (((((s__state <= 8672 && (!(s__state == 8672) && !(s__state == 8641)) && !(s__state == 8640)) && blastFlag <= 4) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8640) && 8640 <= s__state)) || ((s__state <= 8672 && ((blastFlag <= 2 && !(s__state == 8672)) && !(s__state == 8641)) && !(s__state == 8640)) && 8640 <= s__state) - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: !(s__state == 8544) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: (((((((((((((((((((((8672 <= s__state && s__state <= 8672) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8640) || (((8448 <= s__state && s__state <= 8448) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3)) || ((((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && 8544 <= s__state) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__state <= 8640)) || ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state)) || ((((8448 <= s__state && s__state <= 8448) && 8640 <= s__s3__tmp__next_state___0) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640)) || (8448 <= s__state && (((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || ((8672 <= s__state && s__state <= 8672) && blastFlag <= 4)) || ((((((((!(s__state == 8561) && 8544 <= s__state) && s__state <= 8640) && blastFlag <= 7) && 6 <= blastFlag) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && 0 == s__hit)) || (8448 <= s__state && ((((((((((!(s__state == 8513) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && blastFlag <= 7) && 6 <= blastFlag) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || ((((blastFlag <= 2 && !(s__state == 8641)) && s__state <= 8672) && !(s__state == 8657)) && 8640 <= s__state)) || (((8672 <= s__state && s__state <= 8672) && 6 <= blastFlag) && 0 == s__hit)) || (((s__state <= 3 && 8640 <= s__s3__tmp__next_state___0) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640)) || (s__state <= 3 && blastFlag <= 2)) || ((((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8640) && 8640 <= s__state)) || ((((((!(s__state == 8641) && s__state <= 8672) && blastFlag <= 7) && !(s__state == 8657)) && 6 <= blastFlag) && 0 == s__hit) && 8640 <= s__state)) || (s__state <= 3 && (blastFlag <= 7 && 6 <= blastFlag) && 0 == s__hit)) || ((((((!(s__state == 8641) && 8640 <= s__state) && s__state <= 8672) && !(s__state == 8657)) && blastFlag <= 4) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8640)) || ((s__state <= 3 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8640)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && 0 == s__hit)) || ((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 7) && 6 <= blastFlag) && s__state <= 8576) && 0 == s__hit) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 2 && 8448 <= s__state) && s__state <= 8448) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) || (((((8448 <= s__state && s__state <= 8448) && blastFlag <= 7) && 6 <= blastFlag) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576)) || (((8448 <= s__state && s__state <= 8448) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3)) || ((((8448 <= s__state && s__state <= 8448) && 8640 <= s__s3__tmp__next_state___0) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: (((((((((((((((((8448 <= s__state && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8496)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8448)) && !(s__state == 8497)) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8576) && !(s__state == 8480)) || (8448 <= s__state && (((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8496)) && blastFlag <= 7) && 6 <= blastFlag) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || (8448 <= s__state && (((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((((((!(s__state == 8560) && !(s__state == 8561)) && 8544 <= s__state) && blastFlag <= 7) && 6 <= blastFlag) && 0 == s__hit) && s__state <= 8576) || (((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8561)) && 8544 <= s__state) && 0 == s__hit) && s__state <= 8576) - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: (((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8496)) && blastFlag <= 7) && 6 <= blastFlag) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state) || ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8496)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: ((((((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8640) && 8640 <= s__state) || ((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state)) || ((s__state <= 8640 && (blastFlag <= 7 && 6 <= blastFlag) && 0 == s__hit) && 8640 <= s__state)) || (((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && 8640 <= s__state) && blastFlag <= 4 && 0 == s__hit) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8496)) && blastFlag <= 7) && 6 <= blastFlag) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state) || ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8496)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: (((((((((((!(s__state == 8592) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && 8544 <= s__state) && s__state <= 8640) && !(s__state == 8640)) && blastFlag <= 7) && 6 <= blastFlag) && !(s__state == 8593)) && !(s__state == 8545)) && 0 == s__hit) || (s__state <= 8640 && (((((((blastFlag <= 2 && !(s__state == 8592)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && 8544 <= s__state) && !(s__state == 8640)) && !(s__state == 8593)) && !(s__state == 8545)) - InvariantResult [Line: 381]: Loop Invariant Derived loop invariant: ((((((!(s__state == 8560) && !(s__state == 8561)) && 8544 <= s__state) && blastFlag <= 7) && 6 <= blastFlag) && 0 == s__hit) && s__state <= 8576) || (((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8561)) && 8544 <= s__state) && 0 == s__hit) && s__state <= 8576) - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: (8448 <= s__state && (((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8496)) && blastFlag <= 7) && 6 <= blastFlag) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) || (8448 <= s__state && (((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 145 locations, 1 error locations. Result: SAFE, OverallTime: 42.3s, OverallIterations: 43, TraceHistogramMax: 14, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 24.4s, HoareTripleCheckerStatistics: 7875 SDtfs, 6018 SDslu, 3426 SDs, 0 SdLazy, 4127 SolverSat, 1427 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1907 GetRequests, 1852 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6339occurred in iteration=35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.9s AutomataMinimizationTime, 43 MinimizatonAttempts, 10655 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 263 NumberOfFragments, 2683 HoareAnnotationTreeSize, 28 FomulaSimplifications, 395346 FormulaSimplificationTreeSizeReduction, 6.0s HoareSimplificationTime, 28 FomulaSimplificationsInter, 109604 FormulaSimplificationTreeSizeReductionInter, 18.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 8758 NumberOfCodeBlocks, 8758 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 8709 ConstructedInterpolants, 0 QuantifiedInterpolants, 3026590 SizeOfPredicates, 9 NumberOfNonLiveVariables, 3004 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 49 InterpolantComputations, 39 PerfectInterpolantSequences, 21964/22196 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...