./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.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/run_dir_3c5d3040-f5c8-46c4-bda4-d85dc3789361/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3c5d3040-f5c8-46c4-bda4-d85dc3789361/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3c5d3040-f5c8-46c4-bda4-d85dc3789361/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3c5d3040-f5c8-46c4-bda4-d85dc3789361/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_3c5d3040-f5c8-46c4-bda4-d85dc3789361/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3c5d3040-f5c8-46c4-bda4-d85dc3789361/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 a85198d3f93b8c751f2c6e712deab62f97c1022f ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3c5d3040-f5c8-46c4-bda4-d85dc3789361/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3c5d3040-f5c8-46c4-bda4-d85dc3789361/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3c5d3040-f5c8-46c4-bda4-d85dc3789361/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3c5d3040-f5c8-46c4-bda4-d85dc3789361/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_3c5d3040-f5c8-46c4-bda4-d85dc3789361/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3c5d3040-f5c8-46c4-bda4-d85dc3789361/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 a85198d3f93b8c751f2c6e712deab62f97c1022f ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:54:14,003 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:54:14,005 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:54:14,014 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:54:14,015 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:54:14,015 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:54:14,017 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:54:14,018 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:54:14,020 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:54:14,021 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:54:14,022 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:54:14,023 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:54:14,023 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:54:14,024 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:54:14,025 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:54:14,026 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:54:14,026 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:54:14,027 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:54:14,029 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:54:14,030 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:54:14,032 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:54:14,033 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:54:14,033 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:54:14,034 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:54:14,036 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:54:14,037 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:54:14,037 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:54:14,037 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:54:14,038 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:54:14,039 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:54:14,039 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:54:14,039 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:54:14,040 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:54:14,040 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:54:14,041 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:54:14,042 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:54:14,042 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:54:14,042 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:54:14,042 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:54:14,043 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:54:14,044 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:54:14,044 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3c5d3040-f5c8-46c4-bda4-d85dc3789361/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:54:14,057 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:54:14,057 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:54:14,058 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:54:14,058 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:54:14,058 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:54:14,059 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:54:14,059 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:54:14,059 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:54:14,059 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:54:14,059 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:54:14,060 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:54:14,060 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:54:14,060 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:54:14,060 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:54:14,060 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:54:14,061 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:54:14,061 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:54:14,061 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:54:14,061 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:54:14,062 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:54:14,062 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:54:14,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:54:14,062 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:54:14,062 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:54:14,063 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:54:14,063 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:54:14,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:54:14,063 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:54:14,063 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_3c5d3040-f5c8-46c4-bda4-d85dc3789361/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 -> a85198d3f93b8c751f2c6e712deab62f97c1022f [2019-11-15 20:54:14,088 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:54:14,097 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:54:14,099 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:54:14,101 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:54:14,101 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:54:14,102 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3c5d3040-f5c8-46c4-bda4-d85dc3789361/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c [2019-11-15 20:54:14,153 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3c5d3040-f5c8-46c4-bda4-d85dc3789361/bin/uautomizer/data/46ba61c0e/89c82e1536e9482791cc8febf3434009/FLAG68f21d1c1 [2019-11-15 20:54:14,681 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:54:14,690 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3c5d3040-f5c8-46c4-bda4-d85dc3789361/sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c [2019-11-15 20:54:14,720 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3c5d3040-f5c8-46c4-bda4-d85dc3789361/bin/uautomizer/data/46ba61c0e/89c82e1536e9482791cc8febf3434009/FLAG68f21d1c1 [2019-11-15 20:54:15,169 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3c5d3040-f5c8-46c4-bda4-d85dc3789361/bin/uautomizer/data/46ba61c0e/89c82e1536e9482791cc8febf3434009 [2019-11-15 20:54:15,172 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:54:15,173 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:54:15,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:54:15,174 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:54:15,178 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:54:15,178 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:54:15" (1/1) ... [2019-11-15 20:54:15,181 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@433af1c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:15, skipping insertion in model container [2019-11-15 20:54:15,181 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:54:15" (1/1) ... [2019-11-15 20:54:15,190 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:54:15,265 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:54:15,705 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:54:15,725 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:54:15,852 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:54:15,871 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:54:15,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:15 WrapperNode [2019-11-15 20:54:15,871 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:54:15,872 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:54:15,872 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:54:15,872 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:54:15,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:15" (1/1) ... [2019-11-15 20:54:15,904 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:15" (1/1) ... [2019-11-15 20:54:15,975 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:54:15,977 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:54:15,977 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:54:15,977 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:54:15,985 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:15" (1/1) ... [2019-11-15 20:54:15,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:15" (1/1) ... [2019-11-15 20:54:16,011 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:15" (1/1) ... [2019-11-15 20:54:16,015 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:15" (1/1) ... [2019-11-15 20:54:16,059 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:15" (1/1) ... [2019-11-15 20:54:16,069 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:15" (1/1) ... [2019-11-15 20:54:16,073 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:15" (1/1) ... [2019-11-15 20:54:16,095 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:54:16,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:54:16,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:54:16,096 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:54:16,096 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c5d3040-f5c8-46c4-bda4-d85dc3789361/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:54:16,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 20:54:16,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:54:16,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 20:54:16,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 20:54:16,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 20:54:16,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 20:54:16,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:54:16,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:54:16,429 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 20:54:17,434 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-15 20:54:17,434 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-15 20:54:17,435 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:54:17,436 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 20:54:17,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:54:17 BoogieIcfgContainer [2019-11-15 20:54:17,437 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:54:17,438 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:54:17,439 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:54:17,441 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:54:17,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:54:15" (1/3) ... [2019-11-15 20:54:17,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c6d10c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:54:17, skipping insertion in model container [2019-11-15 20:54:17,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:15" (2/3) ... [2019-11-15 20:54:17,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c6d10c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:54:17, skipping insertion in model container [2019-11-15 20:54:17,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:54:17" (3/3) ... [2019-11-15 20:54:17,445 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.04.i.cil.c [2019-11-15 20:54:17,454 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:54:17,461 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 20:54:17,472 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 20:54:17,495 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:54:17,495 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:54:17,495 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:54:17,495 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:54:17,496 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:54:17,496 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:54:17,496 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:54:17,496 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:54:17,513 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-11-15 20:54:17,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 20:54:17,522 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:17,523 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:17,525 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:17,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:17,530 INFO L82 PathProgramCache]: Analyzing trace with hash 522836684, now seen corresponding path program 1 times [2019-11-15 20:54:17,537 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:17,538 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232730775] [2019-11-15 20:54:17,538 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:17,538 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:17,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:17,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:54:17,801 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232730775] [2019-11-15 20:54:17,802 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:17,802 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:54:17,802 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536077536] [2019-11-15 20:54:17,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:54:17,806 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:17,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:54:17,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:17,821 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2019-11-15 20:54:18,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:18,354 INFO L93 Difference]: Finished difference Result 313 states and 527 transitions. [2019-11-15 20:54:18,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:54:18,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-15 20:54:18,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:18,376 INFO L225 Difference]: With dead ends: 313 [2019-11-15 20:54:18,376 INFO L226 Difference]: Without dead ends: 158 [2019-11-15 20:54:18,382 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:54:18,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-15 20:54:18,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2019-11-15 20:54:18,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 20:54:18,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 216 transitions. [2019-11-15 20:54:18,456 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 216 transitions. Word has length 45 [2019-11-15 20:54:18,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:18,457 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 216 transitions. [2019-11-15 20:54:18,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:54:18,457 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 216 transitions. [2019-11-15 20:54:18,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-15 20:54:18,465 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:18,465 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:18,466 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:18,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:18,466 INFO L82 PathProgramCache]: Analyzing trace with hash 968097209, now seen corresponding path program 1 times [2019-11-15 20:54:18,466 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:18,466 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909861437] [2019-11-15 20:54:18,467 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:18,467 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:18,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:18,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:18,649 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:54:18,649 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909861437] [2019-11-15 20:54:18,649 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:18,649 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:54:18,650 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269781012] [2019-11-15 20:54:18,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:54:18,651 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:18,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:54:18,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:18,652 INFO L87 Difference]: Start difference. First operand 141 states and 216 transitions. Second operand 4 states. [2019-11-15 20:54:19,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:19,030 INFO L93 Difference]: Finished difference Result 280 states and 423 transitions. [2019-11-15 20:54:19,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:54:19,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-15 20:54:19,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:19,032 INFO L225 Difference]: With dead ends: 280 [2019-11-15 20:54:19,033 INFO L226 Difference]: Without dead ends: 158 [2019-11-15 20:54:19,034 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:54:19,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-15 20:54:19,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2019-11-15 20:54:19,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 20:54:19,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 215 transitions. [2019-11-15 20:54:19,052 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 215 transitions. Word has length 58 [2019-11-15 20:54:19,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:19,053 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 215 transitions. [2019-11-15 20:54:19,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:54:19,053 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 215 transitions. [2019-11-15 20:54:19,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 20:54:19,060 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:19,060 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:19,061 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:19,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:19,062 INFO L82 PathProgramCache]: Analyzing trace with hash -461266997, now seen corresponding path program 1 times [2019-11-15 20:54:19,062 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:19,062 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156528454] [2019-11-15 20:54:19,063 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:19,063 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:19,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:19,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:54:19,237 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156528454] [2019-11-15 20:54:19,237 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:19,237 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:54:19,237 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756685585] [2019-11-15 20:54:19,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:54:19,238 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:19,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:54:19,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:19,239 INFO L87 Difference]: Start difference. First operand 141 states and 215 transitions. Second operand 4 states. [2019-11-15 20:54:19,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:19,609 INFO L93 Difference]: Finished difference Result 279 states and 421 transitions. [2019-11-15 20:54:19,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:54:19,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-15 20:54:19,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:19,613 INFO L225 Difference]: With dead ends: 279 [2019-11-15 20:54:19,613 INFO L226 Difference]: Without dead ends: 157 [2019-11-15 20:54:19,614 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:54:19,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-15 20:54:19,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 141. [2019-11-15 20:54:19,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 20:54:19,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 214 transitions. [2019-11-15 20:54:19,629 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 214 transitions. Word has length 59 [2019-11-15 20:54:19,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:19,629 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 214 transitions. [2019-11-15 20:54:19,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:54:19,630 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 214 transitions. [2019-11-15 20:54:19,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 20:54:19,630 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:19,631 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:19,631 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:19,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:19,631 INFO L82 PathProgramCache]: Analyzing trace with hash 881926454, now seen corresponding path program 1 times [2019-11-15 20:54:19,632 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:19,632 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249422751] [2019-11-15 20:54:19,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:19,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:19,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:19,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:19,742 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:54:19,742 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249422751] [2019-11-15 20:54:19,743 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:19,743 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:54:19,744 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026766721] [2019-11-15 20:54:19,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:54:19,744 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:19,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:54:19,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:19,745 INFO L87 Difference]: Start difference. First operand 141 states and 214 transitions. Second operand 4 states. [2019-11-15 20:54:20,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:20,091 INFO L93 Difference]: Finished difference Result 277 states and 418 transitions. [2019-11-15 20:54:20,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:54:20,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-15 20:54:20,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:20,094 INFO L225 Difference]: With dead ends: 277 [2019-11-15 20:54:20,094 INFO L226 Difference]: Without dead ends: 155 [2019-11-15 20:54:20,095 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:54:20,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-15 20:54:20,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 141. [2019-11-15 20:54:20,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 20:54:20,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 213 transitions. [2019-11-15 20:54:20,103 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 213 transitions. Word has length 59 [2019-11-15 20:54:20,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:20,104 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 213 transitions. [2019-11-15 20:54:20,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:54:20,104 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 213 transitions. [2019-11-15 20:54:20,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 20:54:20,105 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:20,105 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 20:54:20,106 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:20,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:20,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1831274614, now seen corresponding path program 1 times [2019-11-15 20:54:20,106 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:20,106 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298042945] [2019-11-15 20:54:20,107 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:20,107 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:20,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:20,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:20,167 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:54:20,167 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298042945] [2019-11-15 20:54:20,167 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:20,167 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:54:20,168 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571127834] [2019-11-15 20:54:20,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:54:20,168 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:20,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:54:20,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:20,169 INFO L87 Difference]: Start difference. First operand 141 states and 213 transitions. Second operand 4 states. [2019-11-15 20:54:20,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:20,475 INFO L93 Difference]: Finished difference Result 276 states and 416 transitions. [2019-11-15 20:54:20,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:54:20,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-15 20:54:20,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:20,477 INFO L225 Difference]: With dead ends: 276 [2019-11-15 20:54:20,477 INFO L226 Difference]: Without dead ends: 154 [2019-11-15 20:54:20,478 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:54:20,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-15 20:54:20,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-15 20:54:20,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 20:54:20,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 212 transitions. [2019-11-15 20:54:20,496 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 212 transitions. Word has length 59 [2019-11-15 20:54:20,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:20,497 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 212 transitions. [2019-11-15 20:54:20,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:54:20,497 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 212 transitions. [2019-11-15 20:54:20,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 20:54:20,498 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:20,498 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:20,499 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:20,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:20,499 INFO L82 PathProgramCache]: Analyzing trace with hash 376743775, now seen corresponding path program 1 times [2019-11-15 20:54:20,499 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:20,499 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996888817] [2019-11-15 20:54:20,500 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:20,500 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:20,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:20,579 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:54:20,583 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996888817] [2019-11-15 20:54:20,583 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:20,583 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:54:20,583 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83072755] [2019-11-15 20:54:20,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:54:20,584 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:20,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:54:20,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:20,584 INFO L87 Difference]: Start difference. First operand 141 states and 212 transitions. Second operand 4 states. [2019-11-15 20:54:20,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:20,894 INFO L93 Difference]: Finished difference Result 276 states and 415 transitions. [2019-11-15 20:54:20,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:54:20,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-15 20:54:20,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:20,896 INFO L225 Difference]: With dead ends: 276 [2019-11-15 20:54:20,896 INFO L226 Difference]: Without dead ends: 154 [2019-11-15 20:54:20,897 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:54:20,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-15 20:54:20,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-15 20:54:20,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 20:54:20,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 211 transitions. [2019-11-15 20:54:20,904 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 211 transitions. Word has length 59 [2019-11-15 20:54:20,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:20,904 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 211 transitions. [2019-11-15 20:54:20,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:54:20,904 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 211 transitions. [2019-11-15 20:54:20,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 20:54:20,905 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:20,905 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:20,905 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:20,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:20,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1718254146, now seen corresponding path program 1 times [2019-11-15 20:54:20,906 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:20,906 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080773603] [2019-11-15 20:54:20,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:20,907 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:20,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:20,959 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:54:20,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080773603] [2019-11-15 20:54:20,960 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:20,960 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:54:20,961 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583802497] [2019-11-15 20:54:20,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:54:20,961 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:20,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:54:20,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:20,962 INFO L87 Difference]: Start difference. First operand 141 states and 211 transitions. Second operand 4 states. [2019-11-15 20:54:21,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:21,233 INFO L93 Difference]: Finished difference Result 276 states and 414 transitions. [2019-11-15 20:54:21,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:54:21,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-15 20:54:21,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:21,235 INFO L225 Difference]: With dead ends: 276 [2019-11-15 20:54:21,235 INFO L226 Difference]: Without dead ends: 154 [2019-11-15 20:54:21,235 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:54:21,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-15 20:54:21,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-15 20:54:21,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 20:54:21,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 210 transitions. [2019-11-15 20:54:21,241 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 210 transitions. Word has length 60 [2019-11-15 20:54:21,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:21,241 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 210 transitions. [2019-11-15 20:54:21,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:54:21,241 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 210 transitions. [2019-11-15 20:54:21,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-15 20:54:21,245 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:21,246 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:21,246 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:21,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:21,246 INFO L82 PathProgramCache]: Analyzing trace with hash 316605892, now seen corresponding path program 1 times [2019-11-15 20:54:21,246 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:21,246 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813198842] [2019-11-15 20:54:21,247 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:21,247 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:21,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:21,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:21,302 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:54:21,302 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813198842] [2019-11-15 20:54:21,302 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:21,303 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:54:21,303 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639973466] [2019-11-15 20:54:21,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:54:21,303 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:21,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:54:21,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:21,304 INFO L87 Difference]: Start difference. First operand 141 states and 210 transitions. Second operand 4 states. [2019-11-15 20:54:21,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:21,620 INFO L93 Difference]: Finished difference Result 276 states and 413 transitions. [2019-11-15 20:54:21,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:54:21,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-11-15 20:54:21,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:21,622 INFO L225 Difference]: With dead ends: 276 [2019-11-15 20:54:21,622 INFO L226 Difference]: Without dead ends: 154 [2019-11-15 20:54:21,623 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:54:21,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-15 20:54:21,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-15 20:54:21,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 20:54:21,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 209 transitions. [2019-11-15 20:54:21,628 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 209 transitions. Word has length 61 [2019-11-15 20:54:21,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:21,628 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 209 transitions. [2019-11-15 20:54:21,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:54:21,628 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 209 transitions. [2019-11-15 20:54:21,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-15 20:54:21,629 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:21,629 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 20:54:21,630 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:21,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:21,633 INFO L82 PathProgramCache]: Analyzing trace with hash -223613817, now seen corresponding path program 1 times [2019-11-15 20:54:21,634 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:21,634 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412051998] [2019-11-15 20:54:21,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:21,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:21,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:21,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:21,702 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:54:21,702 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412051998] [2019-11-15 20:54:21,702 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:21,703 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:54:21,703 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129332385] [2019-11-15 20:54:21,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:54:21,703 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:21,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:54:21,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:21,704 INFO L87 Difference]: Start difference. First operand 141 states and 209 transitions. Second operand 4 states. [2019-11-15 20:54:21,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:21,967 INFO L93 Difference]: Finished difference Result 266 states and 399 transitions. [2019-11-15 20:54:21,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:54:21,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-15 20:54:21,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:21,969 INFO L225 Difference]: With dead ends: 266 [2019-11-15 20:54:21,969 INFO L226 Difference]: Without dead ends: 144 [2019-11-15 20:54:21,970 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:54:21,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-15 20:54:21,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2019-11-15 20:54:21,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 20:54:21,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2019-11-15 20:54:21,975 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 62 [2019-11-15 20:54:21,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:21,975 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2019-11-15 20:54:21,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:54:21,975 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2019-11-15 20:54:21,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-15 20:54:21,976 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:21,976 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:21,976 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:21,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:21,977 INFO L82 PathProgramCache]: Analyzing trace with hash 176537583, now seen corresponding path program 1 times [2019-11-15 20:54:21,977 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:21,977 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006887044] [2019-11-15 20:54:21,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:21,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:21,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:22,026 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:54:22,027 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006887044] [2019-11-15 20:54:22,027 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:22,027 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:54:22,027 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586257748] [2019-11-15 20:54:22,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:54:22,028 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:22,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:54:22,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:22,028 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand 4 states. [2019-11-15 20:54:22,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:22,330 INFO L93 Difference]: Finished difference Result 306 states and 460 transitions. [2019-11-15 20:54:22,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:54:22,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-15 20:54:22,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:22,332 INFO L225 Difference]: With dead ends: 306 [2019-11-15 20:54:22,332 INFO L226 Difference]: Without dead ends: 184 [2019-11-15 20:54:22,333 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:54:22,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-15 20:54:22,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2019-11-15 20:54:22,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 20:54:22,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 246 transitions. [2019-11-15 20:54:22,338 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 246 transitions. Word has length 62 [2019-11-15 20:54:22,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:22,338 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 246 transitions. [2019-11-15 20:54:22,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:54:22,339 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 246 transitions. [2019-11-15 20:54:22,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-15 20:54:22,339 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:22,340 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:22,340 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:22,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:22,340 INFO L82 PathProgramCache]: Analyzing trace with hash 551995766, now seen corresponding path program 1 times [2019-11-15 20:54:22,340 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:22,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734383882] [2019-11-15 20:54:22,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:22,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:22,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:22,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:22,387 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:54:22,387 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734383882] [2019-11-15 20:54:22,387 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:22,388 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:54:22,388 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983210374] [2019-11-15 20:54:22,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:54:22,388 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:22,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:54:22,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:22,389 INFO L87 Difference]: Start difference. First operand 163 states and 246 transitions. Second operand 4 states. [2019-11-15 20:54:22,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:22,718 INFO L93 Difference]: Finished difference Result 328 states and 497 transitions. [2019-11-15 20:54:22,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:54:22,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-15 20:54:22,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:22,728 INFO L225 Difference]: With dead ends: 328 [2019-11-15 20:54:22,728 INFO L226 Difference]: Without dead ends: 184 [2019-11-15 20:54:22,728 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:54:22,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-15 20:54:22,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2019-11-15 20:54:22,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 20:54:22,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 245 transitions. [2019-11-15 20:54:22,734 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 245 transitions. Word has length 75 [2019-11-15 20:54:22,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:22,734 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 245 transitions. [2019-11-15 20:54:22,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:54:22,734 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 245 transitions. [2019-11-15 20:54:22,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-15 20:54:22,735 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:22,736 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 20:54:22,736 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:22,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:22,736 INFO L82 PathProgramCache]: Analyzing trace with hash -475509842, now seen corresponding path program 1 times [2019-11-15 20:54:22,736 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:22,737 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715480350] [2019-11-15 20:54:22,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:22,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:22,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:22,786 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:54:22,786 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715480350] [2019-11-15 20:54:22,786 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:22,786 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:54:22,787 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316331545] [2019-11-15 20:54:22,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:54:22,787 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:22,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:54:22,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:22,788 INFO L87 Difference]: Start difference. First operand 163 states and 245 transitions. Second operand 4 states. [2019-11-15 20:54:23,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:23,096 INFO L93 Difference]: Finished difference Result 327 states and 494 transitions. [2019-11-15 20:54:23,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:54:23,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-15 20:54:23,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:23,098 INFO L225 Difference]: With dead ends: 327 [2019-11-15 20:54:23,098 INFO L226 Difference]: Without dead ends: 183 [2019-11-15 20:54:23,099 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:54:23,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-15 20:54:23,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 163. [2019-11-15 20:54:23,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 20:54:23,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 244 transitions. [2019-11-15 20:54:23,104 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 244 transitions. Word has length 76 [2019-11-15 20:54:23,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:23,104 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 244 transitions. [2019-11-15 20:54:23,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:54:23,104 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 244 transitions. [2019-11-15 20:54:23,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-15 20:54:23,105 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:23,105 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:23,106 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:23,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:23,106 INFO L82 PathProgramCache]: Analyzing trace with hash 867683609, now seen corresponding path program 1 times [2019-11-15 20:54:23,106 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:23,106 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955774319] [2019-11-15 20:54:23,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:23,107 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:23,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:23,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:23,150 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:54:23,150 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955774319] [2019-11-15 20:54:23,150 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:23,150 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:54:23,151 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886066026] [2019-11-15 20:54:23,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:54:23,151 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:23,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:54:23,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:23,152 INFO L87 Difference]: Start difference. First operand 163 states and 244 transitions. Second operand 4 states. [2019-11-15 20:54:23,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:23,486 INFO L93 Difference]: Finished difference Result 325 states and 490 transitions. [2019-11-15 20:54:23,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:54:23,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-15 20:54:23,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:23,488 INFO L225 Difference]: With dead ends: 325 [2019-11-15 20:54:23,488 INFO L226 Difference]: Without dead ends: 181 [2019-11-15 20:54:23,488 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:54:23,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-15 20:54:23,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2019-11-15 20:54:23,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 20:54:23,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 243 transitions. [2019-11-15 20:54:23,493 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 243 transitions. Word has length 76 [2019-11-15 20:54:23,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:23,494 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 243 transitions. [2019-11-15 20:54:23,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:54:23,494 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 243 transitions. [2019-11-15 20:54:23,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-15 20:54:23,495 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:23,495 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:23,495 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:23,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:23,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1817031769, now seen corresponding path program 1 times [2019-11-15 20:54:23,495 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:23,496 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34405586] [2019-11-15 20:54:23,496 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:23,496 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:23,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:23,546 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:54:23,546 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34405586] [2019-11-15 20:54:23,547 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:23,547 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:54:23,547 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290533434] [2019-11-15 20:54:23,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:54:23,548 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:23,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:54:23,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:23,549 INFO L87 Difference]: Start difference. First operand 163 states and 243 transitions. Second operand 4 states. [2019-11-15 20:54:23,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:23,922 INFO L93 Difference]: Finished difference Result 324 states and 487 transitions. [2019-11-15 20:54:23,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:54:23,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-15 20:54:23,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:23,924 INFO L225 Difference]: With dead ends: 324 [2019-11-15 20:54:23,924 INFO L226 Difference]: Without dead ends: 180 [2019-11-15 20:54:23,925 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:54:23,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-15 20:54:23,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-11-15 20:54:23,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 20:54:23,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 242 transitions. [2019-11-15 20:54:23,929 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 242 transitions. Word has length 76 [2019-11-15 20:54:23,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:23,930 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 242 transitions. [2019-11-15 20:54:23,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:54:23,930 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 242 transitions. [2019-11-15 20:54:23,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-15 20:54:23,931 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:23,932 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-11-15 20:54:23,932 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:23,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:23,932 INFO L82 PathProgramCache]: Analyzing trace with hash 362500930, now seen corresponding path program 1 times [2019-11-15 20:54:23,932 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:23,932 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090604216] [2019-11-15 20:54:23,933 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:23,933 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:23,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:23,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:23,985 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:54:23,985 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090604216] [2019-11-15 20:54:23,986 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:23,986 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:54:23,987 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159867691] [2019-11-15 20:54:23,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:54:23,987 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:23,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:54:23,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:23,988 INFO L87 Difference]: Start difference. First operand 163 states and 242 transitions. Second operand 4 states. [2019-11-15 20:54:24,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:24,260 INFO L93 Difference]: Finished difference Result 324 states and 485 transitions. [2019-11-15 20:54:24,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:54:24,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-15 20:54:24,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:24,262 INFO L225 Difference]: With dead ends: 324 [2019-11-15 20:54:24,262 INFO L226 Difference]: Without dead ends: 180 [2019-11-15 20:54:24,263 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:54:24,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-15 20:54:24,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-11-15 20:54:24,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 20:54:24,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 241 transitions. [2019-11-15 20:54:24,267 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 241 transitions. Word has length 76 [2019-11-15 20:54:24,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:24,268 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 241 transitions. [2019-11-15 20:54:24,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:54:24,268 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 241 transitions. [2019-11-15 20:54:24,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-15 20:54:24,269 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:24,269 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:24,269 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:24,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:24,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1276725951, now seen corresponding path program 1 times [2019-11-15 20:54:24,269 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:24,270 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297896995] [2019-11-15 20:54:24,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:24,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:24,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:24,315 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:54:24,316 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297896995] [2019-11-15 20:54:24,316 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:24,316 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:54:24,316 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179248438] [2019-11-15 20:54:24,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:54:24,317 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:24,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:54:24,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:24,318 INFO L87 Difference]: Start difference. First operand 163 states and 241 transitions. Second operand 4 states. [2019-11-15 20:54:24,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:24,661 INFO L93 Difference]: Finished difference Result 324 states and 483 transitions. [2019-11-15 20:54:24,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:54:24,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-15 20:54:24,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:24,662 INFO L225 Difference]: With dead ends: 324 [2019-11-15 20:54:24,662 INFO L226 Difference]: Without dead ends: 180 [2019-11-15 20:54:24,663 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:54:24,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-15 20:54:24,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-11-15 20:54:24,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 20:54:24,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 240 transitions. [2019-11-15 20:54:24,666 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 240 transitions. Word has length 77 [2019-11-15 20:54:24,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:24,666 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 240 transitions. [2019-11-15 20:54:24,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:54:24,667 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2019-11-15 20:54:24,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-15 20:54:24,668 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:24,668 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:24,668 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:24,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:24,668 INFO L82 PathProgramCache]: Analyzing trace with hash -485866265, now seen corresponding path program 1 times [2019-11-15 20:54:24,669 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:24,669 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136206207] [2019-11-15 20:54:24,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:24,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:24,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:24,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:24,712 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:54:24,712 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136206207] [2019-11-15 20:54:24,712 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:24,712 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:54:24,712 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120119937] [2019-11-15 20:54:24,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:54:24,713 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:24,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:54:24,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:24,714 INFO L87 Difference]: Start difference. First operand 163 states and 240 transitions. Second operand 4 states. [2019-11-15 20:54:25,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:25,046 INFO L93 Difference]: Finished difference Result 324 states and 481 transitions. [2019-11-15 20:54:25,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:54:25,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-11-15 20:54:25,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:25,048 INFO L225 Difference]: With dead ends: 324 [2019-11-15 20:54:25,048 INFO L226 Difference]: Without dead ends: 180 [2019-11-15 20:54:25,048 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:54:25,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-15 20:54:25,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-11-15 20:54:25,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 20:54:25,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 239 transitions. [2019-11-15 20:54:25,053 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 239 transitions. Word has length 78 [2019-11-15 20:54:25,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:25,053 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 239 transitions. [2019-11-15 20:54:25,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:54:25,054 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 239 transitions. [2019-11-15 20:54:25,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-15 20:54:25,054 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:25,055 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:25,055 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:25,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:25,055 INFO L82 PathProgramCache]: Analyzing trace with hash 669553092, now seen corresponding path program 1 times [2019-11-15 20:54:25,055 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:25,056 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104594931] [2019-11-15 20:54:25,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:25,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:25,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:25,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:25,097 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:54:25,097 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104594931] [2019-11-15 20:54:25,098 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:25,098 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:54:25,098 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013419629] [2019-11-15 20:54:25,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:54:25,099 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:25,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:54:25,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:25,099 INFO L87 Difference]: Start difference. First operand 163 states and 239 transitions. Second operand 4 states. [2019-11-15 20:54:25,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:25,412 INFO L93 Difference]: Finished difference Result 314 states and 466 transitions. [2019-11-15 20:54:25,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:54:25,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-11-15 20:54:25,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:25,414 INFO L225 Difference]: With dead ends: 314 [2019-11-15 20:54:25,414 INFO L226 Difference]: Without dead ends: 170 [2019-11-15 20:54:25,415 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:54:25,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-15 20:54:25,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 163. [2019-11-15 20:54:25,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 20:54:25,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 238 transitions. [2019-11-15 20:54:25,419 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 238 transitions. Word has length 79 [2019-11-15 20:54:25,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:25,419 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 238 transitions. [2019-11-15 20:54:25,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:54:25,419 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 238 transitions. [2019-11-15 20:54:25,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 20:54:25,420 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:25,420 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:25,420 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:25,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:25,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1124223160, now seen corresponding path program 1 times [2019-11-15 20:54:25,421 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:25,421 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619683358] [2019-11-15 20:54:25,421 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:25,421 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:25,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:25,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:25,488 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 20:54:25,488 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619683358] [2019-11-15 20:54:25,489 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:25,489 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:54:25,489 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436474261] [2019-11-15 20:54:25,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:54:25,490 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:25,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:54:25,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:25,490 INFO L87 Difference]: Start difference. First operand 163 states and 238 transitions. Second operand 4 states. [2019-11-15 20:54:25,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:25,953 INFO L93 Difference]: Finished difference Result 402 states and 601 transitions. [2019-11-15 20:54:25,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:54:25,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-11-15 20:54:25,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:25,955 INFO L225 Difference]: With dead ends: 402 [2019-11-15 20:54:25,956 INFO L226 Difference]: Without dead ends: 258 [2019-11-15 20:54:25,956 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:54:25,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-11-15 20:54:25,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 206. [2019-11-15 20:54:25,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-15 20:54:25,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 316 transitions. [2019-11-15 20:54:25,962 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 316 transitions. Word has length 84 [2019-11-15 20:54:25,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:25,963 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 316 transitions. [2019-11-15 20:54:25,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:54:25,963 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 316 transitions. [2019-11-15 20:54:25,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 20:54:25,964 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:25,964 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:25,964 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:25,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:25,965 INFO L82 PathProgramCache]: Analyzing trace with hash -2021616438, now seen corresponding path program 1 times [2019-11-15 20:54:25,965 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:25,965 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051431710] [2019-11-15 20:54:25,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:25,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:25,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:25,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:26,021 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 20:54:26,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051431710] [2019-11-15 20:54:26,022 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:26,022 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:54:26,022 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833583093] [2019-11-15 20:54:26,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:54:26,023 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:26,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:54:26,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:26,023 INFO L87 Difference]: Start difference. First operand 206 states and 316 transitions. Second operand 4 states. [2019-11-15 20:54:26,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:26,337 INFO L93 Difference]: Finished difference Result 442 states and 685 transitions. [2019-11-15 20:54:26,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:54:26,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-11-15 20:54:26,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:26,339 INFO L225 Difference]: With dead ends: 442 [2019-11-15 20:54:26,340 INFO L226 Difference]: Without dead ends: 255 [2019-11-15 20:54:26,340 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:54:26,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-15 20:54:26,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 230. [2019-11-15 20:54:26,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-15 20:54:26,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 358 transitions. [2019-11-15 20:54:26,346 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 358 transitions. Word has length 84 [2019-11-15 20:54:26,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:26,347 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 358 transitions. [2019-11-15 20:54:26,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:54:26,347 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 358 transitions. [2019-11-15 20:54:26,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 20:54:26,348 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:26,348 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:26,349 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:26,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:26,349 INFO L82 PathProgramCache]: Analyzing trace with hash -344765763, now seen corresponding path program 1 times [2019-11-15 20:54:26,349 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:26,349 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146573697] [2019-11-15 20:54:26,350 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:26,350 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:26,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:26,411 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 20:54:26,411 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146573697] [2019-11-15 20:54:26,411 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:26,412 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:54:26,412 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738468796] [2019-11-15 20:54:26,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:54:26,412 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:26,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:54:26,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:26,413 INFO L87 Difference]: Start difference. First operand 230 states and 358 transitions. Second operand 4 states. [2019-11-15 20:54:26,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:26,921 INFO L93 Difference]: Finished difference Result 493 states and 762 transitions. [2019-11-15 20:54:26,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:54:26,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-15 20:54:26,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:26,923 INFO L225 Difference]: With dead ends: 493 [2019-11-15 20:54:26,923 INFO L226 Difference]: Without dead ends: 282 [2019-11-15 20:54:26,924 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:54:26,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-15 20:54:26,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 230. [2019-11-15 20:54:26,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-15 20:54:26,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 357 transitions. [2019-11-15 20:54:26,931 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 357 transitions. Word has length 97 [2019-11-15 20:54:26,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:26,931 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 357 transitions. [2019-11-15 20:54:26,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:54:26,931 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 357 transitions. [2019-11-15 20:54:26,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 20:54:26,932 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:26,932 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:26,933 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:26,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:26,933 INFO L82 PathProgramCache]: Analyzing trace with hash -304091013, now seen corresponding path program 1 times [2019-11-15 20:54:26,933 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:26,933 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672807124] [2019-11-15 20:54:26,933 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:26,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:26,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:26,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:26,987 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 20:54:26,987 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672807124] [2019-11-15 20:54:26,987 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:26,987 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:54:26,988 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258670678] [2019-11-15 20:54:26,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:54:26,988 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:26,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:54:26,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:26,989 INFO L87 Difference]: Start difference. First operand 230 states and 357 transitions. Second operand 4 states. [2019-11-15 20:54:27,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:27,366 INFO L93 Difference]: Finished difference Result 466 states and 724 transitions. [2019-11-15 20:54:27,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:54:27,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-15 20:54:27,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:27,368 INFO L225 Difference]: With dead ends: 466 [2019-11-15 20:54:27,368 INFO L226 Difference]: Without dead ends: 255 [2019-11-15 20:54:27,369 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:54:27,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-15 20:54:27,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 230. [2019-11-15 20:54:27,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-15 20:54:27,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 356 transitions. [2019-11-15 20:54:27,375 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 356 transitions. Word has length 97 [2019-11-15 20:54:27,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:27,375 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 356 transitions. [2019-11-15 20:54:27,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:54:27,376 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2019-11-15 20:54:27,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 20:54:27,377 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:27,377 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:27,377 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:27,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:27,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1789653831, now seen corresponding path program 1 times [2019-11-15 20:54:27,378 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:27,378 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382656192] [2019-11-15 20:54:27,378 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:27,378 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:27,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:27,428 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 20:54:27,428 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382656192] [2019-11-15 20:54:27,428 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:27,429 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:54:27,429 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461292004] [2019-11-15 20:54:27,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:54:27,429 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:27,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:54:27,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:27,430 INFO L87 Difference]: Start difference. First operand 230 states and 356 transitions. Second operand 4 states. [2019-11-15 20:54:27,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:27,834 INFO L93 Difference]: Finished difference Result 492 states and 757 transitions. [2019-11-15 20:54:27,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:54:27,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-15 20:54:27,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:27,836 INFO L225 Difference]: With dead ends: 492 [2019-11-15 20:54:27,836 INFO L226 Difference]: Without dead ends: 281 [2019-11-15 20:54:27,837 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:54:27,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-11-15 20:54:27,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 230. [2019-11-15 20:54:27,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-15 20:54:27,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 355 transitions. [2019-11-15 20:54:27,843 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 355 transitions. Word has length 98 [2019-11-15 20:54:27,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:27,843 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 355 transitions. [2019-11-15 20:54:27,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:54:27,843 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 355 transitions. [2019-11-15 20:54:27,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 20:54:27,844 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:27,844 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:27,845 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:27,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:27,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1162120014, now seen corresponding path program 1 times [2019-11-15 20:54:27,845 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:27,845 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167973102] [2019-11-15 20:54:27,845 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:27,845 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:27,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:27,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:27,909 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 20:54:27,909 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167973102] [2019-11-15 20:54:27,910 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:27,910 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:54:27,910 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332742213] [2019-11-15 20:54:27,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:54:27,911 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:27,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:54:27,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:27,912 INFO L87 Difference]: Start difference. First operand 230 states and 355 transitions. Second operand 4 states. [2019-11-15 20:54:28,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:28,297 INFO L93 Difference]: Finished difference Result 490 states and 753 transitions. [2019-11-15 20:54:28,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:54:28,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-15 20:54:28,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:28,299 INFO L225 Difference]: With dead ends: 490 [2019-11-15 20:54:28,299 INFO L226 Difference]: Without dead ends: 279 [2019-11-15 20:54:28,300 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:54:28,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-15 20:54:28,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 230. [2019-11-15 20:54:28,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-15 20:54:28,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 354 transitions. [2019-11-15 20:54:28,309 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 354 transitions. Word has length 98 [2019-11-15 20:54:28,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:28,309 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 354 transitions. [2019-11-15 20:54:28,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:54:28,310 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 354 transitions. [2019-11-15 20:54:28,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 20:54:28,311 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:28,311 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:28,311 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:28,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:28,312 INFO L82 PathProgramCache]: Analyzing trace with hash -212771854, now seen corresponding path program 1 times [2019-11-15 20:54:28,312 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:28,312 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539908581] [2019-11-15 20:54:28,312 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:28,312 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:28,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:28,373 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 20:54:28,373 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539908581] [2019-11-15 20:54:28,373 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:28,374 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:54:28,374 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434165058] [2019-11-15 20:54:28,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:54:28,375 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:28,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:54:28,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:28,375 INFO L87 Difference]: Start difference. First operand 230 states and 354 transitions. Second operand 4 states. [2019-11-15 20:54:28,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:28,745 INFO L93 Difference]: Finished difference Result 489 states and 750 transitions. [2019-11-15 20:54:28,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:54:28,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-15 20:54:28,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:28,747 INFO L225 Difference]: With dead ends: 489 [2019-11-15 20:54:28,747 INFO L226 Difference]: Without dead ends: 278 [2019-11-15 20:54:28,747 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:54:28,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-11-15 20:54:28,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 230. [2019-11-15 20:54:28,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-15 20:54:28,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 353 transitions. [2019-11-15 20:54:28,752 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 353 transitions. Word has length 98 [2019-11-15 20:54:28,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:28,753 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 353 transitions. [2019-11-15 20:54:28,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:54:28,753 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 353 transitions. [2019-11-15 20:54:28,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 20:54:28,754 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:28,754 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:28,754 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:28,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:28,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1667302693, now seen corresponding path program 1 times [2019-11-15 20:54:28,754 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:28,755 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842943100] [2019-11-15 20:54:28,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:28,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:28,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:28,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:28,824 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-15 20:54:28,825 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842943100] [2019-11-15 20:54:28,826 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:28,826 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:54:28,826 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075432808] [2019-11-15 20:54:28,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:54:28,827 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:28,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:54:28,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:54:28,827 INFO L87 Difference]: Start difference. First operand 230 states and 353 transitions. Second operand 5 states. [2019-11-15 20:54:29,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:29,168 INFO L93 Difference]: Finished difference Result 462 states and 714 transitions. [2019-11-15 20:54:29,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:54:29,169 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-11-15 20:54:29,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:29,170 INFO L225 Difference]: With dead ends: 462 [2019-11-15 20:54:29,170 INFO L226 Difference]: Without dead ends: 251 [2019-11-15 20:54:29,171 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:54:29,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-11-15 20:54:29,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2019-11-15 20:54:29,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 20:54:29,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 379 transitions. [2019-11-15 20:54:29,177 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 379 transitions. Word has length 98 [2019-11-15 20:54:29,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:29,178 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 379 transitions. [2019-11-15 20:54:29,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:54:29,178 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 379 transitions. [2019-11-15 20:54:29,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 20:54:29,178 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:29,179 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:29,179 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:29,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:29,179 INFO L82 PathProgramCache]: Analyzing trace with hash 98797236, now seen corresponding path program 1 times [2019-11-15 20:54:29,179 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:29,179 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203670447] [2019-11-15 20:54:29,180 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:29,180 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:29,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:29,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:29,250 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 20:54:29,251 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203670447] [2019-11-15 20:54:29,251 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:29,251 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:54:29,251 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352620609] [2019-11-15 20:54:29,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:54:29,252 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:29,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:54:29,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:29,252 INFO L87 Difference]: Start difference. First operand 250 states and 379 transitions. Second operand 4 states. [2019-11-15 20:54:29,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:29,497 INFO L93 Difference]: Finished difference Result 503 states and 764 transitions. [2019-11-15 20:54:29,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:54:29,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-15 20:54:29,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:29,499 INFO L225 Difference]: With dead ends: 503 [2019-11-15 20:54:29,499 INFO L226 Difference]: Without dead ends: 272 [2019-11-15 20:54:29,500 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:54:29,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-15 20:54:29,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2019-11-15 20:54:29,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 20:54:29,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 378 transitions. [2019-11-15 20:54:29,507 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 378 transitions. Word has length 98 [2019-11-15 20:54:29,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:29,507 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 378 transitions. [2019-11-15 20:54:29,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:54:29,507 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 378 transitions. [2019-11-15 20:54:29,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 20:54:29,508 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:29,508 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:29,508 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:29,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:29,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1048145396, now seen corresponding path program 1 times [2019-11-15 20:54:29,509 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:29,509 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822776512] [2019-11-15 20:54:29,509 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:29,509 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:29,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:29,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:29,567 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 20:54:29,568 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822776512] [2019-11-15 20:54:29,568 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:29,568 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:54:29,568 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799779082] [2019-11-15 20:54:29,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:54:29,569 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:29,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:54:29,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:29,569 INFO L87 Difference]: Start difference. First operand 250 states and 378 transitions. Second operand 4 states. [2019-11-15 20:54:29,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:29,927 INFO L93 Difference]: Finished difference Result 502 states and 761 transitions. [2019-11-15 20:54:29,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:54:29,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-15 20:54:29,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:29,929 INFO L225 Difference]: With dead ends: 502 [2019-11-15 20:54:29,929 INFO L226 Difference]: Without dead ends: 271 [2019-11-15 20:54:29,930 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:54:29,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-15 20:54:29,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-11-15 20:54:29,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 20:54:29,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 377 transitions. [2019-11-15 20:54:29,937 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 377 transitions. Word has length 98 [2019-11-15 20:54:29,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:29,937 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 377 transitions. [2019-11-15 20:54:29,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:54:29,937 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 377 transitions. [2019-11-15 20:54:29,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 20:54:29,938 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:29,938 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:29,938 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:29,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:29,939 INFO L82 PathProgramCache]: Analyzing trace with hash -645348551, now seen corresponding path program 1 times [2019-11-15 20:54:29,939 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:29,939 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580373054] [2019-11-15 20:54:29,939 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:29,939 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:29,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:29,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:29,996 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 20:54:29,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580373054] [2019-11-15 20:54:29,997 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:29,997 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:54:29,997 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460818615] [2019-11-15 20:54:29,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:54:29,997 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:29,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:54:29,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:29,998 INFO L87 Difference]: Start difference. First operand 250 states and 377 transitions. Second operand 4 states. [2019-11-15 20:54:30,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:30,401 INFO L93 Difference]: Finished difference Result 529 states and 795 transitions. [2019-11-15 20:54:30,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:54:30,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-15 20:54:30,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:30,404 INFO L225 Difference]: With dead ends: 529 [2019-11-15 20:54:30,404 INFO L226 Difference]: Without dead ends: 298 [2019-11-15 20:54:30,404 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:54:30,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-15 20:54:30,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 250. [2019-11-15 20:54:30,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 20:54:30,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 376 transitions. [2019-11-15 20:54:30,413 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 376 transitions. Word has length 99 [2019-11-15 20:54:30,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:30,413 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 376 transitions. [2019-11-15 20:54:30,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:54:30,414 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 376 transitions. [2019-11-15 20:54:30,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 20:54:30,415 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:30,415 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:30,415 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:30,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:30,415 INFO L82 PathProgramCache]: Analyzing trace with hash -211619465, now seen corresponding path program 1 times [2019-11-15 20:54:30,416 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:30,418 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752028878] [2019-11-15 20:54:30,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:30,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:30,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:30,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:30,467 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 20:54:30,470 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752028878] [2019-11-15 20:54:30,470 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:30,470 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:54:30,471 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891854272] [2019-11-15 20:54:30,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:54:30,471 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:30,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:54:30,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:30,472 INFO L87 Difference]: Start difference. First operand 250 states and 376 transitions. Second operand 4 states. [2019-11-15 20:54:30,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:30,769 INFO L93 Difference]: Finished difference Result 502 states and 757 transitions. [2019-11-15 20:54:30,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:54:30,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-15 20:54:30,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:30,771 INFO L225 Difference]: With dead ends: 502 [2019-11-15 20:54:30,771 INFO L226 Difference]: Without dead ends: 271 [2019-11-15 20:54:30,771 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:54:30,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-15 20:54:30,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-11-15 20:54:30,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 20:54:30,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 375 transitions. [2019-11-15 20:54:30,778 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 375 transitions. Word has length 99 [2019-11-15 20:54:30,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:30,778 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 375 transitions. [2019-11-15 20:54:30,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:54:30,778 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 375 transitions. [2019-11-15 20:54:30,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-15 20:54:30,779 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:30,779 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:30,780 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:30,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:30,780 INFO L82 PathProgramCache]: Analyzing trace with hash -300903122, now seen corresponding path program 1 times [2019-11-15 20:54:30,780 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:30,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489022707] [2019-11-15 20:54:30,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:30,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:30,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:30,844 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 20:54:30,844 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489022707] [2019-11-15 20:54:30,845 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:30,845 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:54:30,845 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625859824] [2019-11-15 20:54:30,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:54:30,846 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:30,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:54:30,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:30,846 INFO L87 Difference]: Start difference. First operand 250 states and 375 transitions. Second operand 4 states. [2019-11-15 20:54:31,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:31,145 INFO L93 Difference]: Finished difference Result 529 states and 791 transitions. [2019-11-15 20:54:31,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:54:31,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-15 20:54:31,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:31,147 INFO L225 Difference]: With dead ends: 529 [2019-11-15 20:54:31,147 INFO L226 Difference]: Without dead ends: 298 [2019-11-15 20:54:31,148 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:31,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-15 20:54:31,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 250. [2019-11-15 20:54:31,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 20:54:31,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 374 transitions. [2019-11-15 20:54:31,154 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 374 transitions. Word has length 100 [2019-11-15 20:54:31,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:31,155 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 374 transitions. [2019-11-15 20:54:31,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:54:31,155 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 374 transitions. [2019-11-15 20:54:31,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-15 20:54:31,156 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:31,156 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:31,156 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:31,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:31,157 INFO L82 PathProgramCache]: Analyzing trace with hash 259796656, now seen corresponding path program 1 times [2019-11-15 20:54:31,157 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:31,157 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886648472] [2019-11-15 20:54:31,157 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:31,158 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:31,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:31,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:31,220 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 20:54:31,220 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886648472] [2019-11-15 20:54:31,220 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:31,220 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:54:31,220 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761767526] [2019-11-15 20:54:31,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:54:31,221 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:31,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:54:31,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:31,222 INFO L87 Difference]: Start difference. First operand 250 states and 374 transitions. Second operand 4 states. [2019-11-15 20:54:31,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:31,474 INFO L93 Difference]: Finished difference Result 502 states and 753 transitions. [2019-11-15 20:54:31,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:54:31,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-15 20:54:31,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:31,476 INFO L225 Difference]: With dead ends: 502 [2019-11-15 20:54:31,476 INFO L226 Difference]: Without dead ends: 271 [2019-11-15 20:54:31,477 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:31,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-15 20:54:31,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-11-15 20:54:31,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 20:54:31,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 373 transitions. [2019-11-15 20:54:31,483 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 373 transitions. Word has length 100 [2019-11-15 20:54:31,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:31,483 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 373 transitions. [2019-11-15 20:54:31,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:54:31,484 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 373 transitions. [2019-11-15 20:54:31,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-15 20:54:31,484 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:31,485 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:31,485 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:31,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:31,485 INFO L82 PathProgramCache]: Analyzing trace with hash 584269940, now seen corresponding path program 1 times [2019-11-15 20:54:31,485 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:31,485 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736469598] [2019-11-15 20:54:31,485 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:31,485 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:31,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:31,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:31,538 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 20:54:31,539 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736469598] [2019-11-15 20:54:31,539 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:31,539 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:54:31,539 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626084465] [2019-11-15 20:54:31,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:54:31,540 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:31,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:54:31,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:31,540 INFO L87 Difference]: Start difference. First operand 250 states and 373 transitions. Second operand 4 states. [2019-11-15 20:54:31,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:31,877 INFO L93 Difference]: Finished difference Result 529 states and 787 transitions. [2019-11-15 20:54:31,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:54:31,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-15 20:54:31,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:31,879 INFO L225 Difference]: With dead ends: 529 [2019-11-15 20:54:31,880 INFO L226 Difference]: Without dead ends: 298 [2019-11-15 20:54:31,880 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:54:31,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-15 20:54:31,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 250. [2019-11-15 20:54:31,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 20:54:31,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 372 transitions. [2019-11-15 20:54:31,887 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 372 transitions. Word has length 101 [2019-11-15 20:54:31,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:31,887 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 372 transitions. [2019-11-15 20:54:31,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:54:31,887 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 372 transitions. [2019-11-15 20:54:31,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-15 20:54:31,888 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:31,888 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:31,888 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:31,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:31,889 INFO L82 PathProgramCache]: Analyzing trace with hash 786093874, now seen corresponding path program 1 times [2019-11-15 20:54:31,889 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:31,889 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329381239] [2019-11-15 20:54:31,889 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:31,889 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:31,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:31,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:31,940 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 20:54:31,941 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329381239] [2019-11-15 20:54:31,941 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:31,941 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:54:31,941 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853741811] [2019-11-15 20:54:31,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:54:31,942 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:31,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:54:31,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:31,943 INFO L87 Difference]: Start difference. First operand 250 states and 372 transitions. Second operand 4 states. [2019-11-15 20:54:32,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:32,294 INFO L93 Difference]: Finished difference Result 502 states and 749 transitions. [2019-11-15 20:54:32,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:54:32,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-15 20:54:32,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:32,296 INFO L225 Difference]: With dead ends: 502 [2019-11-15 20:54:32,296 INFO L226 Difference]: Without dead ends: 271 [2019-11-15 20:54:32,297 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:54:32,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-15 20:54:32,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-11-15 20:54:32,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 20:54:32,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 371 transitions. [2019-11-15 20:54:32,303 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 371 transitions. Word has length 101 [2019-11-15 20:54:32,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:32,303 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 371 transitions. [2019-11-15 20:54:32,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:54:32,303 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 371 transitions. [2019-11-15 20:54:32,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-15 20:54:32,304 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:32,304 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:32,305 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:32,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:32,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1052130441, now seen corresponding path program 1 times [2019-11-15 20:54:32,305 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:32,305 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263645021] [2019-11-15 20:54:32,305 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:32,305 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:32,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:32,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:32,368 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 20:54:32,369 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263645021] [2019-11-15 20:54:32,369 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:32,369 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:54:32,369 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446905046] [2019-11-15 20:54:32,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:54:32,370 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:32,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:54:32,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:32,370 INFO L87 Difference]: Start difference. First operand 250 states and 371 transitions. Second operand 4 states. [2019-11-15 20:54:32,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:32,674 INFO L93 Difference]: Finished difference Result 519 states and 771 transitions. [2019-11-15 20:54:32,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:54:32,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-15 20:54:32,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:32,675 INFO L225 Difference]: With dead ends: 519 [2019-11-15 20:54:32,675 INFO L226 Difference]: Without dead ends: 288 [2019-11-15 20:54:32,676 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:32,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-11-15 20:54:32,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 250. [2019-11-15 20:54:32,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 20:54:32,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 370 transitions. [2019-11-15 20:54:32,682 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 370 transitions. Word has length 102 [2019-11-15 20:54:32,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:32,682 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 370 transitions. [2019-11-15 20:54:32,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:54:32,683 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 370 transitions. [2019-11-15 20:54:32,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-15 20:54:32,684 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:32,684 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:32,684 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:32,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:32,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1281262197, now seen corresponding path program 1 times [2019-11-15 20:54:32,685 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:32,685 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314869785] [2019-11-15 20:54:32,685 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:32,685 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:32,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:32,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:32,748 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 20:54:32,749 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314869785] [2019-11-15 20:54:32,749 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:32,749 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:54:32,749 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888053841] [2019-11-15 20:54:32,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:54:32,750 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:32,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:54:32,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:32,750 INFO L87 Difference]: Start difference. First operand 250 states and 370 transitions. Second operand 4 states. [2019-11-15 20:54:33,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:33,041 INFO L93 Difference]: Finished difference Result 492 states and 733 transitions. [2019-11-15 20:54:33,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:54:33,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-15 20:54:33,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:33,043 INFO L225 Difference]: With dead ends: 492 [2019-11-15 20:54:33,043 INFO L226 Difference]: Without dead ends: 261 [2019-11-15 20:54:33,044 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:33,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-11-15 20:54:33,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 250. [2019-11-15 20:54:33,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 20:54:33,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 369 transitions. [2019-11-15 20:54:33,050 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 369 transitions. Word has length 102 [2019-11-15 20:54:33,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:33,051 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 369 transitions. [2019-11-15 20:54:33,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:54:33,051 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 369 transitions. [2019-11-15 20:54:33,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-15 20:54:33,052 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:33,052 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:33,052 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:33,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:33,053 INFO L82 PathProgramCache]: Analyzing trace with hash -251052971, now seen corresponding path program 1 times [2019-11-15 20:54:33,053 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:33,053 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256106676] [2019-11-15 20:54:33,053 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:33,053 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:33,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:33,118 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 20:54:33,118 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256106676] [2019-11-15 20:54:33,118 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:33,118 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:54:33,118 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042024197] [2019-11-15 20:54:33,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:54:33,121 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:33,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:54:33,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:33,122 INFO L87 Difference]: Start difference. First operand 250 states and 369 transitions. Second operand 4 states. [2019-11-15 20:54:33,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:33,564 INFO L93 Difference]: Finished difference Result 519 states and 767 transitions. [2019-11-15 20:54:33,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:54:33,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-11-15 20:54:33,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:33,566 INFO L225 Difference]: With dead ends: 519 [2019-11-15 20:54:33,567 INFO L226 Difference]: Without dead ends: 288 [2019-11-15 20:54:33,567 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:54:33,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-11-15 20:54:33,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 250. [2019-11-15 20:54:33,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 20:54:33,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 368 transitions. [2019-11-15 20:54:33,576 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 368 transitions. Word has length 106 [2019-11-15 20:54:33,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:33,577 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 368 transitions. [2019-11-15 20:54:33,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:54:33,577 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 368 transitions. [2019-11-15 20:54:33,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-15 20:54:33,578 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:33,578 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:33,579 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:33,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:33,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1937232809, now seen corresponding path program 1 times [2019-11-15 20:54:33,579 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:33,579 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249846020] [2019-11-15 20:54:33,580 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:33,580 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:33,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:33,654 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-15 20:54:33,654 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249846020] [2019-11-15 20:54:33,655 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:33,655 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:54:33,655 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313936522] [2019-11-15 20:54:33,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:54:33,656 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:33,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:54:33,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:54:33,656 INFO L87 Difference]: Start difference. First operand 250 states and 368 transitions. Second operand 3 states. [2019-11-15 20:54:33,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:33,696 INFO L93 Difference]: Finished difference Result 710 states and 1059 transitions. [2019-11-15 20:54:33,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:54:33,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-15 20:54:33,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:33,699 INFO L225 Difference]: With dead ends: 710 [2019-11-15 20:54:33,699 INFO L226 Difference]: Without dead ends: 479 [2019-11-15 20:54:33,700 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-11-15 20:54:33,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-11-15 20:54:33,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2019-11-15 20:54:33,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2019-11-15 20:54:33,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 711 transitions. [2019-11-15 20:54:33,716 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 711 transitions. Word has length 106 [2019-11-15 20:54:33,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:33,717 INFO L462 AbstractCegarLoop]: Abstraction has 479 states and 711 transitions. [2019-11-15 20:54:33,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:54:33,717 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 711 transitions. [2019-11-15 20:54:33,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-15 20:54:33,719 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:33,719 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:33,719 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:33,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:33,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1707028326, now seen corresponding path program 1 times [2019-11-15 20:54:33,720 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:33,720 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256049519] [2019-11-15 20:54:33,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:33,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:33,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:33,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:33,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:34,053 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:54:34,053 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 20:54:34,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:54:34 BoogieIcfgContainer [2019-11-15 20:54:34,168 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:54:34,168 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:54:34,169 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:54:34,169 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:54:34,169 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:54:17" (3/4) ... [2019-11-15 20:54:34,172 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 20:54:34,172 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:54:34,174 INFO L168 Benchmark]: Toolchain (without parser) took 19000.72 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 366.0 MB). Free memory was 938.0 MB in the beginning and 1.3 GB in the end (delta: -360.5 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:54:34,174 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:54:34,176 INFO L168 Benchmark]: CACSL2BoogieTranslator took 697.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -177.7 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-11-15 20:54:34,177 INFO L168 Benchmark]: Boogie Procedure Inliner took 104.40 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:54:34,177 INFO L168 Benchmark]: Boogie Preprocessor took 118.49 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:54:34,178 INFO L168 Benchmark]: RCFGBuilder took 1342.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 92.3 MB). Peak memory consumption was 92.3 MB. Max. memory is 11.5 GB. [2019-11-15 20:54:34,178 INFO L168 Benchmark]: TraceAbstraction took 16729.82 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 221.8 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -285.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:54:34,179 INFO L168 Benchmark]: Witness Printer took 4.06 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:54:34,180 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 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 697.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -177.7 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 104.40 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 118.49 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1342.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 92.3 MB). Peak memory consumption was 92.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16729.82 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 221.8 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -285.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 4.06 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1702]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1121. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={-3:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 8464 [L1081] BUF_MEM *buf ; [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp ; [L1085] void (*cb)() ; [L1086] long num1 ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int got_new_session ; [L1092] int tmp___1 = __VERIFIER_nondet_int() ; [L1093] int tmp___2 = __VERIFIER_nondet_int() ; [L1094] int tmp___3 = __VERIFIER_nondet_int() ; [L1095] int tmp___4 = __VERIFIER_nondet_int() ; [L1096] int tmp___5 = __VERIFIER_nondet_int() ; [L1097] int tmp___6 = __VERIFIER_nondet_int() ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 = __VERIFIER_nondet_int() ; [L1101] int tmp___10 = __VERIFIER_nondet_int() ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [init=1, SSLv3_server_data={-3:0}] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={-3:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={-3:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={-3:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={-3:0}] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [init=1, SSLv3_server_data={-3:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1229] COND TRUE s->state == 8656 [L1550] EXPR s->session [L1550] EXPR s->s3 [L1550] EXPR (s->s3)->tmp.new_cipher [L1550] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1551] COND FALSE !(! tmp___9) [L1557] ret = __VERIFIER_nondet_int() [L1558] COND TRUE blastFlag == 2 [L1559] blastFlag = 4 VAL [init=1, SSLv3_server_data={-3:0}] [L1567] COND FALSE !(ret <= 0) [L1572] s->state = 8672 [L1573] s->init_num = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1574] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={-3:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1235] COND TRUE s->state == 8672 [L1583] ret = __VERIFIER_nondet_int() [L1584] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={-3:0}] [L1702] __VERIFIER_error() VAL [init=1, SSLv3_server_data={-3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 143 locations, 1 error locations. Result: UNSAFE, OverallTime: 16.6s, OverallIterations: 39, TraceHistogramMax: 4, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7075 SDtfs, 2083 SDslu, 9993 SDs, 0 SdLazy, 6809 SolverSat, 339 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 227 GetRequests, 84 SyntacticMatches, 33 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=479occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 38 MinimizatonAttempts, 914 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 3288 NumberOfCodeBlocks, 3288 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3125 ConstructedInterpolants, 0 QuantifiedInterpolants, 741519 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 PerfectInterpolantSequences, 1564/1564 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 could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 20:54:36,154 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:54:36,156 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:54:36,166 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:54:36,166 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:54:36,167 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:54:36,168 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:54:36,170 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:54:36,172 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:54:36,173 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:54:36,174 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:54:36,175 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:54:36,175 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:54:36,176 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:54:36,177 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:54:36,178 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:54:36,179 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:54:36,179 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:54:36,181 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:54:36,184 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:54:36,185 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:54:36,186 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:54:36,187 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:54:36,188 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:54:36,191 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:54:36,191 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:54:36,191 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:54:36,192 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:54:36,192 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:54:36,193 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:54:36,194 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:54:36,194 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:54:36,195 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:54:36,196 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:54:36,197 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:54:36,197 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:54:36,198 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:54:36,198 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:54:36,198 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:54:36,199 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:54:36,200 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:54:36,201 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3c5d3040-f5c8-46c4-bda4-d85dc3789361/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 20:54:36,215 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:54:36,215 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:54:36,216 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:54:36,216 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:54:36,217 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:54:36,217 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:54:36,217 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:54:36,217 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:54:36,218 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:54:36,218 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:54:36,218 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:54:36,218 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:54:36,219 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 20:54:36,219 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 20:54:36,219 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:54:36,219 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:54:36,219 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:54:36,220 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:54:36,220 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:54:36,220 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:54:36,220 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:54:36,221 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:54:36,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:54:36,221 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:54:36,221 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:54:36,221 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:54:36,222 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 20:54:36,222 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 20:54:36,222 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:54:36,222 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 20:54:36,223 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_3c5d3040-f5c8-46c4-bda4-d85dc3789361/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 -> a85198d3f93b8c751f2c6e712deab62f97c1022f [2019-11-15 20:54:36,251 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:54:36,261 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:54:36,264 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:54:36,266 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:54:36,266 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:54:36,267 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3c5d3040-f5c8-46c4-bda4-d85dc3789361/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c [2019-11-15 20:54:36,317 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3c5d3040-f5c8-46c4-bda4-d85dc3789361/bin/uautomizer/data/f9c7ebc95/f846d84501d348f498d1a14267392bf4/FLAGaf642ddd8 [2019-11-15 20:54:36,836 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:54:36,837 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3c5d3040-f5c8-46c4-bda4-d85dc3789361/sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c [2019-11-15 20:54:36,870 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3c5d3040-f5c8-46c4-bda4-d85dc3789361/bin/uautomizer/data/f9c7ebc95/f846d84501d348f498d1a14267392bf4/FLAGaf642ddd8 [2019-11-15 20:54:37,337 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3c5d3040-f5c8-46c4-bda4-d85dc3789361/bin/uautomizer/data/f9c7ebc95/f846d84501d348f498d1a14267392bf4 [2019-11-15 20:54:37,340 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:54:37,341 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:54:37,342 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:54:37,342 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:54:37,345 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:54:37,346 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:54:37" (1/1) ... [2019-11-15 20:54:37,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e0caeff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:37, skipping insertion in model container [2019-11-15 20:54:37,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:54:37" (1/1) ... [2019-11-15 20:54:37,355 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:54:37,403 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:54:37,927 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:54:37,948 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:54:38,089 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:54:38,118 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:54:38,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:38 WrapperNode [2019-11-15 20:54:38,119 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:54:38,120 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:54:38,120 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:54:38,120 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:54:38,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:38" (1/1) ... [2019-11-15 20:54:38,172 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:38" (1/1) ... [2019-11-15 20:54:38,235 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:54:38,242 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:54:38,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:54:38,242 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:54:38,251 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:38" (1/1) ... [2019-11-15 20:54:38,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:38" (1/1) ... [2019-11-15 20:54:38,269 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:38" (1/1) ... [2019-11-15 20:54:38,270 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:38" (1/1) ... [2019-11-15 20:54:38,308 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:38" (1/1) ... [2019-11-15 20:54:38,316 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:38" (1/1) ... [2019-11-15 20:54:38,320 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:38" (1/1) ... [2019-11-15 20:54:38,326 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:54:38,327 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:54:38,327 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:54:38,327 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:54:38,328 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c5d3040-f5c8-46c4-bda4-d85dc3789361/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:54:38,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 20:54:38,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:54:38,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 20:54:38,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 20:54:38,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 20:54:38,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:54:38,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:54:38,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 20:54:38,715 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 20:54:41,729 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-15 20:54:41,730 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-15 20:54:41,732 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:54:41,732 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 20:54:41,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:54:41 BoogieIcfgContainer [2019-11-15 20:54:41,733 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:54:41,735 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:54:41,735 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:54:41,738 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:54:41,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:54:37" (1/3) ... [2019-11-15 20:54:41,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c7d86a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:54:41, skipping insertion in model container [2019-11-15 20:54:41,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:38" (2/3) ... [2019-11-15 20:54:41,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c7d86a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:54:41, skipping insertion in model container [2019-11-15 20:54:41,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:54:41" (3/3) ... [2019-11-15 20:54:41,745 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.04.i.cil.c [2019-11-15 20:54:41,754 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:54:41,762 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 20:54:41,773 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 20:54:41,803 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:54:41,804 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:54:41,804 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:54:41,804 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:54:41,805 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:54:41,805 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:54:41,806 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:54:41,806 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:54:41,830 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-11-15 20:54:41,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 20:54:41,843 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:41,844 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:41,846 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:41,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:41,852 INFO L82 PathProgramCache]: Analyzing trace with hash 522836684, now seen corresponding path program 1 times [2019-11-15 20:54:41,864 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:54:41,864 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [331153805] [2019-11-15 20:54:41,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c5d3040-f5c8-46c4-bda4-d85dc3789361/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:54:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:42,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:54:42,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:54:42,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:54:42,169 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:54:42,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:54:42,195 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [331153805] [2019-11-15 20:54:42,196 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:42,196 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 20:54:42,196 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540173080] [2019-11-15 20:54:42,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:54:42,201 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:54:42,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:54:42,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:42,216 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2019-11-15 20:54:42,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:42,356 INFO L93 Difference]: Finished difference Result 540 states and 917 transitions. [2019-11-15 20:54:42,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:54:42,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-15 20:54:42,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:42,373 INFO L225 Difference]: With dead ends: 540 [2019-11-15 20:54:42,374 INFO L226 Difference]: Without dead ends: 366 [2019-11-15 20:54:42,377 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:42,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-11-15 20:54:42,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2019-11-15 20:54:42,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-11-15 20:54:42,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 556 transitions. [2019-11-15 20:54:42,482 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 556 transitions. Word has length 45 [2019-11-15 20:54:42,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:42,484 INFO L462 AbstractCegarLoop]: Abstraction has 366 states and 556 transitions. [2019-11-15 20:54:42,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:54:42,484 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 556 transitions. [2019-11-15 20:54:42,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-15 20:54:42,493 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:42,493 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:42,694 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:54:42,694 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:42,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:42,695 INFO L82 PathProgramCache]: Analyzing trace with hash 577204179, now seen corresponding path program 1 times [2019-11-15 20:54:42,695 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:54:42,696 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1047443970] [2019-11-15 20:54:42,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c5d3040-f5c8-46c4-bda4-d85dc3789361/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:54:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:42,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:54:42,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:54:42,997 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:54:42,998 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:54:43,039 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:54:43,040 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1047443970] [2019-11-15 20:54:43,040 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:43,040 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 20:54:43,040 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829822481] [2019-11-15 20:54:43,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:54:43,042 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:54:43,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:54:43,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:43,043 INFO L87 Difference]: Start difference. First operand 366 states and 556 transitions. Second operand 4 states. [2019-11-15 20:54:43,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:43,261 INFO L93 Difference]: Finished difference Result 839 states and 1282 transitions. [2019-11-15 20:54:43,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:54:43,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-15 20:54:43,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:43,266 INFO L225 Difference]: With dead ends: 839 [2019-11-15 20:54:43,266 INFO L226 Difference]: Without dead ends: 600 [2019-11-15 20:54:43,268 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:54:43,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-11-15 20:54:43,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-11-15 20:54:43,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-11-15 20:54:43,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 910 transitions. [2019-11-15 20:54:43,300 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 910 transitions. Word has length 103 [2019-11-15 20:54:43,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:43,301 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 910 transitions. [2019-11-15 20:54:43,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:54:43,301 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 910 transitions. [2019-11-15 20:54:43,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-15 20:54:43,307 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:43,307 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:43,514 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:54:43,514 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:43,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:43,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1707028326, now seen corresponding path program 1 times [2019-11-15 20:54:43,516 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:54:43,516 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1417222210] [2019-11-15 20:54:43,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c5d3040-f5c8-46c4-bda4-d85dc3789361/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:54:44,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:45,992 INFO L168 tionRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-15 20:54:45,994 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 20:54:46,204 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:54:46,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:54:46 BoogieIcfgContainer [2019-11-15 20:54:46,391 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:54:46,397 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:54:46,397 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:54:46,398 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:54:46,398 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:54:41" (3/4) ... [2019-11-15 20:54:46,400 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 20:54:46,515 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3c5d3040-f5c8-46c4-bda4-d85dc3789361/bin/uautomizer/witness.graphml [2019-11-15 20:54:46,515 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:54:46,517 INFO L168 Benchmark]: Toolchain (without parser) took 9175.56 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 230.7 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -200.6 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:54:46,517 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:54:46,518 INFO L168 Benchmark]: CACSL2BoogieTranslator took 777.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -171.4 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:54:46,518 INFO L168 Benchmark]: Boogie Procedure Inliner took 122.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:54:46,518 INFO L168 Benchmark]: Boogie Preprocessor took 84.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:54:46,519 INFO L168 Benchmark]: RCFGBuilder took 3406.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 93.4 MB). Peak memory consumption was 93.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:54:46,519 INFO L168 Benchmark]: TraceAbstraction took 4661.71 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 85.5 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -151.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:54:46,520 INFO L168 Benchmark]: Witness Printer took 118.19 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:54:46,521 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 777.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -171.4 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 122.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 84.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3406.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 93.4 MB). Peak memory consumption was 93.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4661.71 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 85.5 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -151.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 118.19 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1702]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 8464 [L1081] BUF_MEM *buf ; [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp ; [L1085] void (*cb)() ; [L1086] long num1 ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int got_new_session ; [L1092] int tmp___1 = __VERIFIER_nondet_int() ; [L1093] int tmp___2 = __VERIFIER_nondet_int() ; [L1094] int tmp___3 = __VERIFIER_nondet_int() ; [L1095] int tmp___4 = __VERIFIER_nondet_int() ; [L1096] int tmp___5 = __VERIFIER_nondet_int() ; [L1097] int tmp___6 = __VERIFIER_nondet_int() ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 = __VERIFIER_nondet_int() ; [L1101] int tmp___10 = __VERIFIER_nondet_int() ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1229] COND TRUE s->state == 8656 [L1550] EXPR s->session [L1550] EXPR s->s3 [L1550] EXPR (s->s3)->tmp.new_cipher [L1550] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1551] COND FALSE !(! tmp___9) [L1557] ret = __VERIFIER_nondet_int() [L1558] COND TRUE blastFlag == 2 [L1559] blastFlag = 4 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1567] COND FALSE !(ret <= 0) [L1572] s->state = 8672 [L1573] s->init_num = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1574] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1235] COND TRUE s->state == 8672 [L1583] ret = __VERIFIER_nondet_int() [L1584] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1702] __VERIFIER_error() VAL [init=1, SSLv3_server_data={-1476592689:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 143 locations, 1 error locations. Result: UNSAFE, OverallTime: 4.5s, OverallIterations: 3, TraceHistogramMax: 4, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 587 SDtfs, 659 SDslu, 792 SDs, 0 SdLazy, 51 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 292 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=600occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 273 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 292 ConstructedInterpolants, 0 QuantifiedInterpolants, 74336 SizeOfPredicates, 1 NumberOfNonLiveVariables, 397 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 116/116 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...