./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_clnt_4.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e4f51cc5-3682-47bb-bb99-786b6dbbfbb9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e4f51cc5-3682-47bb-bb99-786b6dbbfbb9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e4f51cc5-3682-47bb-bb99-786b6dbbfbb9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e4f51cc5-3682-47bb-bb99-786b6dbbfbb9/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_clnt_4.cil-1.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e4f51cc5-3682-47bb-bb99-786b6dbbfbb9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e4f51cc5-3682-47bb-bb99-786b6dbbfbb9/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 cb09588b635900957a695153eceb65b29d9669a8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:58:11,997 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:58:11,999 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:58:12,007 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:58:12,008 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:58:12,008 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:58:12,009 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:58:12,011 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:58:12,012 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:58:12,012 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:58:12,013 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:58:12,014 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:58:12,014 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:58:12,015 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:58:12,016 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:58:12,016 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:58:12,017 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:58:12,018 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:58:12,019 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:58:12,021 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:58:12,022 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:58:12,023 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:58:12,024 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:58:12,025 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:58:12,027 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:58:12,028 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:58:12,028 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:58:12,029 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:58:12,029 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:58:12,030 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:58:12,030 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:58:12,031 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:58:12,032 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:58:12,036 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:58:12,037 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:58:12,037 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:58:12,038 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:58:12,038 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:58:12,038 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:58:12,039 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:58:12,039 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:58:12,040 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e4f51cc5-3682-47bb-bb99-786b6dbbfbb9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 08:58:12,052 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:58:12,052 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:58:12,053 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:58:12,053 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:58:12,054 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:58:12,054 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:58:12,054 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:58:12,054 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:58:12,054 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:58:12,054 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:58:12,054 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:58:12,055 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:58:12,055 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:58:12,055 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:58:12,055 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:58:12,055 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:58:12,055 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:58:12,055 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:58:12,056 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:58:12,056 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:58:12,056 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:58:12,056 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:58:12,057 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:58:12,057 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:58:12,057 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:58:12,057 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:58:12,057 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:58:12,057 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:58:12,058 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/working_dir_e4f51cc5-3682-47bb-bb99-786b6dbbfbb9/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 -> cb09588b635900957a695153eceb65b29d9669a8 [2019-10-22 08:58:12,081 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:58:12,092 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:58:12,095 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:58:12,096 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:58:12,097 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:58:12,097 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e4f51cc5-3682-47bb-bb99-786b6dbbfbb9/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_clnt_4.cil-1.c [2019-10-22 08:58:12,155 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e4f51cc5-3682-47bb-bb99-786b6dbbfbb9/bin/uautomizer/data/1d168db21/07c96c78825f477f8807ad1b47499b8c/FLAGe77d3b672 [2019-10-22 08:58:12,562 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:58:12,562 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e4f51cc5-3682-47bb-bb99-786b6dbbfbb9/sv-benchmarks/c/ssh-simplified/s3_clnt_4.cil-1.c [2019-10-22 08:58:12,573 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e4f51cc5-3682-47bb-bb99-786b6dbbfbb9/bin/uautomizer/data/1d168db21/07c96c78825f477f8807ad1b47499b8c/FLAGe77d3b672 [2019-10-22 08:58:12,586 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e4f51cc5-3682-47bb-bb99-786b6dbbfbb9/bin/uautomizer/data/1d168db21/07c96c78825f477f8807ad1b47499b8c [2019-10-22 08:58:12,588 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:58:12,589 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:58:12,590 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:12,590 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:58:12,594 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:58:12,595 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:12" (1/1) ... [2019-10-22 08:58:12,597 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ed65f86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:12, skipping insertion in model container [2019-10-22 08:58:12,598 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:12" (1/1) ... [2019-10-22 08:58:12,605 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:58:12,651 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:58:12,916 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:12,919 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:58:12,993 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:13,005 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:58:13,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:13 WrapperNode [2019-10-22 08:58:13,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:13,006 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:13,006 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:58:13,006 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:58:13,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:13" (1/1) ... [2019-10-22 08:58:13,023 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:13" (1/1) ... [2019-10-22 08:58:13,066 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:13,071 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:58:13,071 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:58:13,071 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:58:13,080 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:13" (1/1) ... [2019-10-22 08:58:13,081 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:13" (1/1) ... [2019-10-22 08:58:13,083 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:13" (1/1) ... [2019-10-22 08:58:13,083 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:13" (1/1) ... [2019-10-22 08:58:13,088 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:13" (1/1) ... [2019-10-22 08:58:13,095 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:13" (1/1) ... [2019-10-22 08:58:13,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:13" (1/1) ... [2019-10-22 08:58:13,107 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:58:13,116 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:58:13,116 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:58:13,117 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:58:13,117 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e4f51cc5-3682-47bb-bb99-786b6dbbfbb9/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-10-22 08:58:13,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:58:13,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:58:13,382 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:58:13,914 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-10-22 08:58:13,914 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-10-22 08:58:13,916 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:58:13,916 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 08:58:13,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:13 BoogieIcfgContainer [2019-10-22 08:58:13,917 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:58:13,918 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:58:13,918 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:58:13,921 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:58:13,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:58:12" (1/3) ... [2019-10-22 08:58:13,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3614178b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:58:13, skipping insertion in model container [2019-10-22 08:58:13,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:13" (2/3) ... [2019-10-22 08:58:13,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3614178b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:58:13, skipping insertion in model container [2019-10-22 08:58:13,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:13" (3/3) ... [2019-10-22 08:58:13,925 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_4.cil-1.c [2019-10-22 08:58:13,935 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:58:13,943 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 08:58:13,950 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 08:58:13,968 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:58:13,968 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:58:13,969 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:58:13,969 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:58:13,969 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:58:13,969 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:58:13,969 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:58:13,970 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:58:13,986 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2019-10-22 08:58:13,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 08:58:13,992 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:13,993 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:13,995 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:14,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:14,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1449576961, now seen corresponding path program 1 times [2019-10-22 08:58:14,009 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:14,009 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620428325] [2019-10-22 08:58:14,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:14,010 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:14,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:14,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:14,151 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620428325] [2019-10-22 08:58:14,152 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:14,152 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:58:14,153 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901780555] [2019-10-22 08:58:14,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:14,156 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:14,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:14,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:14,169 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 3 states. [2019-10-22 08:58:14,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:14,334 INFO L93 Difference]: Finished difference Result 251 states and 426 transitions. [2019-10-22 08:58:14,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:14,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-22 08:58:14,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:14,349 INFO L225 Difference]: With dead ends: 251 [2019-10-22 08:58:14,349 INFO L226 Difference]: Without dead ends: 114 [2019-10-22 08:58:14,353 INFO L600 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-10-22 08:58:14,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-10-22 08:58:14,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-10-22 08:58:14,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-10-22 08:58:14,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 171 transitions. [2019-10-22 08:58:14,406 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 171 transitions. Word has length 23 [2019-10-22 08:58:14,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:14,406 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 171 transitions. [2019-10-22 08:58:14,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:14,406 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 171 transitions. [2019-10-22 08:58:14,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 08:58:14,407 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:14,408 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:14,420 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:14,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:14,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1395170557, now seen corresponding path program 1 times [2019-10-22 08:58:14,421 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:14,421 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406657000] [2019-10-22 08:58:14,421 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:14,421 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:14,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:14,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:14,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:14,555 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406657000] [2019-10-22 08:58:14,555 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:14,555 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:14,555 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554300392] [2019-10-22 08:58:14,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:14,557 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:14,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:14,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:14,557 INFO L87 Difference]: Start difference. First operand 114 states and 171 transitions. Second operand 3 states. [2019-10-22 08:58:14,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:14,749 INFO L93 Difference]: Finished difference Result 237 states and 359 transitions. [2019-10-22 08:58:14,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:14,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-22 08:58:14,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:14,752 INFO L225 Difference]: With dead ends: 237 [2019-10-22 08:58:14,752 INFO L226 Difference]: Without dead ends: 132 [2019-10-22 08:58:14,753 INFO L600 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-10-22 08:58:14,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-10-22 08:58:14,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2019-10-22 08:58:14,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-10-22 08:58:14,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 191 transitions. [2019-10-22 08:58:14,765 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 191 transitions. Word has length 36 [2019-10-22 08:58:14,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:14,765 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 191 transitions. [2019-10-22 08:58:14,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:14,765 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 191 transitions. [2019-10-22 08:58:14,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-22 08:58:14,766 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:14,767 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:14,767 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:14,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:14,767 INFO L82 PathProgramCache]: Analyzing trace with hash -462623258, now seen corresponding path program 1 times [2019-10-22 08:58:14,768 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:14,768 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134689609] [2019-10-22 08:58:14,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:14,769 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:14,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:14,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:14,836 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 08:58:14,837 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134689609] [2019-10-22 08:58:14,837 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:14,837 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:14,837 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162680766] [2019-10-22 08:58:14,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:14,838 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:14,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:14,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:14,838 INFO L87 Difference]: Start difference. First operand 129 states and 191 transitions. Second operand 3 states. [2019-10-22 08:58:14,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:14,982 INFO L93 Difference]: Finished difference Result 270 states and 405 transitions. [2019-10-22 08:58:14,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:14,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-10-22 08:58:14,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:14,984 INFO L225 Difference]: With dead ends: 270 [2019-10-22 08:58:14,984 INFO L226 Difference]: Without dead ends: 150 [2019-10-22 08:58:14,985 INFO L600 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-10-22 08:58:14,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-10-22 08:58:14,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2019-10-22 08:58:14,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-10-22 08:58:14,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 213 transitions. [2019-10-22 08:58:14,997 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 213 transitions. Word has length 50 [2019-10-22 08:58:14,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:14,998 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 213 transitions. [2019-10-22 08:58:14,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:14,998 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 213 transitions. [2019-10-22 08:58:14,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-22 08:58:15,000 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:15,000 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:15,000 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:15,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:15,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1168366188, now seen corresponding path program 1 times [2019-10-22 08:58:15,001 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:15,001 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147601490] [2019-10-22 08:58:15,002 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:15,002 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:15,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:15,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,121 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-22 08:58:15,121 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147601490] [2019-10-22 08:58:15,121 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:15,122 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:15,122 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219064254] [2019-10-22 08:58:15,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:15,122 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:15,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:15,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:15,123 INFO L87 Difference]: Start difference. First operand 146 states and 213 transitions. Second operand 3 states. [2019-10-22 08:58:15,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:15,324 INFO L93 Difference]: Finished difference Result 334 states and 502 transitions. [2019-10-22 08:58:15,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:15,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-10-22 08:58:15,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:15,327 INFO L225 Difference]: With dead ends: 334 [2019-10-22 08:58:15,327 INFO L226 Difference]: Without dead ends: 196 [2019-10-22 08:58:15,327 INFO L600 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-10-22 08:58:15,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-10-22 08:58:15,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 187. [2019-10-22 08:58:15,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-10-22 08:58:15,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 263 transitions. [2019-10-22 08:58:15,347 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 263 transitions. Word has length 67 [2019-10-22 08:58:15,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:15,347 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 263 transitions. [2019-10-22 08:58:15,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:15,348 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 263 transitions. [2019-10-22 08:58:15,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-22 08:58:15,349 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:15,349 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:15,349 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:15,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:15,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1321162774, now seen corresponding path program 1 times [2019-10-22 08:58:15,350 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:15,350 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57870509] [2019-10-22 08:58:15,350 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:15,350 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:15,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,430 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-22 08:58:15,430 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57870509] [2019-10-22 08:58:15,431 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:15,431 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:15,431 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453990368] [2019-10-22 08:58:15,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:15,432 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:15,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:15,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:15,433 INFO L87 Difference]: Start difference. First operand 187 states and 263 transitions. Second operand 3 states. [2019-10-22 08:58:15,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:15,563 INFO L93 Difference]: Finished difference Result 390 states and 556 transitions. [2019-10-22 08:58:15,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:15,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-10-22 08:58:15,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:15,565 INFO L225 Difference]: With dead ends: 390 [2019-10-22 08:58:15,565 INFO L226 Difference]: Without dead ends: 212 [2019-10-22 08:58:15,566 INFO L600 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-10-22 08:58:15,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-10-22 08:58:15,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 206. [2019-10-22 08:58:15,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-10-22 08:58:15,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 287 transitions. [2019-10-22 08:58:15,577 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 287 transitions. Word has length 67 [2019-10-22 08:58:15,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:15,577 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 287 transitions. [2019-10-22 08:58:15,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:15,578 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 287 transitions. [2019-10-22 08:58:15,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 08:58:15,580 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:15,580 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:15,581 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:15,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:15,581 INFO L82 PathProgramCache]: Analyzing trace with hash -136835443, now seen corresponding path program 1 times [2019-10-22 08:58:15,581 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:15,581 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327822253] [2019-10-22 08:58:15,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:15,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:15,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,658 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-22 08:58:15,660 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327822253] [2019-10-22 08:58:15,660 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:15,660 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:15,660 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571696785] [2019-10-22 08:58:15,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:15,661 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:15,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:15,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:15,661 INFO L87 Difference]: Start difference. First operand 206 states and 287 transitions. Second operand 3 states. [2019-10-22 08:58:15,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:15,775 INFO L93 Difference]: Finished difference Result 427 states and 603 transitions. [2019-10-22 08:58:15,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:15,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-10-22 08:58:15,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:15,777 INFO L225 Difference]: With dead ends: 427 [2019-10-22 08:58:15,777 INFO L226 Difference]: Without dead ends: 230 [2019-10-22 08:58:15,777 INFO L600 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-10-22 08:58:15,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-10-22 08:58:15,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2019-10-22 08:58:15,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-10-22 08:58:15,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 313 transitions. [2019-10-22 08:58:15,787 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 313 transitions. Word has length 84 [2019-10-22 08:58:15,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:15,789 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 313 transitions. [2019-10-22 08:58:15,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:15,789 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 313 transitions. [2019-10-22 08:58:15,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-22 08:58:15,791 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:15,791 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:15,791 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:15,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:15,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1324345659, now seen corresponding path program 1 times [2019-10-22 08:58:15,792 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:15,792 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875769325] [2019-10-22 08:58:15,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:15,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:15,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,844 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-22 08:58:15,845 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875769325] [2019-10-22 08:58:15,845 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:15,845 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:15,845 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932761797] [2019-10-22 08:58:15,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:15,846 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:15,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:15,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:15,846 INFO L87 Difference]: Start difference. First operand 227 states and 313 transitions. Second operand 3 states. [2019-10-22 08:58:15,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:15,882 INFO L93 Difference]: Finished difference Result 661 states and 912 transitions. [2019-10-22 08:58:15,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:15,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-10-22 08:58:15,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:15,885 INFO L225 Difference]: With dead ends: 661 [2019-10-22 08:58:15,885 INFO L226 Difference]: Without dead ends: 443 [2019-10-22 08:58:15,886 INFO L600 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-10-22 08:58:15,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-10-22 08:58:15,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2019-10-22 08:58:15,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-10-22 08:58:15,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 609 transitions. [2019-10-22 08:58:15,904 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 609 transitions. Word has length 104 [2019-10-22 08:58:15,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:15,904 INFO L462 AbstractCegarLoop]: Abstraction has 443 states and 609 transitions. [2019-10-22 08:58:15,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:15,905 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 609 transitions. [2019-10-22 08:58:15,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-22 08:58:15,906 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:15,906 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:15,907 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:15,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:15,907 INFO L82 PathProgramCache]: Analyzing trace with hash -606282988, now seen corresponding path program 1 times [2019-10-22 08:58:15,907 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:15,907 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051496797] [2019-10-22 08:58:15,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:15,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:15,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,994 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-22 08:58:15,995 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051496797] [2019-10-22 08:58:15,995 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:15,996 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:15,996 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732660565] [2019-10-22 08:58:15,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:15,997 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:15,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:15,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:15,997 INFO L87 Difference]: Start difference. First operand 443 states and 609 transitions. Second operand 3 states. [2019-10-22 08:58:16,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:16,035 INFO L93 Difference]: Finished difference Result 661 states and 909 transitions. [2019-10-22 08:58:16,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:16,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-10-22 08:58:16,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:16,038 INFO L225 Difference]: With dead ends: 661 [2019-10-22 08:58:16,038 INFO L226 Difference]: Without dead ends: 659 [2019-10-22 08:58:16,038 INFO L600 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-10-22 08:58:16,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-10-22 08:58:16,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2019-10-22 08:58:16,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-10-22 08:58:16,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 907 transitions. [2019-10-22 08:58:16,054 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 907 transitions. Word has length 106 [2019-10-22 08:58:16,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:16,054 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 907 transitions. [2019-10-22 08:58:16,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:16,054 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 907 transitions. [2019-10-22 08:58:16,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-22 08:58:16,056 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:16,056 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:16,056 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:16,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:16,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1653094939, now seen corresponding path program 1 times [2019-10-22 08:58:16,056 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:16,057 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134151924] [2019-10-22 08:58:16,057 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:16,057 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:16,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:16,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,125 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-10-22 08:58:16,125 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134151924] [2019-10-22 08:58:16,125 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:16,126 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:16,126 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235227665] [2019-10-22 08:58:16,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:16,127 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:16,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:16,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:16,127 INFO L87 Difference]: Start difference. First operand 659 states and 907 transitions. Second operand 3 states. [2019-10-22 08:58:16,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:16,279 INFO L93 Difference]: Finished difference Result 1462 states and 2068 transitions. [2019-10-22 08:58:16,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:16,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-10-22 08:58:16,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:16,283 INFO L225 Difference]: With dead ends: 1462 [2019-10-22 08:58:16,283 INFO L226 Difference]: Without dead ends: 809 [2019-10-22 08:58:16,284 INFO L600 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-10-22 08:58:16,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2019-10-22 08:58:16,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 776. [2019-10-22 08:58:16,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-10-22 08:58:16,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1096 transitions. [2019-10-22 08:58:16,306 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1096 transitions. Word has length 146 [2019-10-22 08:58:16,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:16,306 INFO L462 AbstractCegarLoop]: Abstraction has 776 states and 1096 transitions. [2019-10-22 08:58:16,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:16,307 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1096 transitions. [2019-10-22 08:58:16,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-10-22 08:58:16,309 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:16,309 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 4, 4, 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-10-22 08:58:16,309 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:16,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:16,309 INFO L82 PathProgramCache]: Analyzing trace with hash 285230582, now seen corresponding path program 1 times [2019-10-22 08:58:16,310 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:16,310 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490900544] [2019-10-22 08:58:16,310 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:16,310 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:16,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,387 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-10-22 08:58:16,388 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490900544] [2019-10-22 08:58:16,388 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:16,398 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:16,398 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553415949] [2019-10-22 08:58:16,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:16,398 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:16,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:16,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:16,399 INFO L87 Difference]: Start difference. First operand 776 states and 1096 transitions. Second operand 3 states. [2019-10-22 08:58:16,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:16,519 INFO L93 Difference]: Finished difference Result 1623 states and 2286 transitions. [2019-10-22 08:58:16,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:16,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-10-22 08:58:16,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:16,522 INFO L225 Difference]: With dead ends: 1623 [2019-10-22 08:58:16,523 INFO L226 Difference]: Without dead ends: 856 [2019-10-22 08:58:16,524 INFO L600 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-10-22 08:58:16,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2019-10-22 08:58:16,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 845. [2019-10-22 08:58:16,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2019-10-22 08:58:16,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1180 transitions. [2019-10-22 08:58:16,544 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1180 transitions. Word has length 182 [2019-10-22 08:58:16,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:16,544 INFO L462 AbstractCegarLoop]: Abstraction has 845 states and 1180 transitions. [2019-10-22 08:58:16,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:16,544 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1180 transitions. [2019-10-22 08:58:16,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-10-22 08:58:16,546 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:16,547 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:16,547 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:16,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:16,547 INFO L82 PathProgramCache]: Analyzing trace with hash 742481215, now seen corresponding path program 1 times [2019-10-22 08:58:16,547 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:16,547 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055142883] [2019-10-22 08:58:16,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:16,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:16,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:16,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,596 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2019-10-22 08:58:16,596 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055142883] [2019-10-22 08:58:16,596 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:16,597 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:16,597 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863532985] [2019-10-22 08:58:16,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:16,597 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:16,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:16,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:16,598 INFO L87 Difference]: Start difference. First operand 845 states and 1180 transitions. Second operand 3 states. [2019-10-22 08:58:16,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:16,704 INFO L93 Difference]: Finished difference Result 1765 states and 2467 transitions. [2019-10-22 08:58:16,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:16,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2019-10-22 08:58:16,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:16,707 INFO L225 Difference]: With dead ends: 1765 [2019-10-22 08:58:16,707 INFO L226 Difference]: Without dead ends: 929 [2019-10-22 08:58:16,708 INFO L600 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-10-22 08:58:16,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2019-10-22 08:58:16,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 920. [2019-10-22 08:58:16,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 920 states. [2019-10-22 08:58:16,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1270 transitions. [2019-10-22 08:58:16,725 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1270 transitions. Word has length 203 [2019-10-22 08:58:16,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:16,726 INFO L462 AbstractCegarLoop]: Abstraction has 920 states and 1270 transitions. [2019-10-22 08:58:16,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:16,726 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1270 transitions. [2019-10-22 08:58:16,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-10-22 08:58:16,728 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:16,728 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:16,729 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:16,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:16,729 INFO L82 PathProgramCache]: Analyzing trace with hash 884333740, now seen corresponding path program 1 times [2019-10-22 08:58:16,729 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:16,729 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206436453] [2019-10-22 08:58:16,729 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:16,729 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:16,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:16,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,790 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 411 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2019-10-22 08:58:16,790 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206436453] [2019-10-22 08:58:16,790 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:16,790 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:16,791 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302620213] [2019-10-22 08:58:16,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:16,791 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:16,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:16,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:16,792 INFO L87 Difference]: Start difference. First operand 920 states and 1270 transitions. Second operand 3 states. [2019-10-22 08:58:16,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:16,922 INFO L93 Difference]: Finished difference Result 1921 states and 2656 transitions. [2019-10-22 08:58:16,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:16,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2019-10-22 08:58:16,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:16,926 INFO L225 Difference]: With dead ends: 1921 [2019-10-22 08:58:16,926 INFO L226 Difference]: Without dead ends: 1010 [2019-10-22 08:58:16,927 INFO L600 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-10-22 08:58:16,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2019-10-22 08:58:16,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 1004. [2019-10-22 08:58:16,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1004 states. [2019-10-22 08:58:16,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1369 transitions. [2019-10-22 08:58:16,949 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1369 transitions. Word has length 227 [2019-10-22 08:58:16,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:16,949 INFO L462 AbstractCegarLoop]: Abstraction has 1004 states and 1369 transitions. [2019-10-22 08:58:16,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:16,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1369 transitions. [2019-10-22 08:58:16,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-10-22 08:58:16,953 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:16,953 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:16,953 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:16,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:16,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1915374638, now seen corresponding path program 1 times [2019-10-22 08:58:16,954 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:16,954 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475066050] [2019-10-22 08:58:16,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:16,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:16,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:17,057 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 411 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2019-10-22 08:58:17,058 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475066050] [2019-10-22 08:58:17,058 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:17,059 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:17,059 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838030534] [2019-10-22 08:58:17,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:17,059 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:17,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:17,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:17,060 INFO L87 Difference]: Start difference. First operand 1004 states and 1369 transitions. Second operand 3 states. [2019-10-22 08:58:17,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:17,167 INFO L93 Difference]: Finished difference Result 2101 states and 2881 transitions. [2019-10-22 08:58:17,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:17,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2019-10-22 08:58:17,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:17,174 INFO L225 Difference]: With dead ends: 2101 [2019-10-22 08:58:17,174 INFO L226 Difference]: Without dead ends: 1106 [2019-10-22 08:58:17,175 INFO L600 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-10-22 08:58:17,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-10-22 08:58:17,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1097. [2019-10-22 08:58:17,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1097 states. [2019-10-22 08:58:17,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1477 transitions. [2019-10-22 08:58:17,196 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1477 transitions. Word has length 227 [2019-10-22 08:58:17,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:17,196 INFO L462 AbstractCegarLoop]: Abstraction has 1097 states and 1477 transitions. [2019-10-22 08:58:17,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:17,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1477 transitions. [2019-10-22 08:58:17,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-10-22 08:58:17,199 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:17,199 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 08:58:17,199 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:17,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:17,200 INFO L82 PathProgramCache]: Analyzing trace with hash -50346324, now seen corresponding path program 1 times [2019-10-22 08:58:17,200 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:17,200 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089560719] [2019-10-22 08:58:17,200 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:17,200 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:17,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:17,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:17,278 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 530 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-10-22 08:58:17,279 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089560719] [2019-10-22 08:58:17,279 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:17,279 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:17,279 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045268227] [2019-10-22 08:58:17,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:17,279 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:17,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:17,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:17,280 INFO L87 Difference]: Start difference. First operand 1097 states and 1477 transitions. Second operand 3 states. [2019-10-22 08:58:17,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:17,309 INFO L93 Difference]: Finished difference Result 3270 states and 4402 transitions. [2019-10-22 08:58:17,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:17,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 257 [2019-10-22 08:58:17,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:17,316 INFO L225 Difference]: With dead ends: 3270 [2019-10-22 08:58:17,316 INFO L226 Difference]: Without dead ends: 2182 [2019-10-22 08:58:17,317 INFO L600 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-10-22 08:58:17,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2019-10-22 08:58:17,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 2180. [2019-10-22 08:58:17,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2180 states. [2019-10-22 08:58:17,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 2934 transitions. [2019-10-22 08:58:17,358 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 2934 transitions. Word has length 257 [2019-10-22 08:58:17,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:17,359 INFO L462 AbstractCegarLoop]: Abstraction has 2180 states and 2934 transitions. [2019-10-22 08:58:17,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:17,359 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 2934 transitions. [2019-10-22 08:58:17,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-10-22 08:58:17,363 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:17,363 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 08:58:17,363 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:17,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:17,364 INFO L82 PathProgramCache]: Analyzing trace with hash 980694574, now seen corresponding path program 1 times [2019-10-22 08:58:17,364 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:17,364 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253938711] [2019-10-22 08:58:17,364 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:17,364 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:17,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:17,439 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 485 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-10-22 08:58:17,439 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253938711] [2019-10-22 08:58:17,439 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:17,439 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:17,439 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116301150] [2019-10-22 08:58:17,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:17,440 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:17,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:17,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:17,441 INFO L87 Difference]: Start difference. First operand 2180 states and 2934 transitions. Second operand 3 states. [2019-10-22 08:58:17,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:17,583 INFO L93 Difference]: Finished difference Result 4576 states and 6206 transitions. [2019-10-22 08:58:17,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:17,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 257 [2019-10-22 08:58:17,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:17,590 INFO L225 Difference]: With dead ends: 4576 [2019-10-22 08:58:17,590 INFO L226 Difference]: Without dead ends: 2405 [2019-10-22 08:58:17,593 INFO L600 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-10-22 08:58:17,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2405 states. [2019-10-22 08:58:17,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2405 to 2393. [2019-10-22 08:58:17,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2393 states. [2019-10-22 08:58:17,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2393 states to 2393 states and 3177 transitions. [2019-10-22 08:58:17,638 INFO L78 Accepts]: Start accepts. Automaton has 2393 states and 3177 transitions. Word has length 257 [2019-10-22 08:58:17,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:17,639 INFO L462 AbstractCegarLoop]: Abstraction has 2393 states and 3177 transitions. [2019-10-22 08:58:17,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:17,639 INFO L276 IsEmpty]: Start isEmpty. Operand 2393 states and 3177 transitions. [2019-10-22 08:58:17,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-10-22 08:58:17,643 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:17,644 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:17,644 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:17,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:17,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1095007574, now seen corresponding path program 1 times [2019-10-22 08:58:17,644 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:17,645 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415484951] [2019-10-22 08:58:17,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:17,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:17,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:17,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:17,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1015 backedges. 555 proven. 0 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2019-10-22 08:58:17,741 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415484951] [2019-10-22 08:58:17,741 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:17,741 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:17,742 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742188617] [2019-10-22 08:58:17,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:17,742 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:17,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:17,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:17,743 INFO L87 Difference]: Start difference. First operand 2393 states and 3177 transitions. Second operand 3 states. [2019-10-22 08:58:17,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:17,927 INFO L93 Difference]: Finished difference Result 4888 states and 6509 transitions. [2019-10-22 08:58:17,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:17,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 281 [2019-10-22 08:58:17,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:17,936 INFO L225 Difference]: With dead ends: 4888 [2019-10-22 08:58:17,936 INFO L226 Difference]: Without dead ends: 2504 [2019-10-22 08:58:17,939 INFO L600 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-10-22 08:58:17,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2504 states. [2019-10-22 08:58:17,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2504 to 2492. [2019-10-22 08:58:17,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2492 states. [2019-10-22 08:58:18,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2492 states to 2492 states and 3291 transitions. [2019-10-22 08:58:18,002 INFO L78 Accepts]: Start accepts. Automaton has 2492 states and 3291 transitions. Word has length 281 [2019-10-22 08:58:18,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:18,002 INFO L462 AbstractCegarLoop]: Abstraction has 2492 states and 3291 transitions. [2019-10-22 08:58:18,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:18,002 INFO L276 IsEmpty]: Start isEmpty. Operand 2492 states and 3291 transitions. [2019-10-22 08:58:18,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-10-22 08:58:18,008 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:18,008 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 08:58:18,008 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:18,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:18,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1021889644, now seen corresponding path program 1 times [2019-10-22 08:58:18,009 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:18,009 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453951820] [2019-10-22 08:58:18,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:18,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:18,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:18,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:18,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 442 proven. 0 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2019-10-22 08:58:18,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453951820] [2019-10-22 08:58:18,091 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:18,091 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:18,091 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934954213] [2019-10-22 08:58:18,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:18,091 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:18,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:18,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:18,092 INFO L87 Difference]: Start difference. First operand 2492 states and 3291 transitions. Second operand 3 states. [2019-10-22 08:58:18,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:18,277 INFO L93 Difference]: Finished difference Result 5275 states and 7097 transitions. [2019-10-22 08:58:18,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:18,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2019-10-22 08:58:18,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:18,286 INFO L225 Difference]: With dead ends: 5275 [2019-10-22 08:58:18,286 INFO L226 Difference]: Without dead ends: 2792 [2019-10-22 08:58:18,289 INFO L600 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-10-22 08:58:18,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2792 states. [2019-10-22 08:58:18,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2792 to 2732. [2019-10-22 08:58:18,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2732 states. [2019-10-22 08:58:18,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2732 states to 2732 states and 3573 transitions. [2019-10-22 08:58:18,347 INFO L78 Accepts]: Start accepts. Automaton has 2732 states and 3573 transitions. Word has length 292 [2019-10-22 08:58:18,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:18,348 INFO L462 AbstractCegarLoop]: Abstraction has 2732 states and 3573 transitions. [2019-10-22 08:58:18,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:18,348 INFO L276 IsEmpty]: Start isEmpty. Operand 2732 states and 3573 transitions. [2019-10-22 08:58:18,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-10-22 08:58:18,353 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:18,354 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:18,354 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:18,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:18,354 INFO L82 PathProgramCache]: Analyzing trace with hash -229308938, now seen corresponding path program 1 times [2019-10-22 08:58:18,354 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:18,354 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732798241] [2019-10-22 08:58:18,354 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:18,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:18,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:18,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1171 backedges. 631 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2019-10-22 08:58:18,432 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732798241] [2019-10-22 08:58:18,432 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:18,432 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:18,432 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546769363] [2019-10-22 08:58:18,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:18,433 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:18,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:18,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:18,433 INFO L87 Difference]: Start difference. First operand 2732 states and 3573 transitions. Second operand 3 states. [2019-10-22 08:58:18,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:18,603 INFO L93 Difference]: Finished difference Result 5539 states and 7235 transitions. [2019-10-22 08:58:18,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:18,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2019-10-22 08:58:18,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:18,612 INFO L225 Difference]: With dead ends: 5539 [2019-10-22 08:58:18,613 INFO L226 Difference]: Without dead ends: 2798 [2019-10-22 08:58:18,615 INFO L600 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-10-22 08:58:18,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2798 states. [2019-10-22 08:58:18,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2798 to 2726. [2019-10-22 08:58:18,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2726 states. [2019-10-22 08:58:18,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2726 states to 2726 states and 3537 transitions. [2019-10-22 08:58:18,681 INFO L78 Accepts]: Start accepts. Automaton has 2726 states and 3537 transitions. Word has length 300 [2019-10-22 08:58:18,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:18,682 INFO L462 AbstractCegarLoop]: Abstraction has 2726 states and 3537 transitions. [2019-10-22 08:58:18,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:18,682 INFO L276 IsEmpty]: Start isEmpty. Operand 2726 states and 3537 transitions. [2019-10-22 08:58:18,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-10-22 08:58:18,688 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:18,688 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 08:58:18,688 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:18,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:18,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1736108088, now seen corresponding path program 1 times [2019-10-22 08:58:18,689 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:18,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984258446] [2019-10-22 08:58:18,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:18,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:18,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:18,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:18,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 657 proven. 14 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2019-10-22 08:58:18,852 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984258446] [2019-10-22 08:58:18,852 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938609529] [2019-10-22 08:58:18,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e4f51cc5-3682-47bb-bb99-786b6dbbfbb9/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-10-22 08:58:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:18,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:58:18,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:19,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 657 proven. 14 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2019-10-22 08:58:19,059 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:58:19,060 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-22 08:58:19,060 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204392576] [2019-10-22 08:58:19,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:19,062 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:19,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:19,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:19,062 INFO L87 Difference]: Start difference. First operand 2726 states and 3537 transitions. Second operand 4 states. [2019-10-22 08:58:19,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:19,453 INFO L93 Difference]: Finished difference Result 8268 states and 10711 transitions. [2019-10-22 08:58:19,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:58:19,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 331 [2019-10-22 08:58:19,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:19,471 INFO L225 Difference]: With dead ends: 8268 [2019-10-22 08:58:19,471 INFO L226 Difference]: Without dead ends: 5545 [2019-10-22 08:58:19,475 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 333 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-10-22 08:58:19,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5545 states. [2019-10-22 08:58:19,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5545 to 3572. [2019-10-22 08:58:19,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3572 states. [2019-10-22 08:58:19,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3572 states to 3572 states and 4587 transitions. [2019-10-22 08:58:19,575 INFO L78 Accepts]: Start accepts. Automaton has 3572 states and 4587 transitions. Word has length 331 [2019-10-22 08:58:19,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:19,576 INFO L462 AbstractCegarLoop]: Abstraction has 3572 states and 4587 transitions. [2019-10-22 08:58:19,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:19,576 INFO L276 IsEmpty]: Start isEmpty. Operand 3572 states and 4587 transitions. [2019-10-22 08:58:19,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-10-22 08:58:19,583 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:19,584 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 08:58:19,784 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:58:19,785 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:19,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:19,785 INFO L82 PathProgramCache]: Analyzing trace with hash 619319881, now seen corresponding path program 1 times [2019-10-22 08:58:19,785 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:19,785 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200537491] [2019-10-22 08:58:19,785 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:19,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:19,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:19,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 770 proven. 0 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2019-10-22 08:58:19,940 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200537491] [2019-10-22 08:58:19,940 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:19,940 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:19,940 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436507688] [2019-10-22 08:58:19,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:19,941 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:19,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:19,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:19,942 INFO L87 Difference]: Start difference. First operand 3572 states and 4587 transitions. Second operand 3 states. [2019-10-22 08:58:20,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:20,031 INFO L93 Difference]: Finished difference Result 9456 states and 12199 transitions. [2019-10-22 08:58:20,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:20,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-10-22 08:58:20,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:20,062 INFO L225 Difference]: With dead ends: 9456 [2019-10-22 08:58:20,068 INFO L226 Difference]: Without dead ends: 5893 [2019-10-22 08:58:20,073 INFO L600 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-10-22 08:58:20,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5893 states. [2019-10-22 08:58:20,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5893 to 5591. [2019-10-22 08:58:20,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5591 states. [2019-10-22 08:58:20,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5591 states to 5591 states and 7204 transitions. [2019-10-22 08:58:20,241 INFO L78 Accepts]: Start accepts. Automaton has 5591 states and 7204 transitions. Word has length 332 [2019-10-22 08:58:20,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:20,241 INFO L462 AbstractCegarLoop]: Abstraction has 5591 states and 7204 transitions. [2019-10-22 08:58:20,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:20,241 INFO L276 IsEmpty]: Start isEmpty. Operand 5591 states and 7204 transitions. [2019-10-22 08:58:20,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-10-22 08:58:20,253 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:20,253 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:20,254 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:20,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:20,254 INFO L82 PathProgramCache]: Analyzing trace with hash -319778261, now seen corresponding path program 1 times [2019-10-22 08:58:20,255 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:20,255 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639347852] [2019-10-22 08:58:20,255 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:20,255 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:20,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:20,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1422 backedges. 733 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-22 08:58:20,425 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639347852] [2019-10-22 08:58:20,425 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:20,426 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:20,426 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016199091] [2019-10-22 08:58:20,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:20,426 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:20,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:20,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:20,427 INFO L87 Difference]: Start difference. First operand 5591 states and 7204 transitions. Second operand 3 states. [2019-10-22 08:58:20,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:20,647 INFO L93 Difference]: Finished difference Result 11779 states and 15109 transitions. [2019-10-22 08:58:20,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:20,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 337 [2019-10-22 08:58:20,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:20,664 INFO L225 Difference]: With dead ends: 11779 [2019-10-22 08:58:20,664 INFO L226 Difference]: Without dead ends: 6197 [2019-10-22 08:58:20,670 INFO L600 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-10-22 08:58:20,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6197 states. [2019-10-22 08:58:20,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6197 to 5765. [2019-10-22 08:58:20,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5765 states. [2019-10-22 08:58:20,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5765 states to 5765 states and 7438 transitions. [2019-10-22 08:58:20,791 INFO L78 Accepts]: Start accepts. Automaton has 5765 states and 7438 transitions. Word has length 337 [2019-10-22 08:58:20,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:20,792 INFO L462 AbstractCegarLoop]: Abstraction has 5765 states and 7438 transitions. [2019-10-22 08:58:20,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:20,792 INFO L276 IsEmpty]: Start isEmpty. Operand 5765 states and 7438 transitions. [2019-10-22 08:58:20,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-10-22 08:58:20,802 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:20,803 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:20,804 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:20,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:20,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1517002467, now seen corresponding path program 1 times [2019-10-22 08:58:20,804 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:20,805 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66590092] [2019-10-22 08:58:20,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:20,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:20,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:20,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 957 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-22 08:58:20,930 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66590092] [2019-10-22 08:58:20,930 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732645914] [2019-10-22 08:58:20,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e4f51cc5-3682-47bb-bb99-786b6dbbfbb9/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-10-22 08:58:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:21,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:58:21,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:21,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 957 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-22 08:58:21,124 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:58:21,124 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-22 08:58:21,124 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173606025] [2019-10-22 08:58:21,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:21,125 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:21,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:21,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:21,125 INFO L87 Difference]: Start difference. First operand 5765 states and 7438 transitions. Second operand 4 states. [2019-10-22 08:58:21,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:21,474 INFO L93 Difference]: Finished difference Result 13053 states and 16776 transitions. [2019-10-22 08:58:21,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:21,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 375 [2019-10-22 08:58:21,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:21,489 INFO L225 Difference]: With dead ends: 13053 [2019-10-22 08:58:21,489 INFO L226 Difference]: Without dead ends: 7284 [2019-10-22 08:58:21,496 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 377 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-10-22 08:58:21,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7284 states. [2019-10-22 08:58:21,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7284 to 5912. [2019-10-22 08:58:21,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5912 states. [2019-10-22 08:58:21,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5912 states to 5912 states and 7555 transitions. [2019-10-22 08:58:21,637 INFO L78 Accepts]: Start accepts. Automaton has 5912 states and 7555 transitions. Word has length 375 [2019-10-22 08:58:21,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:21,637 INFO L462 AbstractCegarLoop]: Abstraction has 5912 states and 7555 transitions. [2019-10-22 08:58:21,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:21,637 INFO L276 IsEmpty]: Start isEmpty. Operand 5912 states and 7555 transitions. [2019-10-22 08:58:21,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2019-10-22 08:58:21,647 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:21,648 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-22 08:58:21,848 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:58:21,849 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:21,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:21,849 INFO L82 PathProgramCache]: Analyzing trace with hash 934852515, now seen corresponding path program 1 times [2019-10-22 08:58:21,849 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:21,849 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443182637] [2019-10-22 08:58:21,849 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:21,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:21,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:21,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:21,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1972 backedges. 887 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-10-22 08:58:21,972 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443182637] [2019-10-22 08:58:21,972 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:21,973 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:21,973 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276037344] [2019-10-22 08:58:21,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:21,974 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:21,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:21,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:21,975 INFO L87 Difference]: Start difference. First operand 5912 states and 7555 transitions. Second operand 3 states. [2019-10-22 08:58:22,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:22,146 INFO L93 Difference]: Finished difference Result 11428 states and 14363 transitions. [2019-10-22 08:58:22,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:22,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 414 [2019-10-22 08:58:22,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:22,153 INFO L225 Difference]: With dead ends: 11428 [2019-10-22 08:58:22,153 INFO L226 Difference]: Without dead ends: 3254 [2019-10-22 08:58:22,159 INFO L600 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-10-22 08:58:22,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3254 states. [2019-10-22 08:58:22,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3254 to 3162. [2019-10-22 08:58:22,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3162 states. [2019-10-22 08:58:22,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3162 states to 3162 states and 3995 transitions. [2019-10-22 08:58:22,214 INFO L78 Accepts]: Start accepts. Automaton has 3162 states and 3995 transitions. Word has length 414 [2019-10-22 08:58:22,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:22,215 INFO L462 AbstractCegarLoop]: Abstraction has 3162 states and 3995 transitions. [2019-10-22 08:58:22,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:22,215 INFO L276 IsEmpty]: Start isEmpty. Operand 3162 states and 3995 transitions. [2019-10-22 08:58:22,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2019-10-22 08:58:22,223 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:22,224 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 16, 16, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 08:58:22,224 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:22,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:22,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1275695783, now seen corresponding path program 1 times [2019-10-22 08:58:22,225 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:22,225 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469468682] [2019-10-22 08:58:22,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:22,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:22,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:22,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1481 proven. 14 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2019-10-22 08:58:22,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469468682] [2019-10-22 08:58:22,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868972936] [2019-10-22 08:58:22,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e4f51cc5-3682-47bb-bb99-786b6dbbfbb9/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-10-22 08:58:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:22,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:58:22,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:22,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1481 proven. 14 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2019-10-22 08:58:22,735 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:58:22,735 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-22 08:58:22,735 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345050073] [2019-10-22 08:58:22,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:22,739 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:22,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:22,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:22,739 INFO L87 Difference]: Start difference. First operand 3162 states and 3995 transitions. Second operand 4 states. [2019-10-22 08:58:22,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:22,938 INFO L93 Difference]: Finished difference Result 3822 states and 4839 transitions. [2019-10-22 08:58:22,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:22,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 481 [2019-10-22 08:58:22,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:22,939 INFO L225 Difference]: With dead ends: 3822 [2019-10-22 08:58:22,939 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 08:58:22,942 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 483 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-10-22 08:58:22,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 08:58:22,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 08:58:22,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 08:58:22,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 08:58:22,942 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 481 [2019-10-22 08:58:22,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:22,943 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:22,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:22,943 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:58:22,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 08:58:23,143 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:58:23,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 08:58:23,519 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 283 DAG size of output: 84 [2019-10-22 08:58:24,226 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 46 [2019-10-22 08:58:24,330 INFO L443 ceAbstractionStarter]: For program point L432(lines 432 434) no Hoare annotation was computed. [2019-10-22 08:58:24,330 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 335) no Hoare annotation was computed. [2019-10-22 08:58:24,330 INFO L446 ceAbstractionStarter]: At program point L201(lines 200 488) the Hoare annotation is: true [2019-10-22 08:58:24,330 INFO L443 ceAbstractionStarter]: For program point L168(lines 168 498) no Hoare annotation was computed. [2019-10-22 08:58:24,330 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 509) no Hoare annotation was computed. [2019-10-22 08:58:24,330 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 520) no Hoare annotation was computed. [2019-10-22 08:58:24,330 INFO L439 ceAbstractionStarter]: At program point L169(lines 165 499) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1) (and (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)))) [2019-10-22 08:58:24,331 INFO L439 ceAbstractionStarter]: At program point L103(lines 102 520) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (= 12292 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-10-22 08:58:24,331 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 469) no Hoare annotation was computed. [2019-10-22 08:58:24,331 INFO L443 ceAbstractionStarter]: For program point L467-2(lines 467 469) no Hoare annotation was computed. [2019-10-22 08:58:24,331 INFO L443 ceAbstractionStarter]: For program point L435(lines 435 439) no Hoare annotation was computed. [2019-10-22 08:58:24,331 INFO L443 ceAbstractionStarter]: For program point L435-2(lines 435 439) no Hoare annotation was computed. [2019-10-22 08:58:24,331 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 340) no Hoare annotation was computed. [2019-10-22 08:58:24,331 INFO L443 ceAbstractionStarter]: For program point L336-2(lines 336 340) no Hoare annotation was computed. [2019-10-22 08:58:24,331 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 497) no Hoare annotation was computed. [2019-10-22 08:58:24,331 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 508) no Hoare annotation was computed. [2019-10-22 08:58:24,331 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 519) no Hoare annotation was computed. [2019-10-22 08:58:24,331 INFO L439 ceAbstractionStarter]: At program point L139(lines 135 509) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) [2019-10-22 08:58:24,331 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 307) no Hoare annotation was computed. [2019-10-22 08:58:24,332 INFO L443 ceAbstractionStarter]: For program point L272(lines 272 276) no Hoare annotation was computed. [2019-10-22 08:58:24,332 INFO L443 ceAbstractionStarter]: For program point L239(lines 239 242) no Hoare annotation was computed. [2019-10-22 08:58:24,332 INFO L443 ceAbstractionStarter]: For program point L305-2(lines 202 485) no Hoare annotation was computed. [2019-10-22 08:58:24,332 INFO L443 ceAbstractionStarter]: For program point L272-2(lines 272 276) no Hoare annotation was computed. [2019-10-22 08:58:24,332 INFO L443 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2019-10-22 08:58:24,333 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 374) no Hoare annotation was computed. [2019-10-22 08:58:24,334 INFO L439 ceAbstractionStarter]: At program point L207(lines 105 519) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) [2019-10-22 08:58:24,334 INFO L443 ceAbstractionStarter]: For program point L174(lines 174 496) no Hoare annotation was computed. [2019-10-22 08:58:24,334 INFO L443 ceAbstractionStarter]: For program point L141(lines 141 507) no Hoare annotation was computed. [2019-10-22 08:58:24,334 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 518) no Hoare annotation was computed. [2019-10-22 08:58:24,334 INFO L439 ceAbstractionStarter]: At program point L175(lines 171 497) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1) (and (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)))) [2019-10-22 08:58:24,334 INFO L443 ceAbstractionStarter]: For program point L473(lines 473 475) no Hoare annotation was computed. [2019-10-22 08:58:24,334 INFO L443 ceAbstractionStarter]: For program point L473-2(lines 473 475) no Hoare annotation was computed. [2019-10-22 08:58:24,334 INFO L446 ceAbstractionStarter]: At program point L540(lines 98 541) the Hoare annotation is: true [2019-10-22 08:58:24,334 INFO L443 ceAbstractionStarter]: For program point L177(lines 177 495) no Hoare annotation was computed. [2019-10-22 08:58:24,334 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 506) no Hoare annotation was computed. [2019-10-22 08:58:24,334 INFO L443 ceAbstractionStarter]: For program point L111(lines 111 517) no Hoare annotation was computed. [2019-10-22 08:58:24,335 INFO L439 ceAbstractionStarter]: At program point L145(lines 141 507) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1))) [2019-10-22 08:58:24,335 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 214) no Hoare annotation was computed. [2019-10-22 08:58:24,335 INFO L443 ceAbstractionStarter]: For program point L212-2(lines 212 214) no Hoare annotation was computed. [2019-10-22 08:58:24,335 INFO L443 ceAbstractionStarter]: For program point L180(lines 180 494) no Hoare annotation was computed. [2019-10-22 08:58:24,335 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 505) no Hoare annotation was computed. [2019-10-22 08:58:24,335 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 516) no Hoare annotation was computed. [2019-10-22 08:58:24,335 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 480) no Hoare annotation was computed. [2019-10-22 08:58:24,335 INFO L443 ceAbstractionStarter]: For program point L445(lines 445 456) no Hoare annotation was computed. [2019-10-22 08:58:24,335 INFO L443 ceAbstractionStarter]: For program point L412(lines 412 426) no Hoare annotation was computed. [2019-10-22 08:58:24,335 INFO L443 ceAbstractionStarter]: For program point L412-1(lines 412 426) no Hoare annotation was computed. [2019-10-22 08:58:24,335 INFO L443 ceAbstractionStarter]: For program point L445-2(lines 445 456) no Hoare annotation was computed. [2019-10-22 08:58:24,335 INFO L443 ceAbstractionStarter]: For program point L313(lines 313 316) no Hoare annotation was computed. [2019-10-22 08:58:24,335 INFO L439 ceAbstractionStarter]: At program point L181(lines 177 495) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1))) [2019-10-22 08:58:24,336 INFO L443 ceAbstractionStarter]: For program point L545(lines 545 547) no Hoare annotation was computed. [2019-10-22 08:58:24,336 INFO L443 ceAbstractionStarter]: For program point L545-2(lines 545 547) no Hoare annotation was computed. [2019-10-22 08:58:24,336 INFO L443 ceAbstractionStarter]: For program point L348(lines 348 350) no Hoare annotation was computed. [2019-10-22 08:58:24,336 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 493) no Hoare annotation was computed. [2019-10-22 08:58:24,336 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 504) no Hoare annotation was computed. [2019-10-22 08:58:24,337 INFO L443 ceAbstractionStarter]: For program point L117(lines 117 515) no Hoare annotation was computed. [2019-10-22 08:58:24,337 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2019-10-22 08:58:24,337 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 297) no Hoare annotation was computed. [2019-10-22 08:58:24,337 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 220) no Hoare annotation was computed. [2019-10-22 08:58:24,337 INFO L443 ceAbstractionStarter]: For program point L283-2(lines 283 297) no Hoare annotation was computed. [2019-10-22 08:58:24,338 INFO L439 ceAbstractionStarter]: At program point L151(lines 147 505) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1))) [2019-10-22 08:58:24,338 INFO L443 ceAbstractionStarter]: For program point L85(lines 85 91) no Hoare annotation was computed. [2019-10-22 08:58:24,338 INFO L443 ceAbstractionStarter]: For program point L416(lines 416 422) no Hoare annotation was computed. [2019-10-22 08:58:24,338 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 08:58:24,338 INFO L443 ceAbstractionStarter]: For program point L251(lines 251 253) no Hoare annotation was computed. [2019-10-22 08:58:24,338 INFO L443 ceAbstractionStarter]: For program point L251-2(lines 202 485) no Hoare annotation was computed. [2019-10-22 08:58:24,338 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 453) no Hoare annotation was computed. [2019-10-22 08:58:24,338 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 492) no Hoare annotation was computed. [2019-10-22 08:58:24,338 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 503) no Hoare annotation was computed. [2019-10-22 08:58:24,338 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 514) no Hoare annotation was computed. [2019-10-22 08:58:24,338 INFO L446 ceAbstractionStarter]: At program point L550(lines 11 552) the Hoare annotation is: true [2019-10-22 08:58:24,338 INFO L439 ceAbstractionStarter]: At program point L187(lines 183 493) the Hoare annotation is: (let ((.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse2 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse2))) [2019-10-22 08:58:24,339 INFO L439 ceAbstractionStarter]: At program point L121(lines 117 515) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-10-22 08:58:24,339 INFO L443 ceAbstractionStarter]: For program point L88(lines 88 90) no Hoare annotation was computed. [2019-10-22 08:58:24,339 INFO L443 ceAbstractionStarter]: For program point L88-2(lines 85 91) no Hoare annotation was computed. [2019-10-22 08:58:24,339 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 293) no Hoare annotation was computed. [2019-10-22 08:58:24,339 INFO L439 ceAbstractionStarter]: At program point L486(lines 99 539) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse2 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse3 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse4 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse5 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse11 (<= ULTIMATE.start_ssl3_connect_~s__state~0 3)) (.cse7 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse8 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse6 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse9 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse10 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse2) (and .cse3 .cse1 .cse4) (and .cse0 .cse2 .cse5 .cse6 .cse7) (and .cse3 .cse8 .cse6 .cse4) (and .cse9 .cse10 .cse5 .cse6 .cse7) (and .cse1 .cse11 .cse6) (and .cse1 .cse6 (= 4400 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse11 .cse7) (and .cse1 (= 4368 ULTIMATE.start_ssl3_connect_~s__state~0)) (and (= 4416 ULTIMATE.start_ssl3_connect_~s__state~0) .cse8 .cse6) (and .cse9 .cse10 .cse1) (and (= ULTIMATE.start_ssl3_connect_~s__state~0 4384) .cse1))) [2019-10-22 08:58:24,339 INFO L443 ceAbstractionStarter]: For program point L321(lines 321 323) no Hoare annotation was computed. [2019-10-22 08:58:24,339 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 491) no Hoare annotation was computed. [2019-10-22 08:58:24,339 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 502) no Hoare annotation was computed. [2019-10-22 08:58:24,339 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 513) no Hoare annotation was computed. [2019-10-22 08:58:24,339 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 392) no Hoare annotation was computed. [2019-10-22 08:58:24,339 INFO L439 ceAbstractionStarter]: At program point L322(lines 76 551) the Hoare annotation is: false [2019-10-22 08:58:24,339 INFO L443 ceAbstractionStarter]: For program point L388-2(lines 202 485) no Hoare annotation was computed. [2019-10-22 08:58:24,340 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 08:58:24,340 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 234) no Hoare annotation was computed. [2019-10-22 08:58:24,341 INFO L443 ceAbstractionStarter]: For program point L223-2(lines 202 485) no Hoare annotation was computed. [2019-10-22 08:58:24,341 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 537) no Hoare annotation was computed. [2019-10-22 08:58:24,341 INFO L443 ceAbstractionStarter]: For program point L290(lines 290 292) no Hoare annotation was computed. [2019-10-22 08:58:24,341 INFO L443 ceAbstractionStarter]: For program point L290-2(lines 285 297) no Hoare annotation was computed. [2019-10-22 08:58:24,341 INFO L443 ceAbstractionStarter]: For program point L522(lines 522 536) no Hoare annotation was computed. [2019-10-22 08:58:24,341 INFO L443 ceAbstractionStarter]: For program point L357(lines 357 359) no Hoare annotation was computed. [2019-10-22 08:58:24,341 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2019-10-22 08:58:24,341 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 228) no Hoare annotation was computed. [2019-10-22 08:58:24,341 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 490) no Hoare annotation was computed. [2019-10-22 08:58:24,341 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 501) no Hoare annotation was computed. [2019-10-22 08:58:24,341 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 512) no Hoare annotation was computed. [2019-10-22 08:58:24,342 INFO L443 ceAbstractionStarter]: For program point L93(lines 93 97) no Hoare annotation was computed. [2019-10-22 08:58:24,342 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 549) no Hoare annotation was computed. [2019-10-22 08:58:24,342 INFO L443 ceAbstractionStarter]: For program point L523(lines 523 528) no Hoare annotation was computed. [2019-10-22 08:58:24,342 INFO L443 ceAbstractionStarter]: For program point L523-2(lines 522 536) no Hoare annotation was computed. [2019-10-22 08:58:24,342 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 261) no Hoare annotation was computed. [2019-10-22 08:58:24,342 INFO L439 ceAbstractionStarter]: At program point L193(lines 189 491) the Hoare annotation is: (let ((.cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)))) [2019-10-22 08:58:24,342 INFO L439 ceAbstractionStarter]: At program point L127(lines 123 513) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-10-22 08:58:24,342 INFO L443 ceAbstractionStarter]: For program point L94(lines 94 96) no Hoare annotation was computed. [2019-10-22 08:58:24,342 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 08:58:24,342 INFO L443 ceAbstractionStarter]: For program point L525(lines 525 527) no Hoare annotation was computed. [2019-10-22 08:58:24,342 INFO L443 ceAbstractionStarter]: For program point L195(lines 195 489) no Hoare annotation was computed. [2019-10-22 08:58:24,343 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 500) no Hoare annotation was computed. [2019-10-22 08:58:24,343 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 511) no Hoare annotation was computed. [2019-10-22 08:58:24,343 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 366) no Hoare annotation was computed. [2019-10-22 08:58:24,343 INFO L443 ceAbstractionStarter]: For program point L361-2(lines 361 366) no Hoare annotation was computed. [2019-10-22 08:58:24,343 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 232) no Hoare annotation was computed. [2019-10-22 08:58:24,343 INFO L439 ceAbstractionStarter]: At program point L196(lines 195 489) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse1) (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)))) [2019-10-22 08:58:24,343 INFO L439 ceAbstractionStarter]: At program point L163(lines 153 503) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1) (and (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)))) [2019-10-22 08:58:24,343 INFO L443 ceAbstractionStarter]: For program point L461-1(lines 461 463) no Hoare annotation was computed. [2019-10-22 08:58:24,343 INFO L446 ceAbstractionStarter]: At program point L561(lines 553 563) the Hoare annotation is: true [2019-10-22 08:58:24,343 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 488) no Hoare annotation was computed. [2019-10-22 08:58:24,343 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 499) no Hoare annotation was computed. [2019-10-22 08:58:24,343 INFO L443 ceAbstractionStarter]: For program point L132(lines 132 510) no Hoare annotation was computed. [2019-10-22 08:58:24,343 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 76 551) no Hoare annotation was computed. [2019-10-22 08:58:24,344 INFO L443 ceAbstractionStarter]: For program point L397(lines 397 400) no Hoare annotation was computed. [2019-10-22 08:58:24,344 INFO L446 ceAbstractionStarter]: At program point L199(lines 198 488) the Hoare annotation is: true [2019-10-22 08:58:24,344 INFO L439 ceAbstractionStarter]: At program point L133(lines 129 511) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) [2019-10-22 08:58:24,344 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-22 08:58:24,344 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 534) no Hoare annotation was computed. [2019-10-22 08:58:24,346 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 268) no Hoare annotation was computed. [2019-10-22 08:58:24,346 INFO L443 ceAbstractionStarter]: For program point L266-2(lines 202 485) no Hoare annotation was computed. [2019-10-22 08:58:24,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:58:24 BoogieIcfgContainer [2019-10-22 08:58:24,385 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:58:24,385 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:58:24,386 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:58:24,386 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:58:24,386 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:13" (3/4) ... [2019-10-22 08:58:24,390 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 08:58:24,406 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-10-22 08:58:24,407 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 08:58:24,516 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e4f51cc5-3682-47bb-bb99-786b6dbbfbb9/bin/uautomizer/witness.graphml [2019-10-22 08:58:24,516 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:58:24,518 INFO L168 Benchmark]: Toolchain (without parser) took 11928.97 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 744.0 MB). Free memory was 944.5 MB in the beginning and 1.2 GB in the end (delta: -288.0 MB). Peak memory consumption was 456.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:24,518 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:24,518 INFO L168 Benchmark]: CACSL2BoogieTranslator took 415.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 944.5 MB in the beginning and 1.2 GB in the end (delta: -208.0 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:24,518 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 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-10-22 08:58:24,519 INFO L168 Benchmark]: Boogie Preprocessor took 45.04 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-10-22 08:58:24,519 INFO L168 Benchmark]: RCFGBuilder took 801.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.2 MB). Peak memory consumption was 58.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:24,519 INFO L168 Benchmark]: TraceAbstraction took 10467.08 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 582.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -152.8 MB). Peak memory consumption was 429.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:24,519 INFO L168 Benchmark]: Witness Printer took 131.09 ms. Allocated memory is still 1.8 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:24,525 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 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 415.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 944.5 MB in the beginning and 1.2 GB in the end (delta: -208.0 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 64.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 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 45.04 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 801.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.2 MB). Peak memory consumption was 58.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10467.08 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 582.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -152.8 MB). Peak memory consumption was 429.2 MB. Max. memory is 11.5 GB. * Witness Printer took 131.09 ms. Allocated memory is still 1.8 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 549]: 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: 105]: Loop Invariant Derived loop invariant: s__state <= 4560 && blastFlag <= 2 - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: ((s__state <= 4528 && blastFlag <= 2) && 4432 <= s__state) || (((s__state <= 4528 && blastFlag <= 4) && 4432 <= s__state) && 0 == s__hit) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: ((s__state <= 4528 && blastFlag <= 2) && 4352 <= s__state) && 0 == s__hit - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: ((((s__state <= 4560 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state) || (((s__state <= 4560 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4432 <= s__state)) || ((s__state <= 4560 && blastFlag <= 2) && 4432 <= s__state) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state) || ((s__state <= 4528 && blastFlag <= 2) && 4432 <= s__state) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: blastFlag <= 2 && 12292 == s__state - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((s__state <= 4528 && blastFlag <= 2) && 4432 <= s__state) || (((s__state <= 4528 && blastFlag <= 4) && 4432 <= s__state) && 0 == s__hit) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (s__state <= 4528 && blastFlag <= 2) && 4352 <= s__state - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state) || ((s__state <= 4528 && blastFlag <= 2) && 4432 <= s__state) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((s__state <= 4528 && blastFlag <= 4) && 4352 <= s__state) && 0 == s__hit - InvariantResult [Line: 189]: Loop Invariant Derived loop invariant: ((4560 <= s__state && s__state <= 4560) && blastFlag <= 2) || ((((4560 <= s__state && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state) || ((s__state <= 4528 && blastFlag <= 2) && 4432 <= s__state) - InvariantResult [Line: 553]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((((((((s__state <= 4352 && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state) || ((s__state <= 4528 && blastFlag <= 2) && 4432 <= s__state)) || ((((s__state <= 4352 && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state)) || ((((4560 <= s__state && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((blastFlag <= 2 && s__state <= 3) && 0 == s__hit)) || ((blastFlag <= 2 && 0 == s__hit) && 4400 == s__state)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || (blastFlag <= 2 && 4368 == s__state)) || ((4416 == s__state && blastFlag <= 4) && 0 == s__hit)) || ((4560 <= s__state && s__state <= 4560) && blastFlag <= 2)) || (s__state == 4384 && blastFlag <= 2) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((s__state <= 4528 && blastFlag <= 2) && 4432 <= s__state) || (((s__state <= 4528 && blastFlag <= 4) && 4432 <= s__state) && 0 == s__hit) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (s__state <= 4528 && blastFlag <= 2) && 4352 <= s__state - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: (((s__state <= 4352 && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state) || ((((s__state <= 4352 && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 127 locations, 1 error locations. Result: SAFE, OverallTime: 10.3s, OverallIterations: 24, TraceHistogramMax: 18, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, HoareTripleCheckerStatistics: 4515 SDtfs, 1551 SDslu, 2498 SDs, 0 SdLazy, 2467 SolverSat, 458 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1264 GetRequests, 1234 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5912occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 24 MinimizatonAttempts, 4422 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 177 NumberOfFragments, 437 HoareAnnotationTreeSize, 22 FomulaSimplifications, 9443 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 22 FomulaSimplificationsInter, 1460 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 6366 NumberOfCodeBlocks, 6366 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 6339 ConstructedInterpolants, 0 QuantifiedInterpolants, 2477651 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2052 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 27 InterpolantComputations, 21 PerfectInterpolantSequences, 23271/23337 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...