./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_clnt.blast.02.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ab9117de-8b5e-406b-8ce2-3b57e7c48726/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ab9117de-8b5e-406b-8ce2-3b57e7c48726/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ab9117de-8b5e-406b-8ce2-3b57e7c48726/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ab9117de-8b5e-406b-8ce2-3b57e7c48726/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.02.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ab9117de-8b5e-406b-8ce2-3b57e7c48726/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ab9117de-8b5e-406b-8ce2-3b57e7c48726/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 51cadc06c77079b30c04df95b2f5f78586c8d429 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_ab9117de-8b5e-406b-8ce2-3b57e7c48726/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ab9117de-8b5e-406b-8ce2-3b57e7c48726/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ab9117de-8b5e-406b-8ce2-3b57e7c48726/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ab9117de-8b5e-406b-8ce2-3b57e7c48726/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.02.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ab9117de-8b5e-406b-8ce2-3b57e7c48726/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ab9117de-8b5e-406b-8ce2-3b57e7c48726/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 51cadc06c77079b30c04df95b2f5f78586c8d429 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 03:58:24,042 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 03:58:24,044 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 03:58:24,059 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 03:58:24,059 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 03:58:24,062 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 03:58:24,064 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 03:58:24,073 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 03:58:24,078 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 03:58:24,082 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 03:58:24,084 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 03:58:24,085 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 03:58:24,085 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 03:58:24,088 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 03:58:24,089 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 03:58:24,090 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 03:58:24,091 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 03:58:24,092 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 03:58:24,094 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 03:58:24,097 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 03:58:24,100 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 03:58:24,101 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 03:58:24,102 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 03:58:24,103 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 03:58:24,105 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 03:58:24,105 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 03:58:24,105 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 03:58:24,106 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 03:58:24,106 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 03:58:24,107 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 03:58:24,107 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 03:58:24,108 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 03:58:24,109 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 03:58:24,109 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 03:58:24,110 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 03:58:24,111 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 03:58:24,111 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 03:58:24,112 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 03:58:24,112 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 03:58:24,113 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 03:58:24,113 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 03:58:24,114 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ab9117de-8b5e-406b-8ce2-3b57e7c48726/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 03:58:24,142 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 03:58:24,142 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 03:58:24,143 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 03:58:24,144 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 03:58:24,144 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 03:58:24,144 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 03:58:24,144 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 03:58:24,145 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 03:58:24,145 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 03:58:24,145 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 03:58:24,145 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 03:58:24,146 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 03:58:24,146 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 03:58:24,146 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 03:58:24,146 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 03:58:24,146 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 03:58:24,147 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 03:58:24,147 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 03:58:24,147 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 03:58:24,147 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 03:58:24,147 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 03:58:24,148 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 03:58:24,148 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 03:58:24,148 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 03:58:24,148 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 03:58:24,149 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 03:58:24,149 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 03:58:24,149 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 03:58:24,149 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_ab9117de-8b5e-406b-8ce2-3b57e7c48726/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 -> 51cadc06c77079b30c04df95b2f5f78586c8d429 [2019-11-20 03:58:24,300 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 03:58:24,311 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 03:58:24,314 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 03:58:24,316 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 03:58:24,316 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 03:58:24,317 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ab9117de-8b5e-406b-8ce2-3b57e7c48726/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_clnt.blast.02.i.cil-1.c [2019-11-20 03:58:24,370 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ab9117de-8b5e-406b-8ce2-3b57e7c48726/bin/uautomizer/data/b4a63fc21/d7b350057c6940ebb7a73ab38270787e/FLAG83ed096f8 [2019-11-20 03:58:24,933 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 03:58:24,934 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ab9117de-8b5e-406b-8ce2-3b57e7c48726/sv-benchmarks/c/ssh/s3_clnt.blast.02.i.cil-1.c [2019-11-20 03:58:24,956 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ab9117de-8b5e-406b-8ce2-3b57e7c48726/bin/uautomizer/data/b4a63fc21/d7b350057c6940ebb7a73ab38270787e/FLAG83ed096f8 [2019-11-20 03:58:25,386 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ab9117de-8b5e-406b-8ce2-3b57e7c48726/bin/uautomizer/data/b4a63fc21/d7b350057c6940ebb7a73ab38270787e [2019-11-20 03:58:25,388 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 03:58:25,389 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 03:58:25,390 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 03:58:25,390 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 03:58:25,393 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 03:58:25,394 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:58:25" (1/1) ... [2019-11-20 03:58:25,397 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f0d266d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:58:25, skipping insertion in model container [2019-11-20 03:58:25,397 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:58:25" (1/1) ... [2019-11-20 03:58:25,402 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 03:58:25,480 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 03:58:25,967 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:58:25,983 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 03:58:26,106 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:58:26,143 INFO L192 MainTranslator]: Completed translation [2019-11-20 03:58:26,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:58:26 WrapperNode [2019-11-20 03:58:26,143 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 03:58:26,144 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 03:58:26,144 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 03:58:26,144 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 03:58:26,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:58:26" (1/1) ... [2019-11-20 03:58:26,193 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:58:26" (1/1) ... [2019-11-20 03:58:26,247 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 03:58:26,253 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 03:58:26,253 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 03:58:26,253 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 03:58:26,263 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:58:26" (1/1) ... [2019-11-20 03:58:26,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:58:26" (1/1) ... [2019-11-20 03:58:26,279 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:58:26" (1/1) ... [2019-11-20 03:58:26,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:58:26" (1/1) ... [2019-11-20 03:58:26,330 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:58:26" (1/1) ... [2019-11-20 03:58:26,358 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:58:26" (1/1) ... [2019-11-20 03:58:26,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:58:26" (1/1) ... [2019-11-20 03:58:26,366 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 03:58:26,373 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 03:58:26,373 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 03:58:26,374 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 03:58:26,374 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:58:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab9117de-8b5e-406b-8ce2-3b57e7c48726/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 03:58:26,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 03:58:26,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 03:58:26,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 03:58:26,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 03:58:26,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 03:58:26,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 03:58:26,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 03:58:26,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 03:58:26,741 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 03:58:27,865 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-20 03:58:27,866 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-20 03:58:27,867 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 03:58:27,867 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 03:58:27,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:58:27 BoogieIcfgContainer [2019-11-20 03:58:27,869 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 03:58:27,870 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 03:58:27,870 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 03:58:27,873 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 03:58:27,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:58:25" (1/3) ... [2019-11-20 03:58:27,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ccddc14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:58:27, skipping insertion in model container [2019-11-20 03:58:27,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:58:26" (2/3) ... [2019-11-20 03:58:27,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ccddc14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:58:27, skipping insertion in model container [2019-11-20 03:58:27,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:58:27" (3/3) ... [2019-11-20 03:58:27,876 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.02.i.cil-1.c [2019-11-20 03:58:27,883 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 03:58:27,889 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 03:58:27,899 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 03:58:27,923 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 03:58:27,923 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 03:58:27,923 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 03:58:27,923 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 03:58:27,923 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 03:58:27,924 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 03:58:27,924 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 03:58:27,924 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 03:58:27,942 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2019-11-20 03:58:27,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 03:58:27,949 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:58:27,950 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-11-20 03:58:27,951 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:58:27,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:58:27,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2019-11-20 03:58:27,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:58:27,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028560230] [2019-11-20 03:58:27,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:58:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:58:28,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:58:28,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028560230] [2019-11-20 03:58:28,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:58:28,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:58:28,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225308426] [2019-11-20 03:58:28,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:58:28,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:58:28,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:58:28,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:58:28,252 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 4 states. [2019-11-20 03:58:28,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:58:28,681 INFO L93 Difference]: Finished difference Result 255 states and 430 transitions. [2019-11-20 03:58:28,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:58:28,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-20 03:58:28,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:58:28,695 INFO L225 Difference]: With dead ends: 255 [2019-11-20 03:58:28,695 INFO L226 Difference]: Without dead ends: 116 [2019-11-20 03:58:28,699 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-11-20 03:58:28,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-20 03:58:28,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-11-20 03:58:28,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-20 03:58:28,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2019-11-20 03:58:28,761 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 24 [2019-11-20 03:58:28,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:58:28,762 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2019-11-20 03:58:28,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:58:28,762 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2019-11-20 03:58:28,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 03:58:28,766 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:58:28,767 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-11-20 03:58:28,768 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:58:28,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:58:28,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1001988123, now seen corresponding path program 1 times [2019-11-20 03:58:28,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:58:28,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259498088] [2019-11-20 03:58:28,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:58:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:58:29,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 03:58:29,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259498088] [2019-11-20 03:58:29,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:58:29,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:58:29,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926934265] [2019-11-20 03:58:29,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:58:29,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:58:29,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:58:29,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:58:29,006 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand 3 states. [2019-11-20 03:58:29,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:58:29,064 INFO L93 Difference]: Finished difference Result 320 states and 482 transitions. [2019-11-20 03:58:29,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:58:29,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-20 03:58:29,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:58:29,068 INFO L225 Difference]: With dead ends: 320 [2019-11-20 03:58:29,068 INFO L226 Difference]: Without dead ends: 215 [2019-11-20 03:58:29,069 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:58:29,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-11-20 03:58:29,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2019-11-20 03:58:29,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-11-20 03:58:29,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 319 transitions. [2019-11-20 03:58:29,099 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 319 transitions. Word has length 38 [2019-11-20 03:58:29,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:58:29,101 INFO L462 AbstractCegarLoop]: Abstraction has 215 states and 319 transitions. [2019-11-20 03:58:29,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:58:29,101 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 319 transitions. [2019-11-20 03:58:29,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-20 03:58:29,109 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:58:29,110 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-11-20 03:58:29,110 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:58:29,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:58:29,111 INFO L82 PathProgramCache]: Analyzing trace with hash 996888307, now seen corresponding path program 1 times [2019-11-20 03:58:29,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:58:29,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288254773] [2019-11-20 03:58:29,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:58:29,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:58:29,230 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 03:58:29,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288254773] [2019-11-20 03:58:29,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:58:29,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:58:29,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102486005] [2019-11-20 03:58:29,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:58:29,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:58:29,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:58:29,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:58:29,233 INFO L87 Difference]: Start difference. First operand 215 states and 319 transitions. Second operand 3 states. [2019-11-20 03:58:29,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:58:29,320 INFO L93 Difference]: Finished difference Result 420 states and 630 transitions. [2019-11-20 03:58:29,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:58:29,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-20 03:58:29,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:58:29,329 INFO L225 Difference]: With dead ends: 420 [2019-11-20 03:58:29,332 INFO L226 Difference]: Without dead ends: 315 [2019-11-20 03:58:29,333 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:58:29,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-11-20 03:58:29,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2019-11-20 03:58:29,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-11-20 03:58:29,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 466 transitions. [2019-11-20 03:58:29,368 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 466 transitions. Word has length 53 [2019-11-20 03:58:29,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:58:29,368 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 466 transitions. [2019-11-20 03:58:29,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:58:29,369 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 466 transitions. [2019-11-20 03:58:29,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-20 03:58:29,372 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:58:29,372 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-11-20 03:58:29,373 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:58:29,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:58:29,373 INFO L82 PathProgramCache]: Analyzing trace with hash -973367758, now seen corresponding path program 1 times [2019-11-20 03:58:29,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:58:29,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191187459] [2019-11-20 03:58:29,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:58:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:58:29,552 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 03:58:29,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191187459] [2019-11-20 03:58:29,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:58:29,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:58:29,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131677370] [2019-11-20 03:58:29,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:58:29,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:58:29,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:58:29,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:58:29,556 INFO L87 Difference]: Start difference. First operand 315 states and 466 transitions. Second operand 4 states. [2019-11-20 03:58:30,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:58:30,191 INFO L93 Difference]: Finished difference Result 805 states and 1196 transitions. [2019-11-20 03:58:30,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:58:30,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-20 03:58:30,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:58:30,200 INFO L225 Difference]: With dead ends: 805 [2019-11-20 03:58:30,200 INFO L226 Difference]: Without dead ends: 500 [2019-11-20 03:58:30,201 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-11-20 03:58:30,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-11-20 03:58:30,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 365. [2019-11-20 03:58:30,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-11-20 03:58:30,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 552 transitions. [2019-11-20 03:58:30,248 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 552 transitions. Word has length 71 [2019-11-20 03:58:30,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:58:30,249 INFO L462 AbstractCegarLoop]: Abstraction has 365 states and 552 transitions. [2019-11-20 03:58:30,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:58:30,249 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 552 transitions. [2019-11-20 03:58:30,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-20 03:58:30,252 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:58:30,252 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-11-20 03:58:30,252 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:58:30,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:58:30,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1107381264, now seen corresponding path program 1 times [2019-11-20 03:58:30,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:58:30,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438976926] [2019-11-20 03:58:30,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:58:30,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:58:30,403 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 03:58:30,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438976926] [2019-11-20 03:58:30,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:58:30,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:58:30,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846596466] [2019-11-20 03:58:30,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:58:30,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:58:30,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:58:30,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:58:30,409 INFO L87 Difference]: Start difference. First operand 365 states and 552 transitions. Second operand 4 states. [2019-11-20 03:58:30,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:58:30,895 INFO L93 Difference]: Finished difference Result 805 states and 1217 transitions. [2019-11-20 03:58:30,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:58:30,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-20 03:58:30,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:58:30,903 INFO L225 Difference]: With dead ends: 805 [2019-11-20 03:58:30,903 INFO L226 Difference]: Without dead ends: 450 [2019-11-20 03:58:30,904 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-11-20 03:58:30,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-11-20 03:58:30,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 405. [2019-11-20 03:58:30,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-11-20 03:58:30,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 620 transitions. [2019-11-20 03:58:30,927 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 620 transitions. Word has length 71 [2019-11-20 03:58:30,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:58:30,928 INFO L462 AbstractCegarLoop]: Abstraction has 405 states and 620 transitions. [2019-11-20 03:58:30,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:58:30,928 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 620 transitions. [2019-11-20 03:58:30,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-20 03:58:30,930 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:58:30,931 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-11-20 03:58:30,931 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:58:30,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:58:30,931 INFO L82 PathProgramCache]: Analyzing trace with hash -114315255, now seen corresponding path program 1 times [2019-11-20 03:58:30,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:58:30,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573949916] [2019-11-20 03:58:30,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:58:30,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:58:31,037 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 03:58:31,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573949916] [2019-11-20 03:58:31,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:58:31,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:58:31,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86582536] [2019-11-20 03:58:31,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:58:31,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:58:31,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:58:31,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:58:31,040 INFO L87 Difference]: Start difference. First operand 405 states and 620 transitions. Second operand 4 states. [2019-11-20 03:58:31,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:58:31,584 INFO L93 Difference]: Finished difference Result 927 states and 1408 transitions. [2019-11-20 03:58:31,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:58:31,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-11-20 03:58:31,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:58:31,590 INFO L225 Difference]: With dead ends: 927 [2019-11-20 03:58:31,590 INFO L226 Difference]: Without dead ends: 532 [2019-11-20 03:58:31,591 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-11-20 03:58:31,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-11-20 03:58:31,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 407. [2019-11-20 03:58:31,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-20 03:58:31,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 622 transitions. [2019-11-20 03:58:31,605 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 622 transitions. Word has length 72 [2019-11-20 03:58:31,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:58:31,606 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 622 transitions. [2019-11-20 03:58:31,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:58:31,606 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 622 transitions. [2019-11-20 03:58:31,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 03:58:31,608 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:58:31,608 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-11-20 03:58:31,608 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:58:31,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:58:31,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1902129482, now seen corresponding path program 2 times [2019-11-20 03:58:31,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:58:31,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720745344] [2019-11-20 03:58:31,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:58:31,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:58:31,692 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 03:58:31,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720745344] [2019-11-20 03:58:31,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:58:31,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:58:31,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493767084] [2019-11-20 03:58:31,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:58:31,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:58:31,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:58:31,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:58:31,695 INFO L87 Difference]: Start difference. First operand 407 states and 622 transitions. Second operand 4 states. [2019-11-20 03:58:32,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:58:32,218 INFO L93 Difference]: Finished difference Result 927 states and 1406 transitions. [2019-11-20 03:58:32,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:58:32,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-20 03:58:32,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:58:32,222 INFO L225 Difference]: With dead ends: 927 [2019-11-20 03:58:32,223 INFO L226 Difference]: Without dead ends: 530 [2019-11-20 03:58:32,224 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-11-20 03:58:32,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-11-20 03:58:32,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 407. [2019-11-20 03:58:32,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-20 03:58:32,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 620 transitions. [2019-11-20 03:58:32,238 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 620 transitions. Word has length 85 [2019-11-20 03:58:32,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:58:32,238 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 620 transitions. [2019-11-20 03:58:32,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:58:32,238 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 620 transitions. [2019-11-20 03:58:32,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 03:58:32,240 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:58:32,240 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-11-20 03:58:32,241 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:58:32,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:58:32,241 INFO L82 PathProgramCache]: Analyzing trace with hash 793149036, now seen corresponding path program 1 times [2019-11-20 03:58:32,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:58:32,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453998064] [2019-11-20 03:58:32,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:58:32,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:58:32,312 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 03:58:32,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453998064] [2019-11-20 03:58:32,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:58:32,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:58:32,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510595166] [2019-11-20 03:58:32,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:58:32,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:58:32,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:58:32,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:58:32,315 INFO L87 Difference]: Start difference. First operand 407 states and 620 transitions. Second operand 4 states. [2019-11-20 03:58:32,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:58:32,868 INFO L93 Difference]: Finished difference Result 927 states and 1402 transitions. [2019-11-20 03:58:32,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:58:32,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-20 03:58:32,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:58:32,877 INFO L225 Difference]: With dead ends: 927 [2019-11-20 03:58:32,877 INFO L226 Difference]: Without dead ends: 530 [2019-11-20 03:58:32,878 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-11-20 03:58:32,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-11-20 03:58:32,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 407. [2019-11-20 03:58:32,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-20 03:58:32,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 618 transitions. [2019-11-20 03:58:32,893 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 618 transitions. Word has length 85 [2019-11-20 03:58:32,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:58:32,894 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 618 transitions. [2019-11-20 03:58:32,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:58:32,895 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 618 transitions. [2019-11-20 03:58:32,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 03:58:32,896 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:58:32,897 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-11-20 03:58:32,897 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:58:32,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:58:32,897 INFO L82 PathProgramCache]: Analyzing trace with hash 872770184, now seen corresponding path program 2 times [2019-11-20 03:58:32,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:58:32,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277322936] [2019-11-20 03:58:32,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:58:32,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:58:32,987 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 03:58:32,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277322936] [2019-11-20 03:58:32,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:58:32,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:58:32,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753512482] [2019-11-20 03:58:32,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:58:32,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:58:32,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:58:32,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:58:32,989 INFO L87 Difference]: Start difference. First operand 407 states and 618 transitions. Second operand 4 states. [2019-11-20 03:58:33,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:58:33,356 INFO L93 Difference]: Finished difference Result 847 states and 1277 transitions. [2019-11-20 03:58:33,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:58:33,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-20 03:58:33,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:58:33,360 INFO L225 Difference]: With dead ends: 847 [2019-11-20 03:58:33,360 INFO L226 Difference]: Without dead ends: 450 [2019-11-20 03:58:33,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-11-20 03:58:33,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-11-20 03:58:33,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 407. [2019-11-20 03:58:33,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-20 03:58:33,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 616 transitions. [2019-11-20 03:58:33,375 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 616 transitions. Word has length 85 [2019-11-20 03:58:33,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:58:33,375 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 616 transitions. [2019-11-20 03:58:33,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:58:33,376 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 616 transitions. [2019-11-20 03:58:33,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 03:58:33,377 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:58:33,377 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-11-20 03:58:33,378 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:58:33,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:58:33,378 INFO L82 PathProgramCache]: Analyzing trace with hash -236210262, now seen corresponding path program 1 times [2019-11-20 03:58:33,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:58:33,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170757813] [2019-11-20 03:58:33,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:58:33,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:58:33,461 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 03:58:33,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170757813] [2019-11-20 03:58:33,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:58:33,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:58:33,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967328398] [2019-11-20 03:58:33,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:58:33,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:58:33,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:58:33,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:58:33,467 INFO L87 Difference]: Start difference. First operand 407 states and 616 transitions. Second operand 4 states. [2019-11-20 03:58:33,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:58:33,876 INFO L93 Difference]: Finished difference Result 847 states and 1273 transitions. [2019-11-20 03:58:33,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:58:33,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-20 03:58:33,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:58:33,883 INFO L225 Difference]: With dead ends: 847 [2019-11-20 03:58:33,884 INFO L226 Difference]: Without dead ends: 450 [2019-11-20 03:58:33,885 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-11-20 03:58:33,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-11-20 03:58:33,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 407. [2019-11-20 03:58:33,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-20 03:58:33,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 614 transitions. [2019-11-20 03:58:33,902 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 614 transitions. Word has length 85 [2019-11-20 03:58:33,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:58:33,903 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 614 transitions. [2019-11-20 03:58:33,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:58:33,903 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 614 transitions. [2019-11-20 03:58:33,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 03:58:33,905 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:58:33,905 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-11-20 03:58:33,905 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:58:33,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:58:33,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1127790653, now seen corresponding path program 1 times [2019-11-20 03:58:33,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:58:33,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781648160] [2019-11-20 03:58:33,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:58:33,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:58:34,001 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 03:58:34,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781648160] [2019-11-20 03:58:34,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:58:34,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:58:34,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710674105] [2019-11-20 03:58:34,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:58:34,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:58:34,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:58:34,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:58:34,004 INFO L87 Difference]: Start difference. First operand 407 states and 614 transitions. Second operand 4 states. [2019-11-20 03:58:34,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:58:34,535 INFO L93 Difference]: Finished difference Result 927 states and 1390 transitions. [2019-11-20 03:58:34,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:58:34,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-20 03:58:34,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:58:34,539 INFO L225 Difference]: With dead ends: 927 [2019-11-20 03:58:34,539 INFO L226 Difference]: Without dead ends: 530 [2019-11-20 03:58:34,543 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-11-20 03:58:34,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-11-20 03:58:34,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 407. [2019-11-20 03:58:34,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-20 03:58:34,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 612 transitions. [2019-11-20 03:58:34,557 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 612 transitions. Word has length 86 [2019-11-20 03:58:34,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:58:34,557 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 612 transitions. [2019-11-20 03:58:34,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:58:34,558 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 612 transitions. [2019-11-20 03:58:34,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 03:58:34,559 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:58:34,559 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-11-20 03:58:34,560 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:58:34,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:58:34,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1321809477, now seen corresponding path program 1 times [2019-11-20 03:58:34,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:58:34,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512633445] [2019-11-20 03:58:34,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:58:34,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:58:34,637 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 03:58:34,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512633445] [2019-11-20 03:58:34,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:58:34,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:58:34,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806304099] [2019-11-20 03:58:34,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:58:34,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:58:34,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:58:34,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:58:34,639 INFO L87 Difference]: Start difference. First operand 407 states and 612 transitions. Second operand 4 states. [2019-11-20 03:58:35,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:58:35,039 INFO L93 Difference]: Finished difference Result 847 states and 1265 transitions. [2019-11-20 03:58:35,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:58:35,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-20 03:58:35,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:58:35,042 INFO L225 Difference]: With dead ends: 847 [2019-11-20 03:58:35,042 INFO L226 Difference]: Without dead ends: 450 [2019-11-20 03:58:35,043 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-11-20 03:58:35,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-11-20 03:58:35,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 407. [2019-11-20 03:58:35,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-20 03:58:35,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 610 transitions. [2019-11-20 03:58:35,057 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 610 transitions. Word has length 86 [2019-11-20 03:58:35,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:58:35,057 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 610 transitions. [2019-11-20 03:58:35,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:58:35,058 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 610 transitions. [2019-11-20 03:58:35,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 03:58:35,059 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:58:35,059 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-11-20 03:58:35,060 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:58:35,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:58:35,060 INFO L82 PathProgramCache]: Analyzing trace with hash -490798233, now seen corresponding path program 1 times [2019-11-20 03:58:35,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:58:35,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132987992] [2019-11-20 03:58:35,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:58:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:58:35,144 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 03:58:35,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132987992] [2019-11-20 03:58:35,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:58:35,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:58:35,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39088239] [2019-11-20 03:58:35,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:58:35,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:58:35,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:58:35,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:58:35,146 INFO L87 Difference]: Start difference. First operand 407 states and 610 transitions. Second operand 4 states. [2019-11-20 03:58:35,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:58:35,678 INFO L93 Difference]: Finished difference Result 927 states and 1382 transitions. [2019-11-20 03:58:35,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:58:35,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-20 03:58:35,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:58:35,682 INFO L225 Difference]: With dead ends: 927 [2019-11-20 03:58:35,683 INFO L226 Difference]: Without dead ends: 530 [2019-11-20 03:58:35,684 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-11-20 03:58:35,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-11-20 03:58:35,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 407. [2019-11-20 03:58:35,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-20 03:58:35,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 608 transitions. [2019-11-20 03:58:35,698 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 608 transitions. Word has length 87 [2019-11-20 03:58:35,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:58:35,698 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 608 transitions. [2019-11-20 03:58:35,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:58:35,698 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 608 transitions. [2019-11-20 03:58:35,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 03:58:35,700 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:58:35,700 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, 1] [2019-11-20 03:58:35,700 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:58:35,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:58:35,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1383461914, now seen corresponding path program 1 times [2019-11-20 03:58:35,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:58:35,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620756535] [2019-11-20 03:58:35,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:58:35,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:58:35,779 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 03:58:35,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620756535] [2019-11-20 03:58:35,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:58:35,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:58:35,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993880947] [2019-11-20 03:58:35,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:58:35,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:58:35,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:58:35,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:58:35,782 INFO L87 Difference]: Start difference. First operand 407 states and 608 transitions. Second operand 4 states. [2019-11-20 03:58:36,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:58:36,299 INFO L93 Difference]: Finished difference Result 783 states and 1162 transitions. [2019-11-20 03:58:36,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:58:36,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-20 03:58:36,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:58:36,304 INFO L225 Difference]: With dead ends: 783 [2019-11-20 03:58:36,305 INFO L226 Difference]: Without dead ends: 530 [2019-11-20 03:58:36,306 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-11-20 03:58:36,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-11-20 03:58:36,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 407. [2019-11-20 03:58:36,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-20 03:58:36,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 606 transitions. [2019-11-20 03:58:36,319 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 606 transitions. Word has length 87 [2019-11-20 03:58:36,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:58:36,320 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 606 transitions. [2019-11-20 03:58:36,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:58:36,320 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 606 transitions. [2019-11-20 03:58:36,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 03:58:36,321 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:58:36,322 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-11-20 03:58:36,322 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:58:36,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:58:36,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1862605531, now seen corresponding path program 1 times [2019-11-20 03:58:36,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:58:36,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887498267] [2019-11-20 03:58:36,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:58:36,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:58:36,406 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 03:58:36,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887498267] [2019-11-20 03:58:36,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:58:36,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:58:36,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960833391] [2019-11-20 03:58:36,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:58:36,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:58:36,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:58:36,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:58:36,408 INFO L87 Difference]: Start difference. First operand 407 states and 606 transitions. Second operand 4 states. [2019-11-20 03:58:36,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:58:36,771 INFO L93 Difference]: Finished difference Result 847 states and 1253 transitions. [2019-11-20 03:58:36,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:58:36,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-20 03:58:36,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:58:36,775 INFO L225 Difference]: With dead ends: 847 [2019-11-20 03:58:36,775 INFO L226 Difference]: Without dead ends: 450 [2019-11-20 03:58:36,777 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-11-20 03:58:36,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-11-20 03:58:36,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 407. [2019-11-20 03:58:36,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-20 03:58:36,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 604 transitions. [2019-11-20 03:58:36,790 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 604 transitions. Word has length 87 [2019-11-20 03:58:36,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:58:36,790 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 604 transitions. [2019-11-20 03:58:36,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:58:36,791 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 604 transitions. [2019-11-20 03:58:36,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 03:58:36,792 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:58:36,792 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, 1] [2019-11-20 03:58:36,793 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:58:36,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:58:36,793 INFO L82 PathProgramCache]: Analyzing trace with hash 11654616, now seen corresponding path program 1 times [2019-11-20 03:58:36,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:58:36,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818171839] [2019-11-20 03:58:36,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:58:36,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:58:36,864 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 03:58:36,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818171839] [2019-11-20 03:58:36,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:58:36,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:58:36,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437531960] [2019-11-20 03:58:36,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:58:36,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:58:36,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:58:36,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:58:36,872 INFO L87 Difference]: Start difference. First operand 407 states and 604 transitions. Second operand 4 states. [2019-11-20 03:58:37,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:58:37,228 INFO L93 Difference]: Finished difference Result 703 states and 1035 transitions. [2019-11-20 03:58:37,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:58:37,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-20 03:58:37,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:58:37,232 INFO L225 Difference]: With dead ends: 703 [2019-11-20 03:58:37,232 INFO L226 Difference]: Without dead ends: 450 [2019-11-20 03:58:37,232 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-11-20 03:58:37,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-11-20 03:58:37,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 407. [2019-11-20 03:58:37,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-20 03:58:37,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 602 transitions. [2019-11-20 03:58:37,245 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 602 transitions. Word has length 87 [2019-11-20 03:58:37,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:58:37,246 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 602 transitions. [2019-11-20 03:58:37,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:58:37,246 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 602 transitions. [2019-11-20 03:58:37,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 03:58:37,247 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:58:37,248 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-11-20 03:58:37,248 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:58:37,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:58:37,248 INFO L82 PathProgramCache]: Analyzing trace with hash 2132678238, now seen corresponding path program 1 times [2019-11-20 03:58:37,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:58:37,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762378055] [2019-11-20 03:58:37,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:58:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:58:37,323 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 03:58:37,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762378055] [2019-11-20 03:58:37,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:58:37,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:58:37,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026529529] [2019-11-20 03:58:37,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:58:37,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:58:37,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:58:37,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:58:37,325 INFO L87 Difference]: Start difference. First operand 407 states and 602 transitions. Second operand 4 states. [2019-11-20 03:58:37,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:58:37,827 INFO L93 Difference]: Finished difference Result 909 states and 1344 transitions. [2019-11-20 03:58:37,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:58:37,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-20 03:58:37,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:58:37,831 INFO L225 Difference]: With dead ends: 909 [2019-11-20 03:58:37,831 INFO L226 Difference]: Without dead ends: 512 [2019-11-20 03:58:37,832 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-11-20 03:58:37,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-11-20 03:58:37,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 407. [2019-11-20 03:58:37,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-20 03:58:37,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 600 transitions. [2019-11-20 03:58:37,847 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 600 transitions. Word has length 88 [2019-11-20 03:58:37,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:58:37,848 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 600 transitions. [2019-11-20 03:58:37,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:58:37,848 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 600 transitions. [2019-11-20 03:58:37,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 03:58:37,850 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:58:37,850 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, 1] [2019-11-20 03:58:37,850 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:58:37,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:58:37,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1903796849, now seen corresponding path program 1 times [2019-11-20 03:58:37,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:58:37,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351653960] [2019-11-20 03:58:37,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:58:37,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:58:37,955 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 03:58:37,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351653960] [2019-11-20 03:58:37,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:58:37,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:58:37,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757283572] [2019-11-20 03:58:37,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:58:37,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:58:37,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:58:37,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:58:37,956 INFO L87 Difference]: Start difference. First operand 407 states and 600 transitions. Second operand 4 states. [2019-11-20 03:58:38,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:58:38,423 INFO L93 Difference]: Finished difference Result 758 states and 1119 transitions. [2019-11-20 03:58:38,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:58:38,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-20 03:58:38,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:58:38,427 INFO L225 Difference]: With dead ends: 758 [2019-11-20 03:58:38,427 INFO L226 Difference]: Without dead ends: 505 [2019-11-20 03:58:38,428 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-11-20 03:58:38,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-11-20 03:58:38,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 407. [2019-11-20 03:58:38,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-20 03:58:38,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 598 transitions. [2019-11-20 03:58:38,441 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 598 transitions. Word has length 88 [2019-11-20 03:58:38,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:58:38,441 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 598 transitions. [2019-11-20 03:58:38,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:58:38,441 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 598 transitions. [2019-11-20 03:58:38,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 03:58:38,443 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:58:38,443 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-11-20 03:58:38,443 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:58:38,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:58:38,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1738642336, now seen corresponding path program 1 times [2019-11-20 03:58:38,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:58:38,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873544250] [2019-11-20 03:58:38,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:58:38,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:58:38,499 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 03:58:38,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873544250] [2019-11-20 03:58:38,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:58:38,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:58:38,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670744071] [2019-11-20 03:58:38,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:58:38,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:58:38,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:58:38,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:58:38,502 INFO L87 Difference]: Start difference. First operand 407 states and 598 transitions. Second operand 4 states. [2019-11-20 03:58:38,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:58:38,839 INFO L93 Difference]: Finished difference Result 829 states and 1215 transitions. [2019-11-20 03:58:38,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:58:38,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-20 03:58:38,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:58:38,842 INFO L225 Difference]: With dead ends: 829 [2019-11-20 03:58:38,842 INFO L226 Difference]: Without dead ends: 432 [2019-11-20 03:58:38,843 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-11-20 03:58:38,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-11-20 03:58:38,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 407. [2019-11-20 03:58:38,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-20 03:58:38,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 596 transitions. [2019-11-20 03:58:38,856 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 596 transitions. Word has length 88 [2019-11-20 03:58:38,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:58:38,856 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 596 transitions. [2019-11-20 03:58:38,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:58:38,856 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 596 transitions. [2019-11-20 03:58:38,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 03:58:38,858 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:58:38,858 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, 1] [2019-11-20 03:58:38,858 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:58:38,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:58:38,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1967523725, now seen corresponding path program 1 times [2019-11-20 03:58:38,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:58:38,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411570107] [2019-11-20 03:58:38,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:58:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:58:38,921 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 03:58:38,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411570107] [2019-11-20 03:58:38,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:58:38,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:58:38,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594348368] [2019-11-20 03:58:38,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:58:38,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:58:38,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:58:38,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:58:38,923 INFO L87 Difference]: Start difference. First operand 407 states and 596 transitions. Second operand 4 states. [2019-11-20 03:58:39,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:58:39,265 INFO L93 Difference]: Finished difference Result 678 states and 992 transitions. [2019-11-20 03:58:39,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:58:39,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-20 03:58:39,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:58:39,268 INFO L225 Difference]: With dead ends: 678 [2019-11-20 03:58:39,268 INFO L226 Difference]: Without dead ends: 425 [2019-11-20 03:58:39,270 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-11-20 03:58:39,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2019-11-20 03:58:39,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 407. [2019-11-20 03:58:39,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-20 03:58:39,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 594 transitions. [2019-11-20 03:58:39,283 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 594 transitions. Word has length 88 [2019-11-20 03:58:39,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:58:39,283 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 594 transitions. [2019-11-20 03:58:39,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:58:39,284 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 594 transitions. [2019-11-20 03:58:39,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-20 03:58:39,285 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:58:39,285 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-11-20 03:58:39,285 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:58:39,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:58:39,286 INFO L82 PathProgramCache]: Analyzing trace with hash 730673667, now seen corresponding path program 1 times [2019-11-20 03:58:39,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:58:39,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782465509] [2019-11-20 03:58:39,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:58:39,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:58:39,370 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 03:58:39,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782465509] [2019-11-20 03:58:39,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:58:39,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:58:39,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518615036] [2019-11-20 03:58:39,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:58:39,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:58:39,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:58:39,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:58:39,374 INFO L87 Difference]: Start difference. First operand 407 states and 594 transitions. Second operand 4 states. [2019-11-20 03:58:39,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:58:39,818 INFO L93 Difference]: Finished difference Result 902 states and 1319 transitions. [2019-11-20 03:58:39,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:58:39,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-20 03:58:39,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:58:39,821 INFO L225 Difference]: With dead ends: 902 [2019-11-20 03:58:39,822 INFO L226 Difference]: Without dead ends: 505 [2019-11-20 03:58:39,822 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-11-20 03:58:39,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-11-20 03:58:39,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 407. [2019-11-20 03:58:39,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-20 03:58:39,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 592 transitions. [2019-11-20 03:58:39,835 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 592 transitions. Word has length 89 [2019-11-20 03:58:39,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:58:39,835 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 592 transitions. [2019-11-20 03:58:39,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:58:39,836 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 592 transitions. [2019-11-20 03:58:39,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-20 03:58:39,837 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:58:39,838 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-11-20 03:58:39,838 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:58:39,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:58:39,838 INFO L82 PathProgramCache]: Analyzing trace with hash 978820161, now seen corresponding path program 1 times [2019-11-20 03:58:39,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:58:39,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387646555] [2019-11-20 03:58:39,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:58:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:58:39,897 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-20 03:58:39,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387646555] [2019-11-20 03:58:39,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:58:39,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:58:39,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367695716] [2019-11-20 03:58:39,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:58:39,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:58:39,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:58:39,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:58:39,899 INFO L87 Difference]: Start difference. First operand 407 states and 592 transitions. Second operand 3 states. [2019-11-20 03:58:39,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:58:39,936 INFO L93 Difference]: Finished difference Result 807 states and 1180 transitions. [2019-11-20 03:58:39,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:58:39,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-11-20 03:58:39,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:58:39,941 INFO L225 Difference]: With dead ends: 807 [2019-11-20 03:58:39,941 INFO L226 Difference]: Without dead ends: 556 [2019-11-20 03:58:39,943 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:58:39,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2019-11-20 03:58:39,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2019-11-20 03:58:39,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2019-11-20 03:58:39,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 809 transitions. [2019-11-20 03:58:39,959 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 809 transitions. Word has length 89 [2019-11-20 03:58:39,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:58:39,960 INFO L462 AbstractCegarLoop]: Abstraction has 556 states and 809 transitions. [2019-11-20 03:58:39,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:58:39,960 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 809 transitions. [2019-11-20 03:58:39,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 03:58:39,962 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:58:39,962 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-11-20 03:58:39,962 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:58:39,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:58:39,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1317014729, now seen corresponding path program 1 times [2019-11-20 03:58:39,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:58:39,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54348632] [2019-11-20 03:58:39,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:58:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:58:40,015 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-20 03:58:40,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54348632] [2019-11-20 03:58:40,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:58:40,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:58:40,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343448982] [2019-11-20 03:58:40,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:58:40,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:58:40,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:58:40,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:58:40,019 INFO L87 Difference]: Start difference. First operand 556 states and 809 transitions. Second operand 3 states. [2019-11-20 03:58:40,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:58:40,056 INFO L93 Difference]: Finished difference Result 1105 states and 1614 transitions. [2019-11-20 03:58:40,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:58:40,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-11-20 03:58:40,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:58:40,061 INFO L225 Difference]: With dead ends: 1105 [2019-11-20 03:58:40,061 INFO L226 Difference]: Without dead ends: 705 [2019-11-20 03:58:40,062 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:58:40,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2019-11-20 03:58:40,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2019-11-20 03:58:40,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2019-11-20 03:58:40,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1027 transitions. [2019-11-20 03:58:40,083 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1027 transitions. Word has length 91 [2019-11-20 03:58:40,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:58:40,083 INFO L462 AbstractCegarLoop]: Abstraction has 705 states and 1027 transitions. [2019-11-20 03:58:40,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:58:40,084 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1027 transitions. [2019-11-20 03:58:40,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-20 03:58:40,086 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:58:40,086 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-11-20 03:58:40,086 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:58:40,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:58:40,087 INFO L82 PathProgramCache]: Analyzing trace with hash -761801560, now seen corresponding path program 1 times [2019-11-20 03:58:40,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:58:40,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314636310] [2019-11-20 03:58:40,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:58:40,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:58:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:58:40,573 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:58:40,573 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 03:58:40,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 03:58:40 BoogieIcfgContainer [2019-11-20 03:58:40,726 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 03:58:40,726 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 03:58:40,726 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 03:58:40,727 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 03:58:40,727 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:58:27" (3/4) ... [2019-11-20 03:58:40,747 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 03:58:40,747 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 03:58:40,749 INFO L168 Benchmark]: Toolchain (without parser) took 15358.90 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 307.2 MB). Free memory was 939.3 MB in the beginning and 881.0 MB in the end (delta: 58.4 MB). Peak memory consumption was 365.6 MB. Max. memory is 11.5 GB. [2019-11-20 03:58:40,751 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:58:40,752 INFO L168 Benchmark]: CACSL2BoogieTranslator took 753.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -151.1 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2019-11-20 03:58:40,752 INFO L168 Benchmark]: Boogie Procedure Inliner took 108.41 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:58:40,753 INFO L168 Benchmark]: Boogie Preprocessor took 120.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-20 03:58:40,753 INFO L168 Benchmark]: RCFGBuilder took 1495.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 987.3 MB in the end (delta: 96.4 MB). Peak memory consumption was 96.4 MB. Max. memory is 11.5 GB. [2019-11-20 03:58:40,754 INFO L168 Benchmark]: TraceAbstraction took 12856.01 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 185.6 MB). Free memory was 987.3 MB in the beginning and 881.0 MB in the end (delta: 106.3 MB). Peak memory consumption was 291.9 MB. Max. memory is 11.5 GB. [2019-11-20 03:58:40,754 INFO L168 Benchmark]: Witness Printer took 20.72 ms. Allocated memory is still 1.3 GB. Free memory is still 881.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:58:40,756 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 753.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -151.1 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 108.41 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 120.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1495.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 987.3 MB in the end (delta: 96.4 MB). Peak memory consumption was 96.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12856.01 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 185.6 MB). Free memory was 987.3 MB in the beginning and 881.0 MB in the end (delta: 106.3 MB). Peak memory consumption was 291.9 MB. Max. memory is 11.5 GB. * Witness Printer took 20.72 ms. Allocated memory is still 1.3 GB. Free memory is still 881.0 MB. 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 1336. 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}] [L1301] COND FALSE !(ret <= 0) [L1306] s->state = 4384 [L1307] s->init_num = 0 [L1308] EXPR s->bbio [L1308] EXPR s->wbio VAL [init=1, SSLv3_client_data={9:0}] [L1308] 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 [L1316] ret = __VERIFIER_nondet_int() [L1317] COND TRUE blastFlag == 1 [L1318] blastFlag = 2 VAL [init=1, SSLv3_client_data={9:0}] [L1322] COND FALSE !(ret <= 0) [L1327] s->hit VAL [init=1, SSLv3_client_data={9:0}] [L1327] COND FALSE !(s->hit) [L1330] s->state = 4400 VAL [init=1, SSLv3_client_data={9:0}] [L1332] 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 [L1336] EXPR s->s3 [L1336] EXPR (s->s3)->tmp.new_cipher [L1336] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_client_data={9:0}] [L1336] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1339] ret = __VERIFIER_nondet_int() [L1340] COND TRUE blastFlag == 2 [L1341] 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: 12.7s, OverallIterations: 24, TraceHistogramMax: 6, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4890 SDtfs, 1774 SDslu, 6292 SDs, 0 SdLazy, 3593 SolverSat, 131 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 46 SyntacticMatches, 19 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=705occurred 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.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 1480 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1922 NumberOfCodeBlocks, 1922 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1787 ConstructedInterpolants, 0 QuantifiedInterpolants, 374650 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.24-678e011 [2019-11-20 03:58:42,668 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 03:58:42,670 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 03:58:42,681 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 03:58:42,682 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 03:58:42,683 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 03:58:42,684 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 03:58:42,686 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 03:58:42,688 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 03:58:42,689 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 03:58:42,690 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 03:58:42,691 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 03:58:42,692 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 03:58:42,693 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 03:58:42,694 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 03:58:42,695 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 03:58:42,696 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 03:58:42,697 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 03:58:42,699 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 03:58:42,701 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 03:58:42,702 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 03:58:42,703 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 03:58:42,705 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 03:58:42,706 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 03:58:42,708 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 03:58:42,709 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 03:58:42,709 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 03:58:42,710 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 03:58:42,711 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 03:58:42,712 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 03:58:42,712 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 03:58:42,713 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 03:58:42,714 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 03:58:42,714 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 03:58:42,715 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 03:58:42,716 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 03:58:42,716 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 03:58:42,716 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 03:58:42,717 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 03:58:42,718 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 03:58:42,718 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 03:58:42,719 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ab9117de-8b5e-406b-8ce2-3b57e7c48726/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 03:58:42,733 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 03:58:42,734 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 03:58:42,735 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 03:58:42,735 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 03:58:42,736 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 03:58:42,736 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 03:58:42,736 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 03:58:42,736 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 03:58:42,737 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 03:58:42,737 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 03:58:42,737 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 03:58:42,737 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 03:58:42,738 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 03:58:42,738 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 03:58:42,738 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 03:58:42,738 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 03:58:42,739 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 03:58:42,739 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 03:58:42,739 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 03:58:42,739 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 03:58:42,740 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 03:58:42,740 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 03:58:42,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 03:58:42,740 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 03:58:42,741 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 03:58:42,741 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 03:58:42,741 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 03:58:42,741 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 03:58:42,742 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 03:58:42,742 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 03:58:42,742 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_ab9117de-8b5e-406b-8ce2-3b57e7c48726/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 -> 51cadc06c77079b30c04df95b2f5f78586c8d429 [2019-11-20 03:58:43,028 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 03:58:43,040 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 03:58:43,043 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 03:58:43,044 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 03:58:43,045 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 03:58:43,046 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ab9117de-8b5e-406b-8ce2-3b57e7c48726/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_clnt.blast.02.i.cil-1.c [2019-11-20 03:58:43,098 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ab9117de-8b5e-406b-8ce2-3b57e7c48726/bin/uautomizer/data/ec19569d9/df7e3768dcaf4de39f3311dbc33a80d3/FLAG81a1c6f1a [2019-11-20 03:58:43,607 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 03:58:43,607 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ab9117de-8b5e-406b-8ce2-3b57e7c48726/sv-benchmarks/c/ssh/s3_clnt.blast.02.i.cil-1.c [2019-11-20 03:58:43,640 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ab9117de-8b5e-406b-8ce2-3b57e7c48726/bin/uautomizer/data/ec19569d9/df7e3768dcaf4de39f3311dbc33a80d3/FLAG81a1c6f1a [2019-11-20 03:58:43,924 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ab9117de-8b5e-406b-8ce2-3b57e7c48726/bin/uautomizer/data/ec19569d9/df7e3768dcaf4de39f3311dbc33a80d3 [2019-11-20 03:58:43,926 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 03:58:43,928 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 03:58:43,929 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 03:58:43,929 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 03:58:43,934 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 03:58:43,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:58:43" (1/1) ... [2019-11-20 03:58:43,937 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71429ebc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:58:43, skipping insertion in model container [2019-11-20 03:58:43,943 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:58:43" (1/1) ... [2019-11-20 03:58:43,952 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 03:58:44,027 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 03:58:44,602 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:58:44,621 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 03:58:44,758 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:58:44,790 INFO L192 MainTranslator]: Completed translation [2019-11-20 03:58:44,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:58:44 WrapperNode [2019-11-20 03:58:44,791 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 03:58:44,792 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 03:58:44,793 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 03:58:44,794 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 03:58:44,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:58:44" (1/1) ... [2019-11-20 03:58:44,857 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:58:44" (1/1) ... [2019-11-20 03:58:44,938 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 03:58:44,938 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 03:58:44,938 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 03:58:44,939 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 03:58:44,948 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:58:44" (1/1) ... [2019-11-20 03:58:44,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:58:44" (1/1) ... [2019-11-20 03:58:44,970 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:58:44" (1/1) ... [2019-11-20 03:58:44,970 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:58:44" (1/1) ... [2019-11-20 03:58:45,069 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:58:44" (1/1) ... [2019-11-20 03:58:45,090 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:58:44" (1/1) ... [2019-11-20 03:58:45,093 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:58:44" (1/1) ... [2019-11-20 03:58:45,099 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 03:58:45,100 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 03:58:45,100 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 03:58:45,100 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 03:58:45,101 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:58:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab9117de-8b5e-406b-8ce2-3b57e7c48726/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 03:58:45,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 03:58:45,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 03:58:45,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 03:58:45,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 03:58:45,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 03:58:45,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 03:58:45,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 03:58:45,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 03:58:45,353 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 03:58:48,213 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-20 03:58:48,213 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-20 03:58:48,214 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 03:58:48,214 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 03:58:48,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:58:48 BoogieIcfgContainer [2019-11-20 03:58:48,216 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 03:58:48,217 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 03:58:48,217 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 03:58:48,220 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 03:58:48,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:58:43" (1/3) ... [2019-11-20 03:58:48,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7faad373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:58:48, skipping insertion in model container [2019-11-20 03:58:48,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:58:44" (2/3) ... [2019-11-20 03:58:48,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7faad373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:58:48, skipping insertion in model container [2019-11-20 03:58:48,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:58:48" (3/3) ... [2019-11-20 03:58:48,223 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.02.i.cil-1.c [2019-11-20 03:58:48,232 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 03:58:48,239 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 03:58:48,249 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 03:58:48,270 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 03:58:48,270 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 03:58:48,271 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 03:58:48,271 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 03:58:48,271 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 03:58:48,271 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 03:58:48,271 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 03:58:48,271 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 03:58:48,288 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2019-11-20 03:58:48,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 03:58:48,294 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:58:48,295 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-11-20 03:58:48,295 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:58:48,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:58:48,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2019-11-20 03:58:48,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:58:48,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1345531185] [2019-11-20 03:58:48,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab9117de-8b5e-406b-8ce2-3b57e7c48726/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:58:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:58:48,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 03:58:48,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:58:48,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:58:48,560 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:58:48,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:58:48,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1345531185] [2019-11-20 03:58:48,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:58:48,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 03:58:48,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411429315] [2019-11-20 03:58:48,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:58:48,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:58:48,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:58:48,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:58:48,609 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 4 states. [2019-11-20 03:58:48,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:58:48,793 INFO L93 Difference]: Finished difference Result 485 states and 819 transitions. [2019-11-20 03:58:48,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:58:48,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-20 03:58:48,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:58:48,821 INFO L225 Difference]: With dead ends: 485 [2019-11-20 03:58:48,827 INFO L226 Difference]: Without dead ends: 312 [2019-11-20 03:58:48,833 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-11-20 03:58:48,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-11-20 03:58:48,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2019-11-20 03:58:48,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-11-20 03:58:48,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 467 transitions. [2019-11-20 03:58:48,924 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 467 transitions. Word has length 24 [2019-11-20 03:58:48,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:58:48,925 INFO L462 AbstractCegarLoop]: Abstraction has 312 states and 467 transitions. [2019-11-20 03:58:48,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:58:48,926 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 467 transitions. [2019-11-20 03:58:48,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-20 03:58:48,930 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:58:48,930 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-11-20 03:58:49,139 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:58:49,140 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:58:49,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:58:49,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1698457876, now seen corresponding path program 1 times [2019-11-20 03:58:49,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:58:49,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1318922290] [2019-11-20 03:58:49,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab9117de-8b5e-406b-8ce2-3b57e7c48726/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:58:49,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:58:49,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 03:58:49,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:58:49,368 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:58:49,368 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:58:49,387 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:58:49,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1318922290] [2019-11-20 03:58:49,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:58:49,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 03:58:49,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552244643] [2019-11-20 03:58:49,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:58:49,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:58:49,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:58:49,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:58:49,391 INFO L87 Difference]: Start difference. First operand 312 states and 467 transitions. Second operand 4 states. [2019-11-20 03:58:51,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:58:51,026 INFO L93 Difference]: Finished difference Result 718 states and 1080 transitions. [2019-11-20 03:58:51,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:58:51,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-20 03:58:51,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:58:51,032 INFO L225 Difference]: With dead ends: 718 [2019-11-20 03:58:51,032 INFO L226 Difference]: Without dead ends: 513 [2019-11-20 03:58:51,034 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-11-20 03:58:51,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-11-20 03:58:51,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2019-11-20 03:58:51,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2019-11-20 03:58:51,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 765 transitions. [2019-11-20 03:58:51,071 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 765 transitions. Word has length 60 [2019-11-20 03:58:51,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:58:51,073 INFO L462 AbstractCegarLoop]: Abstraction has 513 states and 765 transitions. [2019-11-20 03:58:51,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:58:51,074 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 765 transitions. [2019-11-20 03:58:51,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 03:58:51,086 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:58:51,086 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-11-20 03:58:51,287 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:58:51,287 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:58:51,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:58:51,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1093818034, now seen corresponding path program 1 times [2019-11-20 03:58:51,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:58:51,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [871572116] [2019-11-20 03:58:51,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab9117de-8b5e-406b-8ce2-3b57e7c48726/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:58:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:58:52,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 03:58:52,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:58:52,765 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:58:52,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:58:52,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:58:52,798 INFO L343 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2019-11-20 03:58:52,798 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 35 [2019-11-20 03:58:52,799 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:58:52,821 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:58:52,823 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:58:52,823 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:22 [2019-11-20 03:58:52,882 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:58:52,886 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:58:52,886 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 26 [2019-11-20 03:58:52,888 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:58:52,897 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:58:52,898 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:58:52,898 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:15 [2019-11-20 03:58:52,909 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 15 treesize of output 7 [2019-11-20 03:58:52,910 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:58:52,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:58:52,917 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:58:52,917 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:5 [2019-11-20 03:58:52,957 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 03:58:52,958 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:58:53,066 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 03:58:53,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [871572116] [2019-11-20 03:58:53,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:58:53,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 03:58:53,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8843903] [2019-11-20 03:58:53,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 03:58:53,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:58:53,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 03:58:53,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 03:58:53,071 INFO L87 Difference]: Start difference. First operand 513 states and 765 transitions. Second operand 6 states. [2019-11-20 03:58:58,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:58:58,578 INFO L93 Difference]: Finished difference Result 1453 states and 2175 transitions. [2019-11-20 03:58:58,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 03:58:58,579 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-11-20 03:58:58,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:58:58,585 INFO L225 Difference]: With dead ends: 1453 [2019-11-20 03:58:58,586 INFO L226 Difference]: Without dead ends: 1045 [2019-11-20 03:58:58,588 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 03:58:58,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2019-11-20 03:58:58,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 593. [2019-11-20 03:58:58,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-11-20 03:58:58,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 895 transitions. [2019-11-20 03:58:58,620 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 895 transitions. Word has length 98 [2019-11-20 03:58:58,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:58:58,621 INFO L462 AbstractCegarLoop]: Abstraction has 593 states and 895 transitions. [2019-11-20 03:58:58,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 03:58:58,621 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 895 transitions. [2019-11-20 03:58:58,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 03:58:58,624 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:58:58,624 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 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-11-20 03:58:58,833 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:58:58,833 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:58:58,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:58:58,834 INFO L82 PathProgramCache]: Analyzing trace with hash 517171299, now seen corresponding path program 1 times [2019-11-20 03:58:58,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:58:58,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2039131394] [2019-11-20 03:58:58,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab9117de-8b5e-406b-8ce2-3b57e7c48726/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:59:00,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:59:00,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 03:59:00,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:59:00,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:59:00,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:59:00,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:59:00,278 INFO L343 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2019-11-20 03:59:00,279 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 35 [2019-11-20 03:59:00,279 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:59:00,297 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:59:00,298 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:59:00,298 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:22 [2019-11-20 03:59:00,333 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:59:00,335 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:59:00,336 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 26 [2019-11-20 03:59:00,337 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:59:00,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:59:00,349 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:59:00,349 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:15 [2019-11-20 03:59:00,356 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 15 treesize of output 7 [2019-11-20 03:59:00,357 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:59:00,359 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:59:00,359 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:59:00,359 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:5 [2019-11-20 03:59:00,381 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 03:59:00,381 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:59:00,443 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 03:59:00,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2039131394] [2019-11-20 03:59:00,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:59:00,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 03:59:00,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935129304] [2019-11-20 03:59:00,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 03:59:00,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:59:00,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 03:59:00,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 03:59:00,448 INFO L87 Difference]: Start difference. First operand 593 states and 895 transitions. Second operand 6 states. [2019-11-20 03:59:04,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:59:04,142 INFO L93 Difference]: Finished difference Result 1497 states and 2249 transitions. [2019-11-20 03:59:04,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 03:59:04,144 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-11-20 03:59:04,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:59:04,153 INFO L225 Difference]: With dead ends: 1497 [2019-11-20 03:59:04,153 INFO L226 Difference]: Without dead ends: 1025 [2019-11-20 03:59:04,155 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 03:59:04,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2019-11-20 03:59:04,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 598. [2019-11-20 03:59:04,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-11-20 03:59:04,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 900 transitions. [2019-11-20 03:59:04,186 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 900 transitions. Word has length 99 [2019-11-20 03:59:04,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:59:04,186 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 900 transitions. [2019-11-20 03:59:04,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 03:59:04,187 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 900 transitions. [2019-11-20 03:59:04,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-20 03:59:04,189 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:59:04,189 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-11-20 03:59:04,392 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:59:04,393 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:59:04,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:04,393 INFO L82 PathProgramCache]: Analyzing trace with hash 924378278, now seen corresponding path program 1 times [2019-11-20 03:59:04,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:59:04,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [569877768] [2019-11-20 03:59:04,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab9117de-8b5e-406b-8ce2-3b57e7c48726/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:59:06,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:59:06,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 03:59:06,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:59:06,325 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-11-20 03:59:06,325 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:59:06,338 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:59:06,339 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:59:06,339 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-20 03:59:06,366 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:59:06,367 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-20 03:59:06,367 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:59:06,379 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:59:06,379 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:59:06,380 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-20 03:59:06,405 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:59:06,405 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 03:59:06,406 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:59:06,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:59:06,408 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:59:06,408 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 03:59:06,451 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-20 03:59:06,452 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:59:06,503 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-20 03:59:06,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [569877768] [2019-11-20 03:59:06,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:59:06,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [] total 8 [2019-11-20 03:59:06,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58203377] [2019-11-20 03:59:06,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 03:59:06,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:59:06,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 03:59:06,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-20 03:59:06,506 INFO L87 Difference]: Start difference. First operand 598 states and 900 transitions. Second operand 8 states. [2019-11-20 03:59:13,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:59:13,473 INFO L93 Difference]: Finished difference Result 2063 states and 3108 transitions. [2019-11-20 03:59:13,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 03:59:13,478 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 112 [2019-11-20 03:59:13,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:59:13,486 INFO L225 Difference]: With dead ends: 2063 [2019-11-20 03:59:13,487 INFO L226 Difference]: Without dead ends: 1472 [2019-11-20 03:59:13,488 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 216 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-20 03:59:13,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2019-11-20 03:59:13,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 770. [2019-11-20 03:59:13,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2019-11-20 03:59:13,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1182 transitions. [2019-11-20 03:59:13,526 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1182 transitions. Word has length 112 [2019-11-20 03:59:13,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:59:13,526 INFO L462 AbstractCegarLoop]: Abstraction has 770 states and 1182 transitions. [2019-11-20 03:59:13,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 03:59:13,527 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1182 transitions. [2019-11-20 03:59:13,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-20 03:59:13,529 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:59:13,529 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-11-20 03:59:13,739 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:59:13,739 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:59:13,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:13,739 INFO L82 PathProgramCache]: Analyzing trace with hash -761801560, now seen corresponding path program 1 times [2019-11-20 03:59:13,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:59:13,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1507700048] [2019-11-20 03:59:13,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab9117de-8b5e-406b-8ce2-3b57e7c48726/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:59:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:18,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:19,060 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-20 03:59:19,061 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 03:59:19,282 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:59:19,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 03:59:19 BoogieIcfgContainer [2019-11-20 03:59:19,429 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 03:59:19,430 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 03:59:19,430 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 03:59:19,430 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 03:59:19,431 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:58:48" (3/4) ... [2019-11-20 03:59:19,433 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 03:59:19,563 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ab9117de-8b5e-406b-8ce2-3b57e7c48726/bin/uautomizer/witness.graphml [2019-11-20 03:59:19,563 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 03:59:19,564 INFO L168 Benchmark]: Toolchain (without parser) took 35636.77 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 275.8 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -125.9 MB). Peak memory consumption was 149.8 MB. Max. memory is 11.5 GB. [2019-11-20 03:59:19,564 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:59:19,565 INFO L168 Benchmark]: CACSL2BoogieTranslator took 863.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -156.5 MB). Peak memory consumption was 29.7 MB. Max. memory is 11.5 GB. [2019-11-20 03:59:19,565 INFO L168 Benchmark]: Boogie Procedure Inliner took 145.74 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-20 03:59:19,566 INFO L168 Benchmark]: Boogie Preprocessor took 161.27 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-20 03:59:19,566 INFO L168 Benchmark]: RCFGBuilder took 3116.16 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: 85.1 MB). Peak memory consumption was 85.1 MB. Max. memory is 11.5 GB. [2019-11-20 03:59:19,566 INFO L168 Benchmark]: TraceAbstraction took 31212.23 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 140.0 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -85.2 MB). Peak memory consumption was 54.7 MB. Max. memory is 11.5 GB. [2019-11-20 03:59:19,567 INFO L168 Benchmark]: Witness Printer took 133.40 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2019-11-20 03:59:19,569 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 863.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -156.5 MB). Peak memory consumption was 29.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 145.74 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 161.27 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3116.16 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: 85.1 MB). Peak memory consumption was 85.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 31212.23 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 140.0 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -85.2 MB). Peak memory consumption was 54.7 MB. Max. memory is 11.5 GB. * Witness Printer took 133.40 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 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={1758530013: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={1758530013: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={1758530013:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={1758530013:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013: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={1758530013:0}] [L1242] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={1758530013:0}] [L1247] EXPR s->version VAL [init=1, SSLv3_client_data={1758530013:0}] [L1247] COND FALSE !((s->version & 65280) != 768) [L1253] s->type = 4096 [L1254] EXPR s->init_buf VAL [init=1, SSLv3_client_data={1758530013:0}] [L1254] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1272] COND FALSE !(! tmp___4) VAL [init=1, SSLv3_client_data={1758530013: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={1758530013:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={1758530013:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={1758530013:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={1758530013:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013: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={1758530013:0}] [L1301] COND FALSE !(ret <= 0) [L1306] s->state = 4384 [L1307] s->init_num = 0 [L1308] EXPR s->bbio [L1308] EXPR s->wbio VAL [init=1, SSLv3_client_data={1758530013:0}] [L1308] 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={1758530013:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={1758530013:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={1758530013:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1152] COND TRUE s->state == 4384 [L1316] ret = __VERIFIER_nondet_int() [L1317] COND TRUE blastFlag == 1 [L1318] blastFlag = 2 VAL [init=1, SSLv3_client_data={1758530013:0}] [L1322] COND FALSE !(ret <= 0) [L1327] s->hit VAL [init=1, SSLv3_client_data={1758530013:0}] [L1327] COND FALSE !(s->hit) [L1330] s->state = 4400 VAL [init=1, SSLv3_client_data={1758530013:0}] [L1332] s->init_num = 0 VAL [init=1, SSLv3_client_data={1758530013:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={1758530013:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={1758530013:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={1758530013:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1152] COND FALSE !(s->state == 4384) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1155] COND FALSE !(s->state == 4385) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1158] COND TRUE s->state == 4400 [L1336] EXPR s->s3 [L1336] EXPR (s->s3)->tmp.new_cipher [L1336] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_client_data={1758530013:0}] [L1336] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1339] ret = __VERIFIER_nondet_int() [L1340] COND TRUE blastFlag == 2 [L1341] blastFlag = 3 VAL [init=1, SSLv3_client_data={1758530013:0}] [L1345] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={1758530013:0}] [L1351] s->state = 4416 [L1352] s->init_num = 0 VAL [init=1, SSLv3_client_data={1758530013:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={1758530013:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={1758530013:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={1758530013:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1152] COND FALSE !(s->state == 4384) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1155] COND FALSE !(s->state == 4385) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1158] COND FALSE !(s->state == 4400) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1161] COND FALSE !(s->state == 4401) [L1164] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013: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={1758530013:0}] [L1362] COND FALSE !(ret <= 0) [L1367] s->state = 4432 [L1368] s->init_num = 0 VAL [init=1, SSLv3_client_data={1758530013:0}] [L1369] COND FALSE !(! tmp___6) VAL [init=1, SSLv3_client_data={1758530013:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={1758530013:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={1758530013:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={1758530013:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1152] COND FALSE !(s->state == 4384) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1155] COND FALSE !(s->state == 4385) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1158] COND FALSE !(s->state == 4400) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1161] COND FALSE !(s->state == 4401) [L1164] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1164] COND FALSE !(s->state == 4416) [L1167] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1167] COND FALSE !(s->state == 4417) [L1170] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1170] COND TRUE s->state == 4432 [L1378] ret = __VERIFIER_nondet_int() [L1379] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_client_data={1758530013:0}] [L1641] __VERIFIER_error() VAL [init=1, SSLv3_client_data={1758530013:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 129 locations, 1 error locations. Result: UNSAFE, OverallTime: 31.1s, OverallIterations: 6, TraceHistogramMax: 6, AutomataDifference: 18.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 876 SDtfs, 1825 SDslu, 1840 SDs, 0 SdLazy, 1387 SolverSat, 226 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 784 GetRequests, 756 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=770occurred in iteration=5, 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, 5 MinimizatonAttempts, 1581 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 6.6s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 505 NumberOfCodeBlocks, 505 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 776 ConstructedInterpolants, 0 QuantifiedInterpolants, 187485 SizeOfPredicates, 21 NumberOfNonLiveVariables, 1068 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 836/836 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...