./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_clnt.blast.04.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_36cec98e-9c00-491c-b107-366d048a6415/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_36cec98e-9c00-491c-b107-366d048a6415/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_36cec98e-9c00-491c-b107-366d048a6415/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_36cec98e-9c00-491c-b107-366d048a6415/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.04.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_36cec98e-9c00-491c-b107-366d048a6415/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_36cec98e-9c00-491c-b107-366d048a6415/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 dbebd8f3a7ff59c46b95280959676a0cf0887b44 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_36cec98e-9c00-491c-b107-366d048a6415/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_36cec98e-9c00-491c-b107-366d048a6415/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_36cec98e-9c00-491c-b107-366d048a6415/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_36cec98e-9c00-491c-b107-366d048a6415/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.04.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_36cec98e-9c00-491c-b107-366d048a6415/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_36cec98e-9c00-491c-b107-366d048a6415/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 dbebd8f3a7ff59c46b95280959676a0cf0887b44 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.25-f470102 [2019-12-07 12:20:07,053 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:20:07,054 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:20:07,063 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:20:07,063 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:20:07,064 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:20:07,065 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:20:07,066 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:20:07,068 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:20:07,069 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:20:07,069 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:20:07,070 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:20:07,071 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:20:07,072 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:20:07,072 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:20:07,073 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:20:07,074 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:20:07,075 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:20:07,077 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:20:07,078 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:20:07,080 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:20:07,081 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:20:07,082 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:20:07,082 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:20:07,085 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:20:07,085 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:20:07,085 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:20:07,085 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:20:07,086 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:20:07,087 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:20:07,087 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:20:07,087 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:20:07,088 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:20:07,088 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:20:07,089 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:20:07,089 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:20:07,090 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:20:07,090 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:20:07,090 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:20:07,091 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:20:07,091 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:20:07,091 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_36cec98e-9c00-491c-b107-366d048a6415/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 12:20:07,101 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:20:07,101 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:20:07,102 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:20:07,102 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:20:07,102 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:20:07,102 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:20:07,102 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:20:07,102 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:20:07,103 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:20:07,103 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:20:07,103 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:20:07,103 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:20:07,103 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:20:07,103 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:20:07,103 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:20:07,103 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:20:07,103 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:20:07,104 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:20:07,104 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:20:07,104 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:20:07,104 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:20:07,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:20:07,104 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:20:07,104 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:20:07,105 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:20:07,105 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 12:20:07,105 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:20:07,105 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:20:07,105 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:20:07,105 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_36cec98e-9c00-491c-b107-366d048a6415/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 -> dbebd8f3a7ff59c46b95280959676a0cf0887b44 [2019-12-07 12:20:07,203 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:20:07,213 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:20:07,215 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:20:07,217 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:20:07,217 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:20:07,218 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_36cec98e-9c00-491c-b107-366d048a6415/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_clnt.blast.04.i.cil-1.c [2019-12-07 12:20:07,257 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_36cec98e-9c00-491c-b107-366d048a6415/bin/uautomizer/data/46d68e756/6edce90def674ca29a30234fc6a49dd1/FLAG37a492aa0 [2019-12-07 12:20:07,746 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:20:07,747 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_36cec98e-9c00-491c-b107-366d048a6415/sv-benchmarks/c/ssh/s3_clnt.blast.04.i.cil-1.c [2019-12-07 12:20:07,759 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_36cec98e-9c00-491c-b107-366d048a6415/bin/uautomizer/data/46d68e756/6edce90def674ca29a30234fc6a49dd1/FLAG37a492aa0 [2019-12-07 12:20:07,767 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_36cec98e-9c00-491c-b107-366d048a6415/bin/uautomizer/data/46d68e756/6edce90def674ca29a30234fc6a49dd1 [2019-12-07 12:20:07,769 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:20:07,770 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:20:07,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:20:07,771 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:20:07,773 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:20:07,773 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:20:07" (1/1) ... [2019-12-07 12:20:07,775 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22aa6ede and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:20:07, skipping insertion in model container [2019-12-07 12:20:07,775 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:20:07" (1/1) ... [2019-12-07 12:20:07,780 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:20:07,812 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:20:08,065 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:20:08,075 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:20:08,136 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:20:08,150 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:20:08,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:20:08 WrapperNode [2019-12-07 12:20:08,150 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:20:08,150 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:20:08,151 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:20:08,151 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:20:08,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:20:08" (1/1) ... [2019-12-07 12:20:08,173 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:20:08" (1/1) ... [2019-12-07 12:20:08,204 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:20:08,204 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:20:08,204 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:20:08,204 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:20:08,211 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:20:08" (1/1) ... [2019-12-07 12:20:08,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:20:08" (1/1) ... [2019-12-07 12:20:08,218 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:20:08" (1/1) ... [2019-12-07 12:20:08,218 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:20:08" (1/1) ... [2019-12-07 12:20:08,244 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:20:08" (1/1) ... [2019-12-07 12:20:08,249 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:20:08" (1/1) ... [2019-12-07 12:20:08,252 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:20:08" (1/1) ... [2019-12-07 12:20:08,256 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:20:08,256 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:20:08,256 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:20:08,256 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:20:08,257 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:20:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36cec98e-9c00-491c-b107-366d048a6415/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-12-07 12:20:08,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 12:20:08,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:20:08,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 12:20:08,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 12:20:08,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 12:20:08,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 12:20:08,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:20:08,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:20:08,413 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 12:20:08,894 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-12-07 12:20:08,894 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-12-07 12:20:08,895 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:20:08,895 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 12:20:08,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:20:08 BoogieIcfgContainer [2019-12-07 12:20:08,896 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:20:08,897 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:20:08,897 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:20:08,899 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:20:08,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:20:07" (1/3) ... [2019-12-07 12:20:08,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85a5c38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:20:08, skipping insertion in model container [2019-12-07 12:20:08,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:20:08" (2/3) ... [2019-12-07 12:20:08,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85a5c38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:20:08, skipping insertion in model container [2019-12-07 12:20:08,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:20:08" (3/3) ... [2019-12-07 12:20:08,901 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.04.i.cil-1.c [2019-12-07 12:20:08,907 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:20:08,911 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 12:20:08,918 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 12:20:08,934 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:20:08,934 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:20:08,934 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:20:08,934 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:20:08,934 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:20:08,934 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:20:08,935 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:20:08,935 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:20:08,947 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2019-12-07 12:20:08,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 12:20:08,951 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:20:08,952 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:20:08,952 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:20:08,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:20:08,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2019-12-07 12:20:08,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:20:08,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788433683] [2019-12-07 12:20:08,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:20:09,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:20:09,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:20:09,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788433683] [2019-12-07 12:20:09,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:20:09,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:20:09,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766482527] [2019-12-07 12:20:09,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:20:09,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:20:09,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:20:09,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:20:09,152 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 4 states. [2019-12-07 12:20:09,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:20:09,381 INFO L93 Difference]: Finished difference Result 255 states and 430 transitions. [2019-12-07 12:20:09,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:20:09,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-12-07 12:20:09,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:20:09,391 INFO L225 Difference]: With dead ends: 255 [2019-12-07 12:20:09,391 INFO L226 Difference]: Without dead ends: 116 [2019-12-07 12:20:09,394 INFO L630 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-12-07 12:20:09,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-12-07 12:20:09,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-12-07 12:20:09,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-12-07 12:20:09,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2019-12-07 12:20:09,424 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 24 [2019-12-07 12:20:09,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:20:09,425 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2019-12-07 12:20:09,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:20:09,425 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2019-12-07 12:20:09,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 12:20:09,426 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:20:09,426 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:20:09,427 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:20:09,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:20:09,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1001988123, now seen corresponding path program 1 times [2019-12-07 12:20:09,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:20:09,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460766294] [2019-12-07 12:20:09,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:20:09,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:20:09,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 12:20:09,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460766294] [2019-12-07 12:20:09,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:20:09,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:20:09,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062250584] [2019-12-07 12:20:09,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:20:09,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:20:09,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:20:09,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:20:09,523 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand 3 states. [2019-12-07 12:20:09,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:20:09,554 INFO L93 Difference]: Finished difference Result 321 states and 484 transitions. [2019-12-07 12:20:09,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:20:09,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-12-07 12:20:09,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:20:09,558 INFO L225 Difference]: With dead ends: 321 [2019-12-07 12:20:09,558 INFO L226 Difference]: Without dead ends: 216 [2019-12-07 12:20:09,559 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:20:09,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-12-07 12:20:09,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-12-07 12:20:09,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-12-07 12:20:09,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 320 transitions. [2019-12-07 12:20:09,577 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 320 transitions. Word has length 38 [2019-12-07 12:20:09,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:20:09,577 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 320 transitions. [2019-12-07 12:20:09,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:20:09,577 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 320 transitions. [2019-12-07 12:20:09,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 12:20:09,579 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:20:09,579 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 12:20:09,579 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:20:09,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:20:09,580 INFO L82 PathProgramCache]: Analyzing trace with hash -596933037, now seen corresponding path program 1 times [2019-12-07 12:20:09,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:20:09,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816266218] [2019-12-07 12:20:09,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:20:09,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:20:09,668 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 12:20:09,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816266218] [2019-12-07 12:20:09,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:20:09,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:20:09,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320764811] [2019-12-07 12:20:09,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:20:09,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:20:09,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:20:09,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:20:09,670 INFO L87 Difference]: Start difference. First operand 216 states and 320 transitions. Second operand 3 states. [2019-12-07 12:20:09,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:20:09,741 INFO L93 Difference]: Finished difference Result 421 states and 631 transitions. [2019-12-07 12:20:09,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:20:09,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-07 12:20:09,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:20:09,744 INFO L225 Difference]: With dead ends: 421 [2019-12-07 12:20:09,744 INFO L226 Difference]: Without dead ends: 316 [2019-12-07 12:20:09,745 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:20:09,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-12-07 12:20:09,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2019-12-07 12:20:09,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-12-07 12:20:09,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 467 transitions. [2019-12-07 12:20:09,758 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 467 transitions. Word has length 53 [2019-12-07 12:20:09,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:20:09,759 INFO L462 AbstractCegarLoop]: Abstraction has 316 states and 467 transitions. [2019-12-07 12:20:09,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:20:09,759 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 467 transitions. [2019-12-07 12:20:09,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 12:20:09,761 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:20:09,762 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:20:09,762 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:20:09,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:20:09,762 INFO L82 PathProgramCache]: Analyzing trace with hash -971278195, now seen corresponding path program 1 times [2019-12-07 12:20:09,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:20:09,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303682050] [2019-12-07 12:20:09,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:20:09,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:20:09,836 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 12:20:09,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303682050] [2019-12-07 12:20:09,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:20:09,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:20:09,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64635611] [2019-12-07 12:20:09,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:20:09,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:20:09,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:20:09,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:20:09,838 INFO L87 Difference]: Start difference. First operand 316 states and 467 transitions. Second operand 4 states. [2019-12-07 12:20:10,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:20:10,209 INFO L93 Difference]: Finished difference Result 808 states and 1199 transitions. [2019-12-07 12:20:10,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:20:10,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-12-07 12:20:10,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:20:10,211 INFO L225 Difference]: With dead ends: 808 [2019-12-07 12:20:10,212 INFO L226 Difference]: Without dead ends: 502 [2019-12-07 12:20:10,213 INFO L630 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-12-07 12:20:10,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-12-07 12:20:10,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 366. [2019-12-07 12:20:10,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-12-07 12:20:10,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 553 transitions. [2019-12-07 12:20:10,225 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 553 transitions. Word has length 71 [2019-12-07 12:20:10,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:20:10,225 INFO L462 AbstractCegarLoop]: Abstraction has 366 states and 553 transitions. [2019-12-07 12:20:10,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:20:10,225 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 553 transitions. [2019-12-07 12:20:10,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 12:20:10,227 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:20:10,228 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:20:10,228 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:20:10,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:20:10,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1105291701, now seen corresponding path program 1 times [2019-12-07 12:20:10,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:20:10,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939237961] [2019-12-07 12:20:10,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:20:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:20:10,284 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 12:20:10,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939237961] [2019-12-07 12:20:10,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:20:10,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:20:10,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159185783] [2019-12-07 12:20:10,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:20:10,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:20:10,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:20:10,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:20:10,285 INFO L87 Difference]: Start difference. First operand 366 states and 553 transitions. Second operand 4 states. [2019-12-07 12:20:10,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:20:10,532 INFO L93 Difference]: Finished difference Result 808 states and 1220 transitions. [2019-12-07 12:20:10,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:20:10,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-12-07 12:20:10,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:20:10,535 INFO L225 Difference]: With dead ends: 808 [2019-12-07 12:20:10,535 INFO L226 Difference]: Without dead ends: 452 [2019-12-07 12:20:10,536 INFO L630 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-12-07 12:20:10,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-12-07 12:20:10,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 406. [2019-12-07 12:20:10,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-12-07 12:20:10,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 621 transitions. [2019-12-07 12:20:10,546 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 621 transitions. Word has length 71 [2019-12-07 12:20:10,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:20:10,546 INFO L462 AbstractCegarLoop]: Abstraction has 406 states and 621 transitions. [2019-12-07 12:20:10,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:20:10,546 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 621 transitions. [2019-12-07 12:20:10,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 12:20:10,547 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:20:10,547 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:20:10,548 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:20:10,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:20:10,548 INFO L82 PathProgramCache]: Analyzing trace with hash -49538802, now seen corresponding path program 1 times [2019-12-07 12:20:10,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:20:10,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776183852] [2019-12-07 12:20:10,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:20:10,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:20:10,608 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 12:20:10,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776183852] [2019-12-07 12:20:10,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:20:10,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:20:10,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486595192] [2019-12-07 12:20:10,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:20:10,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:20:10,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:20:10,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:20:10,609 INFO L87 Difference]: Start difference. First operand 406 states and 621 transitions. Second operand 4 states. [2019-12-07 12:20:10,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:20:10,924 INFO L93 Difference]: Finished difference Result 930 states and 1411 transitions. [2019-12-07 12:20:10,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:20:10,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-12-07 12:20:10,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:20:10,927 INFO L225 Difference]: With dead ends: 930 [2019-12-07 12:20:10,927 INFO L226 Difference]: Without dead ends: 534 [2019-12-07 12:20:10,928 INFO L630 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-12-07 12:20:10,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-12-07 12:20:10,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 408. [2019-12-07 12:20:10,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-12-07 12:20:10,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 623 transitions. [2019-12-07 12:20:10,940 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 623 transitions. Word has length 72 [2019-12-07 12:20:10,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:20:10,940 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 623 transitions. [2019-12-07 12:20:10,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:20:10,941 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 623 transitions. [2019-12-07 12:20:10,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 12:20:10,942 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:20:10,942 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 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] [2019-12-07 12:20:10,942 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:20:10,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:20:10,943 INFO L82 PathProgramCache]: Analyzing trace with hash -200583067, now seen corresponding path program 2 times [2019-12-07 12:20:10,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:20:10,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894553640] [2019-12-07 12:20:10,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:20:10,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:20:11,012 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 12:20:11,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894553640] [2019-12-07 12:20:11,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:20:11,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:20:11,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120908890] [2019-12-07 12:20:11,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:20:11,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:20:11,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:20:11,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:20:11,013 INFO L87 Difference]: Start difference. First operand 408 states and 623 transitions. Second operand 4 states. [2019-12-07 12:20:11,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:20:11,359 INFO L93 Difference]: Finished difference Result 930 states and 1409 transitions. [2019-12-07 12:20:11,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:20:11,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-12-07 12:20:11,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:20:11,362 INFO L225 Difference]: With dead ends: 930 [2019-12-07 12:20:11,362 INFO L226 Difference]: Without dead ends: 532 [2019-12-07 12:20:11,363 INFO L630 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-12-07 12:20:11,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-12-07 12:20:11,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 408. [2019-12-07 12:20:11,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-12-07 12:20:11,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 621 transitions. [2019-12-07 12:20:11,372 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 621 transitions. Word has length 85 [2019-12-07 12:20:11,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:20:11,372 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 621 transitions. [2019-12-07 12:20:11,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:20:11,372 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 621 transitions. [2019-12-07 12:20:11,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 12:20:11,373 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:20:11,373 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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] [2019-12-07 12:20:11,373 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:20:11,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:20:11,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1309563513, now seen corresponding path program 1 times [2019-12-07 12:20:11,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:20:11,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067297268] [2019-12-07 12:20:11,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:20:11,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:20:11,446 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 12:20:11,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067297268] [2019-12-07 12:20:11,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:20:11,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:20:11,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687233967] [2019-12-07 12:20:11,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:20:11,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:20:11,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:20:11,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:20:11,448 INFO L87 Difference]: Start difference. First operand 408 states and 621 transitions. Second operand 4 states. [2019-12-07 12:20:11,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:20:11,758 INFO L93 Difference]: Finished difference Result 930 states and 1405 transitions. [2019-12-07 12:20:11,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:20:11,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-12-07 12:20:11,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:20:11,761 INFO L225 Difference]: With dead ends: 930 [2019-12-07 12:20:11,761 INFO L226 Difference]: Without dead ends: 532 [2019-12-07 12:20:11,762 INFO L630 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-12-07 12:20:11,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-12-07 12:20:11,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 408. [2019-12-07 12:20:11,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-12-07 12:20:11,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 619 transitions. [2019-12-07 12:20:11,770 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 619 transitions. Word has length 85 [2019-12-07 12:20:11,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:20:11,770 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 619 transitions. [2019-12-07 12:20:11,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:20:11,770 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 619 transitions. [2019-12-07 12:20:11,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 12:20:11,771 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:20:11,771 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 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] [2019-12-07 12:20:11,771 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:20:11,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:20:11,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1229942365, now seen corresponding path program 2 times [2019-12-07 12:20:11,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:20:11,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22882609] [2019-12-07 12:20:11,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:20:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:20:11,812 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 12:20:11,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22882609] [2019-12-07 12:20:11,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:20:11,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:20:11,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337555404] [2019-12-07 12:20:11,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:20:11,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:20:11,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:20:11,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:20:11,813 INFO L87 Difference]: Start difference. First operand 408 states and 619 transitions. Second operand 4 states. [2019-12-07 12:20:12,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:20:12,024 INFO L93 Difference]: Finished difference Result 850 states and 1280 transitions. [2019-12-07 12:20:12,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:20:12,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-12-07 12:20:12,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:20:12,028 INFO L225 Difference]: With dead ends: 850 [2019-12-07 12:20:12,028 INFO L226 Difference]: Without dead ends: 452 [2019-12-07 12:20:12,029 INFO L630 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-12-07 12:20:12,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-12-07 12:20:12,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 408. [2019-12-07 12:20:12,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-12-07 12:20:12,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 617 transitions. [2019-12-07 12:20:12,040 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 617 transitions. Word has length 85 [2019-12-07 12:20:12,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:20:12,040 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 617 transitions. [2019-12-07 12:20:12,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:20:12,040 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 617 transitions. [2019-12-07 12:20:12,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 12:20:12,041 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:20:12,042 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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] [2019-12-07 12:20:12,042 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:20:12,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:20:12,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1956044485, now seen corresponding path program 1 times [2019-12-07 12:20:12,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:20:12,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991273023] [2019-12-07 12:20:12,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:20:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:20:12,095 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 12:20:12,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991273023] [2019-12-07 12:20:12,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:20:12,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:20:12,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569507202] [2019-12-07 12:20:12,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:20:12,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:20:12,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:20:12,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:20:12,097 INFO L87 Difference]: Start difference. First operand 408 states and 617 transitions. Second operand 4 states. [2019-12-07 12:20:12,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:20:12,357 INFO L93 Difference]: Finished difference Result 850 states and 1276 transitions. [2019-12-07 12:20:12,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:20:12,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-12-07 12:20:12,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:20:12,360 INFO L225 Difference]: With dead ends: 850 [2019-12-07 12:20:12,360 INFO L226 Difference]: Without dead ends: 452 [2019-12-07 12:20:12,361 INFO L630 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-12-07 12:20:12,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-12-07 12:20:12,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 408. [2019-12-07 12:20:12,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-12-07 12:20:12,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 615 transitions. [2019-12-07 12:20:12,372 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 615 transitions. Word has length 85 [2019-12-07 12:20:12,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:20:12,372 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 615 transitions. [2019-12-07 12:20:12,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:20:12,372 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 615 transitions. [2019-12-07 12:20:12,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 12:20:12,373 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:20:12,374 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 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] [2019-12-07 12:20:12,374 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:20:12,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:20:12,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1887370232, now seen corresponding path program 1 times [2019-12-07 12:20:12,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:20:12,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466804053] [2019-12-07 12:20:12,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:20:12,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:20:12,416 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 12:20:12,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466804053] [2019-12-07 12:20:12,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:20:12,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:20:12,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135835956] [2019-12-07 12:20:12,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:20:12,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:20:12,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:20:12,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:20:12,417 INFO L87 Difference]: Start difference. First operand 408 states and 615 transitions. Second operand 4 states. [2019-12-07 12:20:12,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:20:12,775 INFO L93 Difference]: Finished difference Result 930 states and 1393 transitions. [2019-12-07 12:20:12,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:20:12,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-12-07 12:20:12,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:20:12,778 INFO L225 Difference]: With dead ends: 930 [2019-12-07 12:20:12,778 INFO L226 Difference]: Without dead ends: 532 [2019-12-07 12:20:12,779 INFO L630 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-12-07 12:20:12,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-12-07 12:20:12,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 408. [2019-12-07 12:20:12,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-12-07 12:20:12,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 613 transitions. [2019-12-07 12:20:12,787 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 613 transitions. Word has length 86 [2019-12-07 12:20:12,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:20:12,787 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 613 transitions. [2019-12-07 12:20:12,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:20:12,787 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 613 transitions. [2019-12-07 12:20:12,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 12:20:12,788 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:20:12,788 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:20:12,788 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:20:12,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:20:12,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1587309149, now seen corresponding path program 1 times [2019-12-07 12:20:12,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:20:12,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732934784] [2019-12-07 12:20:12,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:20:12,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:20:12,835 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 12:20:12,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732934784] [2019-12-07 12:20:12,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:20:12,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:20:12,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271638194] [2019-12-07 12:20:12,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:20:12,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:20:12,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:20:12,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:20:12,836 INFO L87 Difference]: Start difference. First operand 408 states and 613 transitions. Second operand 4 states. [2019-12-07 12:20:13,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:20:13,203 INFO L93 Difference]: Finished difference Result 785 states and 1170 transitions. [2019-12-07 12:20:13,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:20:13,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-12-07 12:20:13,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:20:13,205 INFO L225 Difference]: With dead ends: 785 [2019-12-07 12:20:13,205 INFO L226 Difference]: Without dead ends: 532 [2019-12-07 12:20:13,206 INFO L630 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-12-07 12:20:13,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-12-07 12:20:13,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 408. [2019-12-07 12:20:13,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-12-07 12:20:13,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 611 transitions. [2019-12-07 12:20:13,223 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 611 transitions. Word has length 86 [2019-12-07 12:20:13,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:20:13,224 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 611 transitions. [2019-12-07 12:20:13,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:20:13,224 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 611 transitions. [2019-12-07 12:20:13,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 12:20:13,225 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:20:13,225 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 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] [2019-12-07 12:20:13,225 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:20:13,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:20:13,225 INFO L82 PathProgramCache]: Analyzing trace with hash 562229898, now seen corresponding path program 1 times [2019-12-07 12:20:13,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:20:13,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714620012] [2019-12-07 12:20:13,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:20:13,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:20:13,266 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 12:20:13,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714620012] [2019-12-07 12:20:13,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:20:13,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:20:13,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967211130] [2019-12-07 12:20:13,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:20:13,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:20:13,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:20:13,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:20:13,267 INFO L87 Difference]: Start difference. First operand 408 states and 611 transitions. Second operand 4 states. [2019-12-07 12:20:13,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:20:13,534 INFO L93 Difference]: Finished difference Result 850 states and 1264 transitions. [2019-12-07 12:20:13,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:20:13,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-12-07 12:20:13,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:20:13,537 INFO L225 Difference]: With dead ends: 850 [2019-12-07 12:20:13,537 INFO L226 Difference]: Without dead ends: 452 [2019-12-07 12:20:13,537 INFO L630 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-12-07 12:20:13,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-12-07 12:20:13,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 408. [2019-12-07 12:20:13,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-12-07 12:20:13,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 609 transitions. [2019-12-07 12:20:13,544 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 609 transitions. Word has length 86 [2019-12-07 12:20:13,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:20:13,544 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 609 transitions. [2019-12-07 12:20:13,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:20:13,544 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 609 transitions. [2019-12-07 12:20:13,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 12:20:13,545 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:20:13,545 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:20:13,546 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:20:13,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:20:13,546 INFO L82 PathProgramCache]: Analyzing trace with hash 862290981, now seen corresponding path program 1 times [2019-12-07 12:20:13,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:20:13,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739012998] [2019-12-07 12:20:13,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:20:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:20:13,584 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 12:20:13,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739012998] [2019-12-07 12:20:13,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:20:13,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:20:13,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512116569] [2019-12-07 12:20:13,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:20:13,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:20:13,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:20:13,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:20:13,585 INFO L87 Difference]: Start difference. First operand 408 states and 609 transitions. Second operand 4 states. [2019-12-07 12:20:13,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:20:13,822 INFO L93 Difference]: Finished difference Result 705 states and 1043 transitions. [2019-12-07 12:20:13,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:20:13,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-12-07 12:20:13,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:20:13,825 INFO L225 Difference]: With dead ends: 705 [2019-12-07 12:20:13,825 INFO L226 Difference]: Without dead ends: 452 [2019-12-07 12:20:13,825 INFO L630 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-12-07 12:20:13,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-12-07 12:20:13,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 408. [2019-12-07 12:20:13,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-12-07 12:20:13,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 607 transitions. [2019-12-07 12:20:13,834 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 607 transitions. Word has length 86 [2019-12-07 12:20:13,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:20:13,834 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 607 transitions. [2019-12-07 12:20:13,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:20:13,834 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 607 transitions. [2019-12-07 12:20:13,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 12:20:13,836 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:20:13,836 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 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] [2019-12-07 12:20:13,836 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:20:13,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:20:13,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1732038594, now seen corresponding path program 1 times [2019-12-07 12:20:13,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:20:13,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31770542] [2019-12-07 12:20:13,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:20:13,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:20:13,879 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 12:20:13,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31770542] [2019-12-07 12:20:13,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:20:13,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:20:13,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84567670] [2019-12-07 12:20:13,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:20:13,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:20:13,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:20:13,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:20:13,880 INFO L87 Difference]: Start difference. First operand 408 states and 607 transitions. Second operand 4 states. [2019-12-07 12:20:14,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:20:14,194 INFO L93 Difference]: Finished difference Result 930 states and 1377 transitions. [2019-12-07 12:20:14,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:20:14,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-12-07 12:20:14,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:20:14,197 INFO L225 Difference]: With dead ends: 930 [2019-12-07 12:20:14,197 INFO L226 Difference]: Without dead ends: 532 [2019-12-07 12:20:14,198 INFO L630 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-12-07 12:20:14,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-12-07 12:20:14,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 408. [2019-12-07 12:20:14,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-12-07 12:20:14,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 605 transitions. [2019-12-07 12:20:14,205 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 605 transitions. Word has length 87 [2019-12-07 12:20:14,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:20:14,205 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 605 transitions. [2019-12-07 12:20:14,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:20:14,205 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 605 transitions. [2019-12-07 12:20:14,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 12:20:14,206 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:20:14,206 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-12-07 12:20:14,206 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:20:14,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:20:14,206 INFO L82 PathProgramCache]: Analyzing trace with hash 442060930, now seen corresponding path program 1 times [2019-12-07 12:20:14,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:20:14,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643477660] [2019-12-07 12:20:14,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:20:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:20:14,244 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 12:20:14,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643477660] [2019-12-07 12:20:14,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:20:14,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:20:14,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296047205] [2019-12-07 12:20:14,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:20:14,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:20:14,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:20:14,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:20:14,246 INFO L87 Difference]: Start difference. First operand 408 states and 605 transitions. Second operand 4 states. [2019-12-07 12:20:14,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:20:14,590 INFO L93 Difference]: Finished difference Result 779 states and 1151 transitions. [2019-12-07 12:20:14,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:20:14,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-12-07 12:20:14,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:20:14,592 INFO L225 Difference]: With dead ends: 779 [2019-12-07 12:20:14,592 INFO L226 Difference]: Without dead ends: 526 [2019-12-07 12:20:14,593 INFO L630 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-12-07 12:20:14,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-12-07 12:20:14,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 408. [2019-12-07 12:20:14,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-12-07 12:20:14,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 603 transitions. [2019-12-07 12:20:14,599 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 603 transitions. Word has length 87 [2019-12-07 12:20:14,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:20:14,599 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 603 transitions. [2019-12-07 12:20:14,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:20:14,599 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 603 transitions. [2019-12-07 12:20:14,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 12:20:14,600 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:20:14,600 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 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] [2019-12-07 12:20:14,600 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:20:14,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:20:14,600 INFO L82 PathProgramCache]: Analyzing trace with hash 360231296, now seen corresponding path program 1 times [2019-12-07 12:20:14,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:20:14,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866327637] [2019-12-07 12:20:14,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:20:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:20:14,636 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 12:20:14,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866327637] [2019-12-07 12:20:14,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:20:14,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:20:14,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528649412] [2019-12-07 12:20:14,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:20:14,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:20:14,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:20:14,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:20:14,637 INFO L87 Difference]: Start difference. First operand 408 states and 603 transitions. Second operand 4 states. [2019-12-07 12:20:14,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:20:14,876 INFO L93 Difference]: Finished difference Result 850 states and 1248 transitions. [2019-12-07 12:20:14,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:20:14,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-12-07 12:20:14,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:20:14,879 INFO L225 Difference]: With dead ends: 850 [2019-12-07 12:20:14,879 INFO L226 Difference]: Without dead ends: 452 [2019-12-07 12:20:14,879 INFO L630 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-12-07 12:20:14,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-12-07 12:20:14,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 408. [2019-12-07 12:20:14,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-12-07 12:20:14,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 601 transitions. [2019-12-07 12:20:14,888 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 601 transitions. Word has length 87 [2019-12-07 12:20:14,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:20:14,888 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 601 transitions. [2019-12-07 12:20:14,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:20:14,889 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 601 transitions. [2019-12-07 12:20:14,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 12:20:14,890 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:20:14,890 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-12-07 12:20:14,890 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:20:14,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:20:14,890 INFO L82 PathProgramCache]: Analyzing trace with hash -929746368, now seen corresponding path program 1 times [2019-12-07 12:20:14,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:20:14,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053953314] [2019-12-07 12:20:14,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:20:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:20:14,938 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 12:20:14,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053953314] [2019-12-07 12:20:14,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:20:14,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:20:14,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352878986] [2019-12-07 12:20:14,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:20:14,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:20:14,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:20:14,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:20:14,939 INFO L87 Difference]: Start difference. First operand 408 states and 601 transitions. Second operand 4 states. [2019-12-07 12:20:15,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:20:15,144 INFO L93 Difference]: Finished difference Result 699 states and 1024 transitions. [2019-12-07 12:20:15,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:20:15,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-12-07 12:20:15,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:20:15,146 INFO L225 Difference]: With dead ends: 699 [2019-12-07 12:20:15,146 INFO L226 Difference]: Without dead ends: 446 [2019-12-07 12:20:15,147 INFO L630 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-12-07 12:20:15,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-12-07 12:20:15,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 408. [2019-12-07 12:20:15,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-12-07 12:20:15,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 599 transitions. [2019-12-07 12:20:15,156 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 599 transitions. Word has length 87 [2019-12-07 12:20:15,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:20:15,156 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 599 transitions. [2019-12-07 12:20:15,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:20:15,156 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 599 transitions. [2019-12-07 12:20:15,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 12:20:15,157 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:20:15,157 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2019-12-07 12:20:15,158 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:20:15,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:20:15,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1973824157, now seen corresponding path program 1 times [2019-12-07 12:20:15,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:20:15,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776318357] [2019-12-07 12:20:15,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:20:15,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:20:15,204 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 12:20:15,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776318357] [2019-12-07 12:20:15,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:20:15,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:20:15,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50657180] [2019-12-07 12:20:15,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:20:15,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:20:15,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:20:15,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:20:15,205 INFO L87 Difference]: Start difference. First operand 408 states and 599 transitions. Second operand 4 states. [2019-12-07 12:20:15,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:20:15,483 INFO L93 Difference]: Finished difference Result 906 states and 1332 transitions. [2019-12-07 12:20:15,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:20:15,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-12-07 12:20:15,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:20:15,486 INFO L225 Difference]: With dead ends: 906 [2019-12-07 12:20:15,486 INFO L226 Difference]: Without dead ends: 508 [2019-12-07 12:20:15,486 INFO L630 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-12-07 12:20:15,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2019-12-07 12:20:15,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 408. [2019-12-07 12:20:15,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-12-07 12:20:15,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 597 transitions. [2019-12-07 12:20:15,492 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 597 transitions. Word has length 88 [2019-12-07 12:20:15,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:20:15,492 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 597 transitions. [2019-12-07 12:20:15,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:20:15,493 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 597 transitions. [2019-12-07 12:20:15,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 12:20:15,493 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:20:15,493 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2019-12-07 12:20:15,493 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:20:15,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:20:15,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1550177435, now seen corresponding path program 1 times [2019-12-07 12:20:15,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:20:15,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405392329] [2019-12-07 12:20:15,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:20:15,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:20:15,529 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 12:20:15,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405392329] [2019-12-07 12:20:15,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:20:15,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:20:15,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892114966] [2019-12-07 12:20:15,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:20:15,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:20:15,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:20:15,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:20:15,530 INFO L87 Difference]: Start difference. First operand 408 states and 597 transitions. Second operand 4 states. [2019-12-07 12:20:15,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:20:15,728 INFO L93 Difference]: Finished difference Result 826 states and 1207 transitions. [2019-12-07 12:20:15,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:20:15,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-12-07 12:20:15,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:20:15,730 INFO L225 Difference]: With dead ends: 826 [2019-12-07 12:20:15,730 INFO L226 Difference]: Without dead ends: 428 [2019-12-07 12:20:15,730 INFO L630 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-12-07 12:20:15,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-12-07 12:20:15,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 408. [2019-12-07 12:20:15,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-12-07 12:20:15,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 595 transitions. [2019-12-07 12:20:15,737 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 595 transitions. Word has length 88 [2019-12-07 12:20:15,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:20:15,737 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 595 transitions. [2019-12-07 12:20:15,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:20:15,737 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 595 transitions. [2019-12-07 12:20:15,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-07 12:20:15,737 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:20:15,738 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:20:15,738 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:20:15,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:20:15,738 INFO L82 PathProgramCache]: Analyzing trace with hash 114296894, now seen corresponding path program 1 times [2019-12-07 12:20:15,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:20:15,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322466610] [2019-12-07 12:20:15,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:20:15,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:20:15,788 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 12:20:15,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322466610] [2019-12-07 12:20:15,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:20:15,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:20:15,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105390717] [2019-12-07 12:20:15,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:20:15,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:20:15,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:20:15,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:20:15,790 INFO L87 Difference]: Start difference. First operand 408 states and 595 transitions. Second operand 4 states. [2019-12-07 12:20:16,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:20:16,054 INFO L93 Difference]: Finished difference Result 906 states and 1324 transitions. [2019-12-07 12:20:16,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:20:16,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-12-07 12:20:16,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:20:16,058 INFO L225 Difference]: With dead ends: 906 [2019-12-07 12:20:16,058 INFO L226 Difference]: Without dead ends: 508 [2019-12-07 12:20:16,058 INFO L630 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-12-07 12:20:16,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2019-12-07 12:20:16,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 408. [2019-12-07 12:20:16,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-12-07 12:20:16,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 593 transitions. [2019-12-07 12:20:16,067 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 593 transitions. Word has length 89 [2019-12-07 12:20:16,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:20:16,067 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 593 transitions. [2019-12-07 12:20:16,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:20:16,068 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 593 transitions. [2019-12-07 12:20:16,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-07 12:20:16,069 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:20:16,069 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:20:16,069 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:20:16,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:20:16,069 INFO L82 PathProgramCache]: Analyzing trace with hash 362443388, now seen corresponding path program 1 times [2019-12-07 12:20:16,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:20:16,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563319780] [2019-12-07 12:20:16,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:20:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:20:16,123 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 12:20:16,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563319780] [2019-12-07 12:20:16,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:20:16,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:20:16,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661257612] [2019-12-07 12:20:16,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:20:16,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:20:16,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:20:16,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:20:16,124 INFO L87 Difference]: Start difference. First operand 408 states and 593 transitions. Second operand 3 states. [2019-12-07 12:20:16,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:20:16,148 INFO L93 Difference]: Finished difference Result 808 states and 1181 transitions. [2019-12-07 12:20:16,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:20:16,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-12-07 12:20:16,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:20:16,151 INFO L225 Difference]: With dead ends: 808 [2019-12-07 12:20:16,151 INFO L226 Difference]: Without dead ends: 557 [2019-12-07 12:20:16,152 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:20:16,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-12-07 12:20:16,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2019-12-07 12:20:16,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2019-12-07 12:20:16,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 810 transitions. [2019-12-07 12:20:16,162 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 810 transitions. Word has length 89 [2019-12-07 12:20:16,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:20:16,162 INFO L462 AbstractCegarLoop]: Abstraction has 557 states and 810 transitions. [2019-12-07 12:20:16,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:20:16,163 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 810 transitions. [2019-12-07 12:20:16,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-12-07 12:20:16,164 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:20:16,164 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:20:16,164 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:20:16,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:20:16,164 INFO L82 PathProgramCache]: Analyzing trace with hash 846505389, now seen corresponding path program 1 times [2019-12-07 12:20:16,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:20:16,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123472980] [2019-12-07 12:20:16,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:20:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:20:16,205 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-12-07 12:20:16,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123472980] [2019-12-07 12:20:16,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:20:16,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:20:16,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393714430] [2019-12-07 12:20:16,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:20:16,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:20:16,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:20:16,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:20:16,206 INFO L87 Difference]: Start difference. First operand 557 states and 810 transitions. Second operand 3 states. [2019-12-07 12:20:16,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:20:16,235 INFO L93 Difference]: Finished difference Result 1106 states and 1615 transitions. [2019-12-07 12:20:16,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:20:16,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-12-07 12:20:16,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:20:16,238 INFO L225 Difference]: With dead ends: 1106 [2019-12-07 12:20:16,238 INFO L226 Difference]: Without dead ends: 706 [2019-12-07 12:20:16,238 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:20:16,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2019-12-07 12:20:16,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 706. [2019-12-07 12:20:16,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-12-07 12:20:16,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1028 transitions. [2019-12-07 12:20:16,251 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 1028 transitions. Word has length 91 [2019-12-07 12:20:16,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:20:16,251 INFO L462 AbstractCegarLoop]: Abstraction has 706 states and 1028 transitions. [2019-12-07 12:20:16,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:20:16,251 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 1028 transitions. [2019-12-07 12:20:16,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-07 12:20:16,253 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:20:16,253 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:20:16,253 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:20:16,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:20:16,253 INFO L82 PathProgramCache]: Analyzing trace with hash 797599730, now seen corresponding path program 1 times [2019-12-07 12:20:16,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:20:16,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106396895] [2019-12-07 12:20:16,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:20:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:20:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:20:16,565 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 12:20:16,565 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:20:16,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:20:16 BoogieIcfgContainer [2019-12-07 12:20:16,651 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:20:16,651 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:20:16,651 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:20:16,651 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:20:16,652 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:20:08" (3/4) ... [2019-12-07 12:20:16,655 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 12:20:16,655 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:20:16,657 INFO L168 Benchmark]: Toolchain (without parser) took 8886.30 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 224.9 MB). Free memory was 938.1 MB in the beginning and 1.2 GB in the end (delta: -244.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:20:16,657 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:20:16,657 INFO L168 Benchmark]: CACSL2BoogieTranslator took 379.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -139.7 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:20:16,657 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.62 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:20:16,658 INFO L168 Benchmark]: Boogie Preprocessor took 51.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2019-12-07 12:20:16,658 INFO L168 Benchmark]: RCFGBuilder took 639.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 973.3 MB in the end (delta: 87.4 MB). Peak memory consumption was 87.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:20:16,658 INFO L168 Benchmark]: TraceAbstraction took 7754.36 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 125.3 MB). Free memory was 973.3 MB in the beginning and 1.2 GB in the end (delta: -208.9 MB). Peak memory consumption was 297.8 MB. Max. memory is 11.5 GB. [2019-12-07 12:20:16,658 INFO L168 Benchmark]: Witness Printer took 4.04 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:20:16,660 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 379.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -139.7 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.62 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 639.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 973.3 MB in the end (delta: 87.4 MB). Peak memory consumption was 87.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7754.36 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 125.3 MB). Free memory was 973.3 MB in the beginning and 1.2 GB in the end (delta: -208.9 MB). Peak memory consumption was 297.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.04 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1641]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1332. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={9:0}] [L1065] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1069] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1070] s->ctx = malloc(sizeof(SSL_CTX)) [L1071] s->session = malloc(sizeof(SSL_SESSION)) [L1072] s->state = 12292 [L1073] s->version = __VERIFIER_nondet_int() [L1080] BUF_MEM *buf ; [L1081] unsigned long tmp ; [L1082] unsigned long l ; [L1083] long num1 ; [L1084] void (*cb)() ; [L1085] int ret ; [L1086] int new_state ; [L1087] int state ; [L1088] int skip ; [L1089] int tmp___1 = __VERIFIER_nondet_int() ; [L1090] int tmp___2 = __VERIFIER_nondet_int() ; [L1091] int tmp___3 = __VERIFIER_nondet_int() ; [L1092] int tmp___4 = __VERIFIER_nondet_int() ; [L1093] int tmp___5 = __VERIFIER_nondet_int() ; [L1094] int tmp___6 = __VERIFIER_nondet_int() ; [L1095] int tmp___7 = __VERIFIER_nondet_int() ; [L1096] int tmp___8 = __VERIFIER_nondet_int() ; [L1097] long tmp___9 = __VERIFIER_nondet_long() ; [L1098] int blastFlag ; [L1101] blastFlag = 0 [L1102] s->hit=__VERIFIER_nondet_int () [L1103] s->state = 12292 [L1104] tmp = __VERIFIER_nondet_int() [L1105] cb = (void (*)())((void *)0) [L1106] ret = -1 [L1107] skip = 0 [L1108] EXPR s->info_callback VAL [init=1, SSLv3_client_data={9:0}] [L1108] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1109] EXPR s->info_callback [L1109] cb = s->info_callback [L1117] EXPR s->in_handshake [L1117] s->in_handshake += 1 [L1118] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_client_data={9:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1131] COND TRUE s->state == 12292 [L1234] s->new_session = 1 [L1235] s->state = 4096 [L1236] EXPR s->ctx [L1236] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1236] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1241] s->server = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1242] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={9:0}] [L1247] EXPR s->version VAL [init=1, SSLv3_client_data={9:0}] [L1247] COND FALSE !((s->version & 65280) != 768) [L1253] s->type = 4096 [L1254] EXPR s->init_buf VAL [init=1, SSLv3_client_data={9:0}] [L1254] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1272] COND FALSE !(! tmp___4) VAL [init=1, SSLv3_client_data={9:0}] [L1278] COND FALSE !(! tmp___5) [L1284] s->state = 4368 [L1285] EXPR s->ctx [L1285] EXPR (s->ctx)->stats.sess_connect [L1285] (s->ctx)->stats.sess_connect += 1 [L1286] s->init_num = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1146] COND TRUE s->state == 4368 [L1290] s->shutdown = 0 [L1291] ret = __VERIFIER_nondet_int() [L1292] COND TRUE blastFlag == 0 [L1293] blastFlag = 1 VAL [init=1, SSLv3_client_data={9:0}] [L1297] COND FALSE !(ret <= 0) [L1302] s->state = 4384 [L1303] s->init_num = 0 [L1304] EXPR s->bbio [L1304] EXPR s->wbio VAL [init=1, SSLv3_client_data={9:0}] [L1304] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1152] COND TRUE s->state == 4384 [L1312] ret = __VERIFIER_nondet_int() [L1313] COND TRUE blastFlag == 1 [L1314] blastFlag = 2 VAL [init=1, SSLv3_client_data={9:0}] [L1318] COND FALSE !(ret <= 0) [L1323] s->hit VAL [init=1, SSLv3_client_data={9:0}] [L1323] COND FALSE !(s->hit) [L1326] s->state = 4400 VAL [init=1, SSLv3_client_data={9:0}] [L1328] s->init_num = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1152] COND FALSE !(s->state == 4384) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1155] COND FALSE !(s->state == 4385) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1158] COND TRUE s->state == 4400 [L1332] EXPR s->s3 [L1332] EXPR (s->s3)->tmp.new_cipher [L1332] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_client_data={9:0}] [L1332] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1335] ret = __VERIFIER_nondet_int() [L1336] COND TRUE blastFlag == 2 [L1337] blastFlag = 3 VAL [init=1, SSLv3_client_data={9:0}] [L1345] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={9:0}] [L1351] s->state = 4416 [L1352] s->init_num = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1152] COND FALSE !(s->state == 4384) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1155] COND FALSE !(s->state == 4385) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1158] COND FALSE !(s->state == 4400) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1161] COND FALSE !(s->state == 4401) [L1164] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1164] COND TRUE s->state == 4416 [L1356] ret = __VERIFIER_nondet_int() [L1357] COND TRUE blastFlag == 3 [L1358] blastFlag = 4 VAL [init=1, SSLv3_client_data={9:0}] [L1362] COND FALSE !(ret <= 0) [L1367] s->state = 4432 [L1368] s->init_num = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1369] COND FALSE !(! tmp___6) VAL [init=1, SSLv3_client_data={9:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1152] COND FALSE !(s->state == 4384) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1155] COND FALSE !(s->state == 4385) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1158] COND FALSE !(s->state == 4400) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1161] COND FALSE !(s->state == 4401) [L1164] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1164] COND FALSE !(s->state == 4416) [L1167] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1167] COND FALSE !(s->state == 4417) [L1170] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1170] COND TRUE s->state == 4432 [L1378] ret = __VERIFIER_nondet_int() [L1379] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_client_data={9:0}] [L1641] __VERIFIER_error() VAL [init=1, SSLv3_client_data={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 129 locations, 1 error locations. Result: UNSAFE, OverallTime: 7.6s, OverallIterations: 24, TraceHistogramMax: 6, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4904 SDtfs, 1791 SDslu, 6306 SDs, 0 SdLazy, 3606 SolverSat, 136 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 46 SyntacticMatches, 19 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=706occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 1525 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1918 NumberOfCodeBlocks, 1918 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1783 ConstructedInterpolants, 0 QuantifiedInterpolants, 373356 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 1532/1532 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.25-f470102 [2019-12-07 12:20:18,017 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:20:18,019 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:20:18,027 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:20:18,027 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:20:18,027 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:20:18,028 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:20:18,030 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:20:18,031 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:20:18,032 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:20:18,032 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:20:18,033 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:20:18,033 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:20:18,034 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:20:18,035 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:20:18,035 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:20:18,036 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:20:18,036 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:20:18,038 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:20:18,040 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:20:18,041 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:20:18,042 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:20:18,042 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:20:18,043 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:20:18,045 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:20:18,045 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:20:18,045 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:20:18,046 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:20:18,046 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:20:18,047 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:20:18,047 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:20:18,047 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:20:18,048 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:20:18,048 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:20:18,049 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:20:18,049 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:20:18,050 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:20:18,050 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:20:18,050 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:20:18,050 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:20:18,051 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:20:18,051 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_36cec98e-9c00-491c-b107-366d048a6415/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-12-07 12:20:18,062 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:20:18,062 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:20:18,063 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:20:18,063 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:20:18,063 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:20:18,063 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:20:18,063 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:20:18,063 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:20:18,063 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:20:18,064 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:20:18,064 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:20:18,064 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:20:18,064 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 12:20:18,064 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 12:20:18,064 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:20:18,064 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:20:18,064 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:20:18,065 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:20:18,065 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:20:18,065 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:20:18,065 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:20:18,065 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:20:18,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:20:18,065 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:20:18,065 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:20:18,066 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:20:18,066 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 12:20:18,066 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 12:20:18,066 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:20:18,066 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:20:18,066 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 12:20:18,066 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_36cec98e-9c00-491c-b107-366d048a6415/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 -> dbebd8f3a7ff59c46b95280959676a0cf0887b44 [2019-12-07 12:20:18,238 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:20:18,245 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:20:18,248 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:20:18,249 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:20:18,249 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:20:18,249 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_36cec98e-9c00-491c-b107-366d048a6415/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_clnt.blast.04.i.cil-1.c [2019-12-07 12:20:18,286 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_36cec98e-9c00-491c-b107-366d048a6415/bin/uautomizer/data/a3c0d7021/89391177023e4588be08404c12a3e363/FLAGd785e5d7d [2019-12-07 12:20:18,776 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:20:18,776 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_36cec98e-9c00-491c-b107-366d048a6415/sv-benchmarks/c/ssh/s3_clnt.blast.04.i.cil-1.c [2019-12-07 12:20:18,788 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_36cec98e-9c00-491c-b107-366d048a6415/bin/uautomizer/data/a3c0d7021/89391177023e4588be08404c12a3e363/FLAGd785e5d7d [2019-12-07 12:20:18,797 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_36cec98e-9c00-491c-b107-366d048a6415/bin/uautomizer/data/a3c0d7021/89391177023e4588be08404c12a3e363 [2019-12-07 12:20:18,799 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:20:18,800 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:20:18,800 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:20:18,800 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:20:18,803 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:20:18,803 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:20:18" (1/1) ... [2019-12-07 12:20:18,805 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d795c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:20:18, skipping insertion in model container [2019-12-07 12:20:18,805 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:20:18" (1/1) ... [2019-12-07 12:20:18,810 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:20:18,844 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:20:19,111 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:20:19,123 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:20:19,203 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:20:19,222 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:20:19,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:20:19 WrapperNode [2019-12-07 12:20:19,223 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:20:19,223 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:20:19,223 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:20:19,223 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:20:19,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:20:19" (1/1) ... [2019-12-07 12:20:19,254 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:20:19" (1/1) ... [2019-12-07 12:20:19,289 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:20:19,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:20:19,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:20:19,289 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:20:19,296 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:20:19" (1/1) ... [2019-12-07 12:20:19,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:20:19" (1/1) ... [2019-12-07 12:20:19,303 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:20:19" (1/1) ... [2019-12-07 12:20:19,303 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:20:19" (1/1) ... [2019-12-07 12:20:19,333 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:20:19" (1/1) ... [2019-12-07 12:20:19,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:20:19" (1/1) ... [2019-12-07 12:20:19,342 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:20:19" (1/1) ... [2019-12-07 12:20:19,348 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:20:19,348 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:20:19,348 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:20:19,348 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:20:19,349 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:20:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36cec98e-9c00-491c-b107-366d048a6415/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-12-07 12:20:19,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 12:20:19,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:20:19,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 12:20:19,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 12:20:19,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 12:20:19,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:20:19,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:20:19,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 12:20:19,549 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 12:20:21,534 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-12-07 12:20:21,534 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-12-07 12:20:21,535 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:20:21,535 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 12:20:21,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:20:21 BoogieIcfgContainer [2019-12-07 12:20:21,536 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:20:21,537 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:20:21,537 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:20:21,539 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:20:21,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:20:18" (1/3) ... [2019-12-07 12:20:21,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d1c502e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:20:21, skipping insertion in model container [2019-12-07 12:20:21,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:20:19" (2/3) ... [2019-12-07 12:20:21,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d1c502e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:20:21, skipping insertion in model container [2019-12-07 12:20:21,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:20:21" (3/3) ... [2019-12-07 12:20:21,541 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.04.i.cil-1.c [2019-12-07 12:20:21,547 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:20:21,552 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 12:20:21,559 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 12:20:21,575 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:20:21,575 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:20:21,576 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:20:21,576 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:20:21,576 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:20:21,576 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:20:21,576 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:20:21,576 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:20:21,588 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2019-12-07 12:20:21,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 12:20:21,593 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:20:21,594 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:20:21,594 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:20:21,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:20:21,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2019-12-07 12:20:21,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:20:21,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1302837468] [2019-12-07 12:20:21,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36cec98e-9c00-491c-b107-366d048a6415/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 12:20:21,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:20:21,719 INFO L264 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 12:20:21,723 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:20:21,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:20:21,749 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:20:21,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:20:21,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1302837468] [2019-12-07 12:20:21,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:20:21,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 12:20:21,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404917431] [2019-12-07 12:20:21,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:20:21,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:20:21,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:20:21,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:20:21,776 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 4 states. [2019-12-07 12:20:21,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:20:21,873 INFO L93 Difference]: Finished difference Result 487 states and 823 transitions. [2019-12-07 12:20:21,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:20:21,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-12-07 12:20:21,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:20:21,885 INFO L225 Difference]: With dead ends: 487 [2019-12-07 12:20:21,885 INFO L226 Difference]: Without dead ends: 314 [2019-12-07 12:20:21,888 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 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-12-07 12:20:21,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-12-07 12:20:21,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2019-12-07 12:20:21,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-12-07 12:20:21,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 470 transitions. [2019-12-07 12:20:21,932 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 470 transitions. Word has length 24 [2019-12-07 12:20:21,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:20:21,933 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 470 transitions. [2019-12-07 12:20:21,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:20:21,933 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 470 transitions. [2019-12-07 12:20:21,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 12:20:21,936 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:20:21,936 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-12-07 12:20:22,137 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 12:20:22,137 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:20:22,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:20:22,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1854239308, now seen corresponding path program 1 times [2019-12-07 12:20:22,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:20:22,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1676613819] [2019-12-07 12:20:22,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36cec98e-9c00-491c-b107-366d048a6415/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 12:20:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:20:22,355 INFO L264 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 12:20:22,358 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:20:22,371 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:20:22,372 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:20:22,385 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:20:22,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1676613819] [2019-12-07 12:20:22,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:20:22,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 12:20:22,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424565208] [2019-12-07 12:20:22,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:20:22,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:20:22,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:20:22,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:20:22,388 INFO L87 Difference]: Start difference. First operand 314 states and 470 transitions. Second operand 4 states. [2019-12-07 12:20:23,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:20:23,241 INFO L93 Difference]: Finished difference Result 721 states and 1085 transitions. [2019-12-07 12:20:23,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:20:23,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-12-07 12:20:23,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:20:23,244 INFO L225 Difference]: With dead ends: 721 [2019-12-07 12:20:23,244 INFO L226 Difference]: Without dead ends: 515 [2019-12-07 12:20:23,246 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 116 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-12-07 12:20:23,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-12-07 12:20:23,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2019-12-07 12:20:23,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2019-12-07 12:20:23,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 768 transitions. [2019-12-07 12:20:23,271 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 768 transitions. Word has length 60 [2019-12-07 12:20:23,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:20:23,272 INFO L462 AbstractCegarLoop]: Abstraction has 515 states and 768 transitions. [2019-12-07 12:20:23,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:20:23,272 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 768 transitions. [2019-12-07 12:20:23,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 12:20:23,277 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:20:23,277 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:20:23,478 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 12:20:23,479 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:20:23,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:20:23,480 INFO L82 PathProgramCache]: Analyzing trace with hash 465583256, now seen corresponding path program 1 times [2019-12-07 12:20:23,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:20:23,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1133687307] [2019-12-07 12:20:23,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36cec98e-9c00-491c-b107-366d048a6415/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 12:20:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:20:23,703 INFO L264 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 12:20:23,708 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:21:00,494 WARN L192 SmtUtils]: Spent 36.76 s on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2019-12-07 12:21:00,508 INFO L343 Elim1Store]: treesize reduction 140, result has 40.9 percent of original size [2019-12-07 12:21:00,512 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 106 [2019-12-07 12:21:00,513 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:21:16,821 WARN L192 SmtUtils]: Spent 16.31 s on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-12-07 12:21:16,821 INFO L614 ElimStorePlain]: treesize reduction 18, result has 83.0 percent of original size [2019-12-07 12:21:16,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:21:16,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:21:16,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:21:16,830 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:21:16,830 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:9 [2019-12-07 12:21:16,857 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 12:21:16,857 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 26 [2019-12-07 12:21:16,858 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:21:16,860 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:21:16,860 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:21:16,861 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:11 [2019-12-07 12:21:16,864 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2019-12-07 12:21:16,865 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:21:16,867 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:21:16,867 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:21:16,867 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2019-12-07 12:21:16,880 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-12-07 12:21:16,880 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:21:16,901 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-12-07 12:21:16,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1133687307] [2019-12-07 12:21:16,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:21:16,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 12:21:16,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098854414] [2019-12-07 12:21:16,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:21:16,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:21:16,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:21:16,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:21:16,902 INFO L87 Difference]: Start difference. First operand 515 states and 768 transitions. Second operand 4 states. [2019-12-07 12:21:18,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:21:18,013 INFO L93 Difference]: Finished difference Result 1027 states and 1530 transitions. [2019-12-07 12:21:18,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:21:18,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 12:21:18,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:21:18,017 INFO L225 Difference]: With dead ends: 1027 [2019-12-07 12:21:18,017 INFO L226 Difference]: Without dead ends: 519 [2019-12-07 12:21:18,018 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 190 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:21:18,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2019-12-07 12:21:18,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 518. [2019-12-07 12:21:18,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2019-12-07 12:21:18,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 771 transitions. [2019-12-07 12:21:18,033 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 771 transitions. Word has length 98 [2019-12-07 12:21:18,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:21:18,033 INFO L462 AbstractCegarLoop]: Abstraction has 518 states and 771 transitions. [2019-12-07 12:21:18,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:21:18,033 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 771 transitions. [2019-12-07 12:21:18,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-07 12:21:18,036 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:21:18,036 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:21:18,237 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 12:21:18,237 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:21:18,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:21:18,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1811187728, now seen corresponding path program 1 times [2019-12-07 12:21:18,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:21:18,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [95073691] [2019-12-07 12:21:18,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36cec98e-9c00-491c-b107-366d048a6415/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 12:21:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:21:18,471 INFO L264 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 12:21:18,475 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:21:18,480 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 12:21:18,480 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:21:18,483 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:21:18,483 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:21:18,483 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 12:21:18,503 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 12:21:18,503 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 12:21:18,504 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:21:18,512 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:21:18,512 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:21:18,513 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-12-07 12:21:18,530 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 12:21:18,531 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 12:21:18,531 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:21:18,532 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:21:18,533 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:21:18,533 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 12:21:18,554 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-12-07 12:21:18,555 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:21:18,592 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-12-07 12:21:18,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [95073691] [2019-12-07 12:21:18,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:21:18,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-12-07 12:21:18,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660118124] [2019-12-07 12:21:18,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:21:18,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:21:18,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:21:18,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:21:18,593 INFO L87 Difference]: Start difference. First operand 518 states and 771 transitions. Second operand 7 states. [2019-12-07 12:21:26,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:21:26,813 INFO L93 Difference]: Finished difference Result 1848 states and 2767 transitions. [2019-12-07 12:21:26,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:21:26,814 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 112 [2019-12-07 12:21:26,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:21:26,822 INFO L225 Difference]: With dead ends: 1848 [2019-12-07 12:21:26,823 INFO L226 Difference]: Without dead ends: 1340 [2019-12-07 12:21:26,824 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 216 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:21:26,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2019-12-07 12:21:26,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 622. [2019-12-07 12:21:26,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-12-07 12:21:26,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 945 transitions. [2019-12-07 12:21:26,844 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 945 transitions. Word has length 112 [2019-12-07 12:21:26,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:21:26,844 INFO L462 AbstractCegarLoop]: Abstraction has 622 states and 945 transitions. [2019-12-07 12:21:26,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:21:26,845 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 945 transitions. [2019-12-07 12:21:26,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-07 12:21:26,846 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:21:26,846 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:21:27,046 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 12:21:27,047 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:21:27,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:21:27,047 INFO L82 PathProgramCache]: Analyzing trace with hash 797599730, now seen corresponding path program 1 times [2019-12-07 12:21:27,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:21:27,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2016687677] [2019-12-07 12:21:27,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36cec98e-9c00-491c-b107-366d048a6415/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 12:21:27,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:21:27,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:21:27,952 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-12-07 12:21:27,952 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:21:28,153 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 12:21:28,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:21:28 BoogieIcfgContainer [2019-12-07 12:21:28,258 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:21:28,258 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:21:28,258 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:21:28,258 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:21:28,259 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:20:21" (3/4) ... [2019-12-07 12:21:28,261 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 12:21:28,339 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_36cec98e-9c00-491c-b107-366d048a6415/bin/uautomizer/witness.graphml [2019-12-07 12:21:28,339 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:21:28,340 INFO L168 Benchmark]: Toolchain (without parser) took 69540.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 220.7 MB). Free memory was 947.0 MB in the beginning and 835.3 MB in the end (delta: 111.7 MB). Peak memory consumption was 332.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:21:28,340 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:21:28,341 INFO L168 Benchmark]: CACSL2BoogieTranslator took 422.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -186.3 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:21:28,341 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.75 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-12-07 12:21:28,341 INFO L168 Benchmark]: Boogie Preprocessor took 58.69 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: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:21:28,342 INFO L168 Benchmark]: RCFGBuilder took 2188.23 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: 102.4 MB). Peak memory consumption was 102.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:21:28,342 INFO L168 Benchmark]: TraceAbstraction took 66721.01 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.9 MB). Free memory was 1.0 GB in the beginning and 849.3 MB in the end (delta: 162.0 MB). Peak memory consumption was 224.9 MB. Max. memory is 11.5 GB. [2019-12-07 12:21:28,342 INFO L168 Benchmark]: Witness Printer took 81.33 ms. Allocated memory is still 1.2 GB. Free memory was 849.3 MB in the beginning and 835.3 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2019-12-07 12:21:28,344 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 422.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -186.3 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.75 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.69 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: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2188.23 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: 102.4 MB). Peak memory consumption was 102.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 66721.01 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.9 MB). Free memory was 1.0 GB in the beginning and 849.3 MB in the end (delta: 162.0 MB). Peak memory consumption was 224.9 MB. Max. memory is 11.5 GB. * Witness Printer took 81.33 ms. Allocated memory is still 1.2 GB. Free memory was 849.3 MB in the beginning and 835.3 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1641]: 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_client_data ; VAL [init=1, SSLv3_client_data={15:0}] [L1065] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1069] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1070] s->ctx = malloc(sizeof(SSL_CTX)) [L1071] s->session = malloc(sizeof(SSL_SESSION)) [L1072] s->state = 12292 [L1073] s->version = __VERIFIER_nondet_int() [L1080] BUF_MEM *buf ; [L1081] unsigned long tmp ; [L1082] unsigned long l ; [L1083] long num1 ; [L1084] void (*cb)() ; [L1085] int ret ; [L1086] int new_state ; [L1087] int state ; [L1088] int skip ; [L1089] int tmp___1 = __VERIFIER_nondet_int() ; [L1090] int tmp___2 = __VERIFIER_nondet_int() ; [L1091] int tmp___3 = __VERIFIER_nondet_int() ; [L1092] int tmp___4 = __VERIFIER_nondet_int() ; [L1093] int tmp___5 = __VERIFIER_nondet_int() ; [L1094] int tmp___6 = __VERIFIER_nondet_int() ; [L1095] int tmp___7 = __VERIFIER_nondet_int() ; [L1096] int tmp___8 = __VERIFIER_nondet_int() ; [L1097] long tmp___9 = __VERIFIER_nondet_long() ; [L1098] int blastFlag ; [L1101] blastFlag = 0 [L1102] s->hit=__VERIFIER_nondet_int () [L1103] s->state = 12292 [L1104] tmp = __VERIFIER_nondet_int() [L1105] cb = (void (*)())((void *)0) [L1106] ret = -1 [L1107] skip = 0 [L1108] EXPR s->info_callback VAL [init=1, SSLv3_client_data={15:0}] [L1108] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1109] EXPR s->info_callback [L1109] cb = s->info_callback [L1117] EXPR s->in_handshake [L1117] s->in_handshake += 1 [L1118] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_client_data={15:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={15:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1131] COND TRUE s->state == 12292 [L1234] s->new_session = 1 [L1235] s->state = 4096 [L1236] EXPR s->ctx [L1236] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1236] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1241] s->server = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1242] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={15:0}] [L1247] EXPR s->version VAL [init=1, SSLv3_client_data={15:0}] [L1247] COND FALSE !((s->version & 65280) != 768) [L1253] s->type = 4096 [L1254] EXPR s->init_buf VAL [init=1, SSLv3_client_data={15:0}] [L1254] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1272] COND FALSE !(! tmp___4) VAL [init=1, SSLv3_client_data={15:0}] [L1278] COND FALSE !(! tmp___5) [L1284] s->state = 4368 [L1285] EXPR s->ctx [L1285] EXPR (s->ctx)->stats.sess_connect [L1285] (s->ctx)->stats.sess_connect += 1 [L1286] s->init_num = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={15:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={15:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1146] COND TRUE s->state == 4368 [L1290] s->shutdown = 0 [L1291] ret = __VERIFIER_nondet_int() [L1292] COND TRUE blastFlag == 0 [L1293] blastFlag = 1 VAL [init=1, SSLv3_client_data={15:0}] [L1297] COND FALSE !(ret <= 0) [L1302] s->state = 4384 [L1303] s->init_num = 0 [L1304] EXPR s->bbio [L1304] EXPR s->wbio VAL [init=1, SSLv3_client_data={15:0}] [L1304] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={15:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={15:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1152] COND TRUE s->state == 4384 [L1312] ret = __VERIFIER_nondet_int() [L1313] COND TRUE blastFlag == 1 [L1314] blastFlag = 2 VAL [init=1, SSLv3_client_data={15:0}] [L1318] COND FALSE !(ret <= 0) [L1323] s->hit VAL [init=1, SSLv3_client_data={15:0}] [L1323] COND FALSE !(s->hit) [L1326] s->state = 4400 VAL [init=1, SSLv3_client_data={15:0}] [L1328] s->init_num = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={15:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={15:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1152] COND FALSE !(s->state == 4384) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1155] COND FALSE !(s->state == 4385) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1158] COND TRUE s->state == 4400 [L1332] EXPR s->s3 [L1332] EXPR (s->s3)->tmp.new_cipher [L1332] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_client_data={15:0}] [L1332] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1335] ret = __VERIFIER_nondet_int() [L1336] COND TRUE blastFlag == 2 [L1337] blastFlag = 3 VAL [init=1, SSLv3_client_data={15:0}] [L1345] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={15:0}] [L1351] s->state = 4416 [L1352] s->init_num = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={15:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={15:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1152] COND FALSE !(s->state == 4384) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1155] COND FALSE !(s->state == 4385) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1158] COND FALSE !(s->state == 4400) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1161] COND FALSE !(s->state == 4401) [L1164] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1164] COND TRUE s->state == 4416 [L1356] ret = __VERIFIER_nondet_int() [L1357] COND TRUE blastFlag == 3 [L1358] blastFlag = 4 VAL [init=1, SSLv3_client_data={15:0}] [L1362] COND FALSE !(ret <= 0) [L1367] s->state = 4432 [L1368] s->init_num = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1369] COND FALSE !(! tmp___6) VAL [init=1, SSLv3_client_data={15:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={15:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={15:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1152] COND FALSE !(s->state == 4384) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1155] COND FALSE !(s->state == 4385) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1158] COND FALSE !(s->state == 4400) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1161] COND FALSE !(s->state == 4401) [L1164] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1164] COND FALSE !(s->state == 4416) [L1167] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1167] COND FALSE !(s->state == 4417) [L1170] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1170] COND TRUE s->state == 4432 [L1378] ret = __VERIFIER_nondet_int() [L1379] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_client_data={15:0}] [L1641] __VERIFIER_error() VAL [init=1, SSLv3_client_data={15:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 129 locations, 1 error locations. Result: UNSAFE, OverallTime: 66.5s, OverallIterations: 5, TraceHistogramMax: 6, AutomataDifference: 10.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 826 SDtfs, 1142 SDslu, 1407 SDs, 0 SdLazy, 755 SolverSat, 92 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 583 GetRequests, 566 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=622occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 719 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 53.4s InterpolantComputationTime, 406 NumberOfCodeBlocks, 406 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 580 ConstructedInterpolants, 0 QuantifiedInterpolants, 114966 SizeOfPredicates, 9 NumberOfNonLiveVariables, 814 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 592/592 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...