./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 cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1c843fcb-78b5-48d1-bafd-de0c29d2c12d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1c843fcb-78b5-48d1-bafd-de0c29d2c12d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1c843fcb-78b5-48d1-bafd-de0c29d2c12d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1c843fcb-78b5-48d1-bafd-de0c29d2c12d/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_1c843fcb-78b5-48d1-bafd-de0c29d2c12d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1c843fcb-78b5-48d1-bafd-de0c29d2c12d/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_1c843fcb-78b5-48d1-bafd-de0c29d2c12d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1c843fcb-78b5-48d1-bafd-de0c29d2c12d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1c843fcb-78b5-48d1-bafd-de0c29d2c12d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1c843fcb-78b5-48d1-bafd-de0c29d2c12d/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_1c843fcb-78b5-48d1-bafd-de0c29d2c12d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1c843fcb-78b5-48d1-bafd-de0c29d2c12d/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-cad4683 [2019-11-15 22:43:09,329 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:43:09,331 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:43:09,341 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:43:09,341 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:43:09,342 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:43:09,344 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:43:09,346 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:43:09,347 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:43:09,348 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:43:09,349 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:43:09,350 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:43:09,351 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:43:09,351 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:43:09,352 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:43:09,353 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:43:09,354 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:43:09,355 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:43:09,356 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:43:09,358 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:43:09,359 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:43:09,360 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:43:09,362 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:43:09,362 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:43:09,364 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:43:09,365 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:43:09,365 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:43:09,366 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:43:09,366 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:43:09,367 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:43:09,367 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:43:09,368 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:43:09,368 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:43:09,369 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:43:09,370 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:43:09,370 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:43:09,371 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:43:09,371 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:43:09,371 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:43:09,372 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:43:09,373 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:43:09,373 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1c843fcb-78b5-48d1-bafd-de0c29d2c12d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:43:09,386 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:43:09,386 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:43:09,387 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:43:09,387 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:43:09,388 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:43:09,388 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:43:09,388 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:43:09,388 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:43:09,389 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:43:09,389 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:43:09,389 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:43:09,389 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:43:09,389 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:43:09,390 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:43:09,390 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:43:09,390 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:43:09,390 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:43:09,390 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:43:09,391 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:43:09,391 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:43:09,391 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:43:09,391 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:43:09,392 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:43:09,392 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:43:09,392 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:43:09,392 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:43:09,392 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:43:09,393 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:43:09,393 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_1c843fcb-78b5-48d1-bafd-de0c29d2c12d/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-15 22:43:09,418 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:43:09,428 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:43:09,431 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:43:09,433 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:43:09,433 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:43:09,434 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1c843fcb-78b5-48d1-bafd-de0c29d2c12d/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_clnt.blast.02.i.cil-1.c [2019-11-15 22:43:09,490 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1c843fcb-78b5-48d1-bafd-de0c29d2c12d/bin/uautomizer/data/e22828443/508ff10237174d2595e3f0e5fdf0b93f/FLAG0fa81adc3 [2019-11-15 22:43:09,998 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:43:09,999 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1c843fcb-78b5-48d1-bafd-de0c29d2c12d/sv-benchmarks/c/ssh/s3_clnt.blast.02.i.cil-1.c [2019-11-15 22:43:10,022 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1c843fcb-78b5-48d1-bafd-de0c29d2c12d/bin/uautomizer/data/e22828443/508ff10237174d2595e3f0e5fdf0b93f/FLAG0fa81adc3 [2019-11-15 22:43:10,308 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1c843fcb-78b5-48d1-bafd-de0c29d2c12d/bin/uautomizer/data/e22828443/508ff10237174d2595e3f0e5fdf0b93f [2019-11-15 22:43:10,311 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:43:10,313 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:43:10,317 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:43:10,317 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:43:10,320 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:43:10,321 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:43:10" (1/1) ... [2019-11-15 22:43:10,323 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3234252b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:10, skipping insertion in model container [2019-11-15 22:43:10,324 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:43:10" (1/1) ... [2019-11-15 22:43:10,336 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:43:10,406 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:43:10,853 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:43:10,868 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:43:10,972 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:43:11,004 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:43:11,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:11 WrapperNode [2019-11-15 22:43:11,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:43:11,005 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:43:11,006 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:43:11,006 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:43:11,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:11" (1/1) ... [2019-11-15 22:43:11,043 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:11" (1/1) ... [2019-11-15 22:43:11,114 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:43:11,115 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:43:11,115 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:43:11,116 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:43:11,124 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:11" (1/1) ... [2019-11-15 22:43:11,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:11" (1/1) ... [2019-11-15 22:43:11,151 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:11" (1/1) ... [2019-11-15 22:43:11,152 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:11" (1/1) ... [2019-11-15 22:43:11,204 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:11" (1/1) ... [2019-11-15 22:43:11,228 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:11" (1/1) ... [2019-11-15 22:43:11,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:11" (1/1) ... [2019-11-15 22:43:11,237 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:43:11,237 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:43:11,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:43:11,237 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:43:11,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1c843fcb-78b5-48d1-bafd-de0c29d2c12d/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:43:11,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 22:43:11,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:43:11,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:43:11,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:43:11,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 22:43:11,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:43:11,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:43:11,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:43:11,623 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 22:43:12,563 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-15 22:43:12,564 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-15 22:43:12,565 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:43:12,565 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 22:43:12,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:43:12 BoogieIcfgContainer [2019-11-15 22:43:12,569 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:43:12,570 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:43:12,570 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:43:12,578 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:43:12,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:43:10" (1/3) ... [2019-11-15 22:43:12,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a5e8d0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:43:12, skipping insertion in model container [2019-11-15 22:43:12,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:11" (2/3) ... [2019-11-15 22:43:12,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a5e8d0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:43:12, skipping insertion in model container [2019-11-15 22:43:12,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:43:12" (3/3) ... [2019-11-15 22:43:12,582 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.02.i.cil-1.c [2019-11-15 22:43:12,595 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:43:12,609 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:43:12,628 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:43:12,663 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:43:12,663 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:43:12,663 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:43:12,664 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:43:12,664 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:43:12,664 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:43:12,664 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:43:12,664 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:43:12,691 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2019-11-15 22:43:12,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 22:43:12,703 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:12,704 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:43:12,706 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:12,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:12,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2019-11-15 22:43:12,723 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:12,724 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451198] [2019-11-15 22:43:12,724 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:12,724 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:12,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:13,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:43:13,095 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451198] [2019-11-15 22:43:13,096 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:13,097 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:43:13,097 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485001212] [2019-11-15 22:43:13,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:43:13,102 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:13,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:43:13,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:43:13,120 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 4 states. [2019-11-15 22:43:13,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:13,579 INFO L93 Difference]: Finished difference Result 255 states and 430 transitions. [2019-11-15 22:43:13,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:43:13,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-15 22:43:13,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:13,604 INFO L225 Difference]: With dead ends: 255 [2019-11-15 22:43:13,606 INFO L226 Difference]: Without dead ends: 116 [2019-11-15 22:43:13,613 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:43:13,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-15 22:43:13,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-11-15 22:43:13,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-15 22:43:13,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2019-11-15 22:43:13,695 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 24 [2019-11-15 22:43:13,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:13,696 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2019-11-15 22:43:13,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:43:13,696 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2019-11-15 22:43:13,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-15 22:43:13,698 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:13,699 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:43:13,699 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:13,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:13,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1001988123, now seen corresponding path program 1 times [2019-11-15 22:43:13,700 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:13,700 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310333864] [2019-11-15 22:43:13,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:13,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:13,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:13,884 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-15 22:43:13,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310333864] [2019-11-15 22:43:13,885 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:13,885 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:43:13,886 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422650345] [2019-11-15 22:43:13,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:43:13,888 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:13,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:43:13,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:43:13,888 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand 3 states. [2019-11-15 22:43:13,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:13,944 INFO L93 Difference]: Finished difference Result 320 states and 482 transitions. [2019-11-15 22:43:13,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:43:13,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-15 22:43:13,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:13,948 INFO L225 Difference]: With dead ends: 320 [2019-11-15 22:43:13,948 INFO L226 Difference]: Without dead ends: 215 [2019-11-15 22:43:13,950 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:43:13,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-11-15 22:43:13,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2019-11-15 22:43:13,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-11-15 22:43:13,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 319 transitions. [2019-11-15 22:43:13,970 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 319 transitions. Word has length 38 [2019-11-15 22:43:13,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:13,971 INFO L462 AbstractCegarLoop]: Abstraction has 215 states and 319 transitions. [2019-11-15 22:43:13,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:43:13,971 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 319 transitions. [2019-11-15 22:43:13,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 22:43:13,974 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:13,974 INFO L380 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-15 22:43:13,975 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:13,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:13,975 INFO L82 PathProgramCache]: Analyzing trace with hash 996888307, now seen corresponding path program 1 times [2019-11-15 22:43:13,976 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:13,976 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076306777] [2019-11-15 22:43:13,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:13,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:13,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:14,114 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-15 22:43:14,114 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076306777] [2019-11-15 22:43:14,115 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:14,115 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:43:14,115 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486646238] [2019-11-15 22:43:14,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:43:14,116 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:14,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:43:14,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:43:14,117 INFO L87 Difference]: Start difference. First operand 215 states and 319 transitions. Second operand 3 states. [2019-11-15 22:43:14,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:14,211 INFO L93 Difference]: Finished difference Result 420 states and 630 transitions. [2019-11-15 22:43:14,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:43:14,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-15 22:43:14,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:14,215 INFO L225 Difference]: With dead ends: 420 [2019-11-15 22:43:14,215 INFO L226 Difference]: Without dead ends: 315 [2019-11-15 22:43:14,216 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:43:14,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-11-15 22:43:14,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2019-11-15 22:43:14,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-11-15 22:43:14,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 466 transitions. [2019-11-15 22:43:14,256 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 466 transitions. Word has length 53 [2019-11-15 22:43:14,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:14,257 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 466 transitions. [2019-11-15 22:43:14,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:43:14,258 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 466 transitions. [2019-11-15 22:43:14,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-15 22:43:14,265 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:14,266 INFO L380 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-15 22:43:14,266 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:14,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:14,267 INFO L82 PathProgramCache]: Analyzing trace with hash -973367758, now seen corresponding path program 1 times [2019-11-15 22:43:14,267 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:14,267 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547868465] [2019-11-15 22:43:14,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:14,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:14,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:14,399 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-15 22:43:14,399 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547868465] [2019-11-15 22:43:14,400 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:14,400 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:43:14,400 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247479808] [2019-11-15 22:43:14,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:43:14,401 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:14,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:43:14,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:43:14,402 INFO L87 Difference]: Start difference. First operand 315 states and 466 transitions. Second operand 4 states. [2019-11-15 22:43:15,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:15,007 INFO L93 Difference]: Finished difference Result 805 states and 1196 transitions. [2019-11-15 22:43:15,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:43:15,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-15 22:43:15,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:15,013 INFO L225 Difference]: With dead ends: 805 [2019-11-15 22:43:15,013 INFO L226 Difference]: Without dead ends: 500 [2019-11-15 22:43:15,015 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:43:15,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-11-15 22:43:15,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 365. [2019-11-15 22:43:15,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-11-15 22:43:15,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 552 transitions. [2019-11-15 22:43:15,051 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 552 transitions. Word has length 71 [2019-11-15 22:43:15,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:15,052 INFO L462 AbstractCegarLoop]: Abstraction has 365 states and 552 transitions. [2019-11-15 22:43:15,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:43:15,052 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 552 transitions. [2019-11-15 22:43:15,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-15 22:43:15,055 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:15,055 INFO L380 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-15 22:43:15,055 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:15,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:15,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1107381264, now seen corresponding path program 1 times [2019-11-15 22:43:15,056 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:15,056 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609096987] [2019-11-15 22:43:15,057 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:15,057 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:15,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:15,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:15,224 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-15 22:43:15,225 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609096987] [2019-11-15 22:43:15,226 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:15,226 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:43:15,226 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297911957] [2019-11-15 22:43:15,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:43:15,228 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:15,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:43:15,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:43:15,229 INFO L87 Difference]: Start difference. First operand 365 states and 552 transitions. Second operand 4 states. [2019-11-15 22:43:15,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:15,805 INFO L93 Difference]: Finished difference Result 805 states and 1217 transitions. [2019-11-15 22:43:15,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:43:15,806 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-15 22:43:15,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:15,809 INFO L225 Difference]: With dead ends: 805 [2019-11-15 22:43:15,810 INFO L226 Difference]: Without dead ends: 450 [2019-11-15 22:43:15,811 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:43:15,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-11-15 22:43:15,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 405. [2019-11-15 22:43:15,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-11-15 22:43:15,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 620 transitions. [2019-11-15 22:43:15,825 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 620 transitions. Word has length 71 [2019-11-15 22:43:15,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:15,826 INFO L462 AbstractCegarLoop]: Abstraction has 405 states and 620 transitions. [2019-11-15 22:43:15,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:43:15,826 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 620 transitions. [2019-11-15 22:43:15,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 22:43:15,828 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:15,828 INFO L380 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-15 22:43:15,828 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:15,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:15,828 INFO L82 PathProgramCache]: Analyzing trace with hash -114315255, now seen corresponding path program 1 times [2019-11-15 22:43:15,829 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:15,829 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781108034] [2019-11-15 22:43:15,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:15,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:15,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:15,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:15,916 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-15 22:43:15,916 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781108034] [2019-11-15 22:43:15,917 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:15,917 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:43:15,917 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139465912] [2019-11-15 22:43:15,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:43:15,918 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:15,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:43:15,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:43:15,918 INFO L87 Difference]: Start difference. First operand 405 states and 620 transitions. Second operand 4 states. [2019-11-15 22:43:16,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:16,474 INFO L93 Difference]: Finished difference Result 927 states and 1408 transitions. [2019-11-15 22:43:16,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:43:16,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-11-15 22:43:16,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:16,478 INFO L225 Difference]: With dead ends: 927 [2019-11-15 22:43:16,479 INFO L226 Difference]: Without dead ends: 532 [2019-11-15 22:43:16,479 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:43:16,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-11-15 22:43:16,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 407. [2019-11-15 22:43:16,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-15 22:43:16,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 622 transitions. [2019-11-15 22:43:16,492 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 622 transitions. Word has length 72 [2019-11-15 22:43:16,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:16,493 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 622 transitions. [2019-11-15 22:43:16,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:43:16,493 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 622 transitions. [2019-11-15 22:43:16,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 22:43:16,494 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:16,495 INFO L380 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-15 22:43:16,495 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:16,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:16,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1902129482, now seen corresponding path program 2 times [2019-11-15 22:43:16,495 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:16,496 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47852017] [2019-11-15 22:43:16,496 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:16,496 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:16,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:16,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:16,574 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-15 22:43:16,574 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47852017] [2019-11-15 22:43:16,575 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:16,575 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:43:16,575 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246215852] [2019-11-15 22:43:16,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:43:16,576 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:16,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:43:16,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:43:16,577 INFO L87 Difference]: Start difference. First operand 407 states and 622 transitions. Second operand 4 states. [2019-11-15 22:43:17,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:17,130 INFO L93 Difference]: Finished difference Result 927 states and 1406 transitions. [2019-11-15 22:43:17,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:43:17,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-15 22:43:17,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:17,134 INFO L225 Difference]: With dead ends: 927 [2019-11-15 22:43:17,134 INFO L226 Difference]: Without dead ends: 530 [2019-11-15 22:43:17,135 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:43:17,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-11-15 22:43:17,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 407. [2019-11-15 22:43:17,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-15 22:43:17,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 620 transitions. [2019-11-15 22:43:17,147 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 620 transitions. Word has length 85 [2019-11-15 22:43:17,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:17,148 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 620 transitions. [2019-11-15 22:43:17,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:43:17,148 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 620 transitions. [2019-11-15 22:43:17,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 22:43:17,149 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:17,149 INFO L380 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-15 22:43:17,150 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:17,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:17,150 INFO L82 PathProgramCache]: Analyzing trace with hash 793149036, now seen corresponding path program 1 times [2019-11-15 22:43:17,150 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:17,150 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773905733] [2019-11-15 22:43:17,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:17,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:17,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:17,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:17,216 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-15 22:43:17,217 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773905733] [2019-11-15 22:43:17,217 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:17,217 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:43:17,221 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763156781] [2019-11-15 22:43:17,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:43:17,222 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:17,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:43:17,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:43:17,222 INFO L87 Difference]: Start difference. First operand 407 states and 620 transitions. Second operand 4 states. [2019-11-15 22:43:17,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:17,752 INFO L93 Difference]: Finished difference Result 927 states and 1402 transitions. [2019-11-15 22:43:17,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:43:17,753 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-15 22:43:17,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:17,756 INFO L225 Difference]: With dead ends: 927 [2019-11-15 22:43:17,756 INFO L226 Difference]: Without dead ends: 530 [2019-11-15 22:43:17,757 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:43:17,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-11-15 22:43:17,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 407. [2019-11-15 22:43:17,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-15 22:43:17,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 618 transitions. [2019-11-15 22:43:17,771 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 618 transitions. Word has length 85 [2019-11-15 22:43:17,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:17,772 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 618 transitions. [2019-11-15 22:43:17,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:43:17,772 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 618 transitions. [2019-11-15 22:43:17,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 22:43:17,773 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:17,774 INFO L380 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-15 22:43:17,774 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:17,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:17,774 INFO L82 PathProgramCache]: Analyzing trace with hash 872770184, now seen corresponding path program 2 times [2019-11-15 22:43:17,774 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:17,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840732319] [2019-11-15 22:43:17,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:17,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:17,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:17,852 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-15 22:43:17,853 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840732319] [2019-11-15 22:43:17,853 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:17,853 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:43:17,853 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276962684] [2019-11-15 22:43:17,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:43:17,854 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:17,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:43:17,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:43:17,854 INFO L87 Difference]: Start difference. First operand 407 states and 618 transitions. Second operand 4 states. [2019-11-15 22:43:18,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:18,258 INFO L93 Difference]: Finished difference Result 847 states and 1277 transitions. [2019-11-15 22:43:18,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:43:18,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-15 22:43:18,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:18,261 INFO L225 Difference]: With dead ends: 847 [2019-11-15 22:43:18,262 INFO L226 Difference]: Without dead ends: 450 [2019-11-15 22:43:18,263 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:43:18,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-11-15 22:43:18,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 407. [2019-11-15 22:43:18,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-15 22:43:18,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 616 transitions. [2019-11-15 22:43:18,276 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 616 transitions. Word has length 85 [2019-11-15 22:43:18,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:18,276 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 616 transitions. [2019-11-15 22:43:18,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:43:18,276 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 616 transitions. [2019-11-15 22:43:18,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 22:43:18,278 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:18,278 INFO L380 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-15 22:43:18,278 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:18,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:18,279 INFO L82 PathProgramCache]: Analyzing trace with hash -236210262, now seen corresponding path program 1 times [2019-11-15 22:43:18,279 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:18,279 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208182756] [2019-11-15 22:43:18,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:18,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:18,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:18,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:18,344 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-15 22:43:18,344 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208182756] [2019-11-15 22:43:18,344 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:18,345 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:43:18,345 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455213525] [2019-11-15 22:43:18,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:43:18,345 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:18,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:43:18,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:43:18,346 INFO L87 Difference]: Start difference. First operand 407 states and 616 transitions. Second operand 4 states. [2019-11-15 22:43:18,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:18,762 INFO L93 Difference]: Finished difference Result 847 states and 1273 transitions. [2019-11-15 22:43:18,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:43:18,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-15 22:43:18,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:18,765 INFO L225 Difference]: With dead ends: 847 [2019-11-15 22:43:18,766 INFO L226 Difference]: Without dead ends: 450 [2019-11-15 22:43:18,767 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:43:18,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-11-15 22:43:18,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 407. [2019-11-15 22:43:18,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-15 22:43:18,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 614 transitions. [2019-11-15 22:43:18,781 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 614 transitions. Word has length 85 [2019-11-15 22:43:18,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:18,782 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 614 transitions. [2019-11-15 22:43:18,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:43:18,782 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 614 transitions. [2019-11-15 22:43:18,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-15 22:43:18,784 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:18,784 INFO L380 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-15 22:43:18,784 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:18,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:18,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1127790653, now seen corresponding path program 1 times [2019-11-15 22:43:18,785 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:18,785 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942690106] [2019-11-15 22:43:18,785 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:18,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:18,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:18,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:18,869 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-15 22:43:18,870 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942690106] [2019-11-15 22:43:18,870 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:18,870 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:43:18,871 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526662572] [2019-11-15 22:43:18,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:43:18,871 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:18,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:43:18,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:43:18,872 INFO L87 Difference]: Start difference. First operand 407 states and 614 transitions. Second operand 4 states. [2019-11-15 22:43:19,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:19,413 INFO L93 Difference]: Finished difference Result 927 states and 1390 transitions. [2019-11-15 22:43:19,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:43:19,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-15 22:43:19,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:19,417 INFO L225 Difference]: With dead ends: 927 [2019-11-15 22:43:19,417 INFO L226 Difference]: Without dead ends: 530 [2019-11-15 22:43:19,418 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:43:19,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-11-15 22:43:19,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 407. [2019-11-15 22:43:19,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-15 22:43:19,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 612 transitions. [2019-11-15 22:43:19,430 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 612 transitions. Word has length 86 [2019-11-15 22:43:19,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:19,431 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 612 transitions. [2019-11-15 22:43:19,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:43:19,431 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 612 transitions. [2019-11-15 22:43:19,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-15 22:43:19,432 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:19,433 INFO L380 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-15 22:43:19,433 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:19,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:19,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1321809477, now seen corresponding path program 1 times [2019-11-15 22:43:19,433 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:19,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461010962] [2019-11-15 22:43:19,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:19,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:19,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:19,495 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-15 22:43:19,496 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461010962] [2019-11-15 22:43:19,496 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:19,496 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:43:19,496 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93852398] [2019-11-15 22:43:19,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:43:19,497 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:19,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:43:19,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:43:19,498 INFO L87 Difference]: Start difference. First operand 407 states and 612 transitions. Second operand 4 states. [2019-11-15 22:43:19,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:19,887 INFO L93 Difference]: Finished difference Result 847 states and 1265 transitions. [2019-11-15 22:43:19,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:43:19,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-15 22:43:19,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:19,890 INFO L225 Difference]: With dead ends: 847 [2019-11-15 22:43:19,890 INFO L226 Difference]: Without dead ends: 450 [2019-11-15 22:43:19,891 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:43:19,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-11-15 22:43:19,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 407. [2019-11-15 22:43:19,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-15 22:43:19,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 610 transitions. [2019-11-15 22:43:19,903 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 610 transitions. Word has length 86 [2019-11-15 22:43:19,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:19,904 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 610 transitions. [2019-11-15 22:43:19,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:43:19,904 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 610 transitions. [2019-11-15 22:43:19,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 22:43:19,905 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:19,906 INFO L380 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-15 22:43:19,906 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:19,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:19,906 INFO L82 PathProgramCache]: Analyzing trace with hash -490798233, now seen corresponding path program 1 times [2019-11-15 22:43:19,907 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:19,907 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289343109] [2019-11-15 22:43:19,907 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:19,907 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:19,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:19,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:19,971 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-15 22:43:19,971 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289343109] [2019-11-15 22:43:19,971 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:19,972 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:43:19,972 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325440347] [2019-11-15 22:43:19,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:43:19,972 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:19,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:43:19,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:43:19,977 INFO L87 Difference]: Start difference. First operand 407 states and 610 transitions. Second operand 4 states. [2019-11-15 22:43:20,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:20,512 INFO L93 Difference]: Finished difference Result 927 states and 1382 transitions. [2019-11-15 22:43:20,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:43:20,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-15 22:43:20,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:20,516 INFO L225 Difference]: With dead ends: 927 [2019-11-15 22:43:20,516 INFO L226 Difference]: Without dead ends: 530 [2019-11-15 22:43:20,517 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:43:20,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-11-15 22:43:20,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 407. [2019-11-15 22:43:20,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-15 22:43:20,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 608 transitions. [2019-11-15 22:43:20,531 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 608 transitions. Word has length 87 [2019-11-15 22:43:20,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:20,531 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 608 transitions. [2019-11-15 22:43:20,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:43:20,531 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 608 transitions. [2019-11-15 22:43:20,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 22:43:20,533 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:20,533 INFO L380 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-15 22:43:20,533 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:20,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:20,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1383461914, now seen corresponding path program 1 times [2019-11-15 22:43:20,534 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:20,534 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212847753] [2019-11-15 22:43:20,534 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:20,534 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:20,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:20,615 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-15 22:43:20,615 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212847753] [2019-11-15 22:43:20,615 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:20,615 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:43:20,616 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313948851] [2019-11-15 22:43:20,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:43:20,616 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:20,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:43:20,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:43:20,617 INFO L87 Difference]: Start difference. First operand 407 states and 608 transitions. Second operand 4 states. [2019-11-15 22:43:21,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:21,141 INFO L93 Difference]: Finished difference Result 783 states and 1162 transitions. [2019-11-15 22:43:21,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:43:21,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-15 22:43:21,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:21,145 INFO L225 Difference]: With dead ends: 783 [2019-11-15 22:43:21,145 INFO L226 Difference]: Without dead ends: 530 [2019-11-15 22:43:21,147 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:43:21,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-11-15 22:43:21,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 407. [2019-11-15 22:43:21,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-15 22:43:21,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 606 transitions. [2019-11-15 22:43:21,159 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 606 transitions. Word has length 87 [2019-11-15 22:43:21,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:21,159 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 606 transitions. [2019-11-15 22:43:21,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:43:21,159 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 606 transitions. [2019-11-15 22:43:21,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 22:43:21,161 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:21,161 INFO L380 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-15 22:43:21,161 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:21,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:21,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1862605531, now seen corresponding path program 1 times [2019-11-15 22:43:21,162 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:21,162 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703325554] [2019-11-15 22:43:21,162 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:21,162 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:21,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:21,235 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-15 22:43:21,235 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703325554] [2019-11-15 22:43:21,236 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:21,236 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:43:21,236 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900594164] [2019-11-15 22:43:21,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:43:21,237 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:21,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:43:21,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:43:21,237 INFO L87 Difference]: Start difference. First operand 407 states and 606 transitions. Second operand 4 states. [2019-11-15 22:43:21,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:21,621 INFO L93 Difference]: Finished difference Result 847 states and 1253 transitions. [2019-11-15 22:43:21,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:43:21,622 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-15 22:43:21,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:21,625 INFO L225 Difference]: With dead ends: 847 [2019-11-15 22:43:21,625 INFO L226 Difference]: Without dead ends: 450 [2019-11-15 22:43:21,626 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:43:21,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-11-15 22:43:21,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 407. [2019-11-15 22:43:21,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-15 22:43:21,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 604 transitions. [2019-11-15 22:43:21,638 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 604 transitions. Word has length 87 [2019-11-15 22:43:21,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:21,638 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 604 transitions. [2019-11-15 22:43:21,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:43:21,638 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 604 transitions. [2019-11-15 22:43:21,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 22:43:21,640 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:21,640 INFO L380 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-15 22:43:21,640 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:21,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:21,641 INFO L82 PathProgramCache]: Analyzing trace with hash 11654616, now seen corresponding path program 1 times [2019-11-15 22:43:21,641 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:21,641 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999474802] [2019-11-15 22:43:21,641 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:21,641 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:21,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:21,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:21,700 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-15 22:43:21,701 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999474802] [2019-11-15 22:43:21,701 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:21,701 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:43:21,701 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804800331] [2019-11-15 22:43:21,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:43:21,702 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:21,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:43:21,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:43:21,703 INFO L87 Difference]: Start difference. First operand 407 states and 604 transitions. Second operand 4 states. [2019-11-15 22:43:22,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:22,075 INFO L93 Difference]: Finished difference Result 703 states and 1035 transitions. [2019-11-15 22:43:22,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:43:22,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-15 22:43:22,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:22,079 INFO L225 Difference]: With dead ends: 703 [2019-11-15 22:43:22,079 INFO L226 Difference]: Without dead ends: 450 [2019-11-15 22:43:22,079 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:43:22,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-11-15 22:43:22,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 407. [2019-11-15 22:43:22,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-15 22:43:22,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 602 transitions. [2019-11-15 22:43:22,096 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 602 transitions. Word has length 87 [2019-11-15 22:43:22,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:22,097 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 602 transitions. [2019-11-15 22:43:22,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:43:22,097 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 602 transitions. [2019-11-15 22:43:22,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 22:43:22,098 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:22,099 INFO L380 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-15 22:43:22,099 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:22,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:22,099 INFO L82 PathProgramCache]: Analyzing trace with hash 2132678238, now seen corresponding path program 1 times [2019-11-15 22:43:22,099 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:22,099 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215513632] [2019-11-15 22:43:22,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:22,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:22,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:22,165 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-15 22:43:22,165 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215513632] [2019-11-15 22:43:22,166 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:22,166 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:43:22,166 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027247300] [2019-11-15 22:43:22,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:43:22,167 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:22,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:43:22,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:43:22,167 INFO L87 Difference]: Start difference. First operand 407 states and 602 transitions. Second operand 4 states. [2019-11-15 22:43:22,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:22,622 INFO L93 Difference]: Finished difference Result 909 states and 1344 transitions. [2019-11-15 22:43:22,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:43:22,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 22:43:22,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:22,629 INFO L225 Difference]: With dead ends: 909 [2019-11-15 22:43:22,629 INFO L226 Difference]: Without dead ends: 512 [2019-11-15 22:43:22,630 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:43:22,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-11-15 22:43:22,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 407. [2019-11-15 22:43:22,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-15 22:43:22,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 600 transitions. [2019-11-15 22:43:22,647 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 600 transitions. Word has length 88 [2019-11-15 22:43:22,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:22,647 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 600 transitions. [2019-11-15 22:43:22,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:43:22,648 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 600 transitions. [2019-11-15 22:43:22,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 22:43:22,649 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:22,649 INFO L380 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-15 22:43:22,650 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:22,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:22,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1903796849, now seen corresponding path program 1 times [2019-11-15 22:43:22,650 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:22,651 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663248979] [2019-11-15 22:43:22,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:22,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:22,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:22,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:22,732 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-15 22:43:22,733 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663248979] [2019-11-15 22:43:22,733 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:22,733 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:43:22,733 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970836633] [2019-11-15 22:43:22,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:43:22,734 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:22,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:43:22,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:43:22,734 INFO L87 Difference]: Start difference. First operand 407 states and 600 transitions. Second operand 4 states. [2019-11-15 22:43:23,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:23,247 INFO L93 Difference]: Finished difference Result 758 states and 1119 transitions. [2019-11-15 22:43:23,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:43:23,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 22:43:23,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:23,250 INFO L225 Difference]: With dead ends: 758 [2019-11-15 22:43:23,250 INFO L226 Difference]: Without dead ends: 505 [2019-11-15 22:43:23,251 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:43:23,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-11-15 22:43:23,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 407. [2019-11-15 22:43:23,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-15 22:43:23,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 598 transitions. [2019-11-15 22:43:23,264 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 598 transitions. Word has length 88 [2019-11-15 22:43:23,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:23,265 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 598 transitions. [2019-11-15 22:43:23,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:43:23,265 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 598 transitions. [2019-11-15 22:43:23,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 22:43:23,266 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:23,267 INFO L380 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-15 22:43:23,267 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:23,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:23,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1738642336, now seen corresponding path program 1 times [2019-11-15 22:43:23,267 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:23,268 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078678555] [2019-11-15 22:43:23,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:23,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:23,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:23,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:23,342 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-15 22:43:23,343 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078678555] [2019-11-15 22:43:23,343 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:23,343 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:43:23,343 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33376994] [2019-11-15 22:43:23,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:43:23,346 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:23,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:43:23,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:43:23,347 INFO L87 Difference]: Start difference. First operand 407 states and 598 transitions. Second operand 4 states. [2019-11-15 22:43:23,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:23,630 INFO L93 Difference]: Finished difference Result 829 states and 1215 transitions. [2019-11-15 22:43:23,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:43:23,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 22:43:23,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:23,633 INFO L225 Difference]: With dead ends: 829 [2019-11-15 22:43:23,633 INFO L226 Difference]: Without dead ends: 432 [2019-11-15 22:43:23,634 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:43:23,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-11-15 22:43:23,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 407. [2019-11-15 22:43:23,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-15 22:43:23,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 596 transitions. [2019-11-15 22:43:23,648 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 596 transitions. Word has length 88 [2019-11-15 22:43:23,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:23,649 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 596 transitions. [2019-11-15 22:43:23,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:43:23,649 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 596 transitions. [2019-11-15 22:43:23,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 22:43:23,652 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:23,653 INFO L380 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-15 22:43:23,653 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:23,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:23,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1967523725, now seen corresponding path program 1 times [2019-11-15 22:43:23,653 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:23,654 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734685049] [2019-11-15 22:43:23,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:23,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:23,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:23,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:23,719 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-15 22:43:23,719 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734685049] [2019-11-15 22:43:23,719 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:23,719 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:43:23,720 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126790483] [2019-11-15 22:43:23,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:43:23,720 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:23,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:43:23,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:43:23,721 INFO L87 Difference]: Start difference. First operand 407 states and 596 transitions. Second operand 4 states. [2019-11-15 22:43:24,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:24,007 INFO L93 Difference]: Finished difference Result 678 states and 992 transitions. [2019-11-15 22:43:24,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:43:24,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 22:43:24,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:24,013 INFO L225 Difference]: With dead ends: 678 [2019-11-15 22:43:24,013 INFO L226 Difference]: Without dead ends: 425 [2019-11-15 22:43:24,013 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:43:24,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2019-11-15 22:43:24,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 407. [2019-11-15 22:43:24,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-15 22:43:24,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 594 transitions. [2019-11-15 22:43:24,030 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 594 transitions. Word has length 88 [2019-11-15 22:43:24,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:24,030 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 594 transitions. [2019-11-15 22:43:24,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:43:24,030 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 594 transitions. [2019-11-15 22:43:24,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-15 22:43:24,032 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:24,032 INFO L380 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-15 22:43:24,032 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:24,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:24,033 INFO L82 PathProgramCache]: Analyzing trace with hash 730673667, now seen corresponding path program 1 times [2019-11-15 22:43:24,033 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:24,033 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524876868] [2019-11-15 22:43:24,033 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:24,033 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:24,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:24,099 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-15 22:43:24,100 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524876868] [2019-11-15 22:43:24,100 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:24,100 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:43:24,100 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905794826] [2019-11-15 22:43:24,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:43:24,101 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:24,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:43:24,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:43:24,102 INFO L87 Difference]: Start difference. First operand 407 states and 594 transitions. Second operand 4 states. [2019-11-15 22:43:24,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:24,483 INFO L93 Difference]: Finished difference Result 902 states and 1319 transitions. [2019-11-15 22:43:24,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:43:24,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-15 22:43:24,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:24,486 INFO L225 Difference]: With dead ends: 902 [2019-11-15 22:43:24,486 INFO L226 Difference]: Without dead ends: 505 [2019-11-15 22:43:24,487 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:43:24,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-11-15 22:43:24,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 407. [2019-11-15 22:43:24,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-15 22:43:24,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 592 transitions. [2019-11-15 22:43:24,499 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 592 transitions. Word has length 89 [2019-11-15 22:43:24,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:24,500 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 592 transitions. [2019-11-15 22:43:24,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:43:24,500 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 592 transitions. [2019-11-15 22:43:24,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-15 22:43:24,501 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:24,502 INFO L380 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-15 22:43:24,502 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:24,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:24,502 INFO L82 PathProgramCache]: Analyzing trace with hash 978820161, now seen corresponding path program 1 times [2019-11-15 22:43:24,502 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:24,503 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207790296] [2019-11-15 22:43:24,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:24,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:24,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:24,568 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-15 22:43:24,568 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207790296] [2019-11-15 22:43:24,568 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:24,569 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:43:24,569 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311034577] [2019-11-15 22:43:24,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:43:24,569 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:24,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:43:24,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:43:24,570 INFO L87 Difference]: Start difference. First operand 407 states and 592 transitions. Second operand 3 states. [2019-11-15 22:43:24,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:24,616 INFO L93 Difference]: Finished difference Result 807 states and 1180 transitions. [2019-11-15 22:43:24,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:43:24,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-11-15 22:43:24,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:24,620 INFO L225 Difference]: With dead ends: 807 [2019-11-15 22:43:24,620 INFO L226 Difference]: Without dead ends: 556 [2019-11-15 22:43:24,621 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:43:24,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2019-11-15 22:43:24,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2019-11-15 22:43:24,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2019-11-15 22:43:24,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 809 transitions. [2019-11-15 22:43:24,635 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 809 transitions. Word has length 89 [2019-11-15 22:43:24,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:24,635 INFO L462 AbstractCegarLoop]: Abstraction has 556 states and 809 transitions. [2019-11-15 22:43:24,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:43:24,635 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 809 transitions. [2019-11-15 22:43:24,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-15 22:43:24,637 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:24,637 INFO L380 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-15 22:43:24,637 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:24,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:24,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1317014729, now seen corresponding path program 1 times [2019-11-15 22:43:24,638 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:24,638 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915230170] [2019-11-15 22:43:24,638 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:24,638 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:24,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:24,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:24,697 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-15 22:43:24,697 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915230170] [2019-11-15 22:43:24,697 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:24,698 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:43:24,698 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971727535] [2019-11-15 22:43:24,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:43:24,698 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:24,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:43:24,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:43:24,699 INFO L87 Difference]: Start difference. First operand 556 states and 809 transitions. Second operand 3 states. [2019-11-15 22:43:24,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:24,738 INFO L93 Difference]: Finished difference Result 1105 states and 1614 transitions. [2019-11-15 22:43:24,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:43:24,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-11-15 22:43:24,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:24,743 INFO L225 Difference]: With dead ends: 1105 [2019-11-15 22:43:24,743 INFO L226 Difference]: Without dead ends: 705 [2019-11-15 22:43:24,743 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:43:24,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2019-11-15 22:43:24,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2019-11-15 22:43:24,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2019-11-15 22:43:24,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1027 transitions. [2019-11-15 22:43:24,763 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1027 transitions. Word has length 91 [2019-11-15 22:43:24,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:24,764 INFO L462 AbstractCegarLoop]: Abstraction has 705 states and 1027 transitions. [2019-11-15 22:43:24,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:43:24,764 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1027 transitions. [2019-11-15 22:43:24,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-15 22:43:24,766 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:24,766 INFO L380 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-15 22:43:24,766 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:24,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:24,767 INFO L82 PathProgramCache]: Analyzing trace with hash -761801560, now seen corresponding path program 1 times [2019-11-15 22:43:24,767 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:24,767 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784812670] [2019-11-15 22:43:24,769 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:24,769 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:24,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:24,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:25,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:25,173 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:43:25,173 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 22:43:25,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:43:25 BoogieIcfgContainer [2019-11-15 22:43:25,281 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:43:25,282 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:43:25,282 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:43:25,282 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:43:25,282 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:43:12" (3/4) ... [2019-11-15 22:43:25,285 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 22:43:25,286 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:43:25,287 INFO L168 Benchmark]: Toolchain (without parser) took 14973.90 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 295.2 MB). Free memory was 944.7 MB in the beginning and 882.3 MB in the end (delta: 62.4 MB). Peak memory consumption was 357.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:43:25,288 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:43:25,288 INFO L168 Benchmark]: CACSL2BoogieTranslator took 688.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -141.5 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:43:25,288 INFO L168 Benchmark]: Boogie Procedure Inliner took 109.42 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:43:25,289 INFO L168 Benchmark]: Boogie Preprocessor took 121.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:43:25,289 INFO L168 Benchmark]: RCFGBuilder took 1331.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 987.6 MB in the end (delta: 91.7 MB). Peak memory consumption was 91.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:43:25,290 INFO L168 Benchmark]: TraceAbstraction took 12711.79 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 176.7 MB). Free memory was 987.6 MB in the beginning and 882.3 MB in the end (delta: 105.3 MB). Peak memory consumption was 282.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:43:25,290 INFO L168 Benchmark]: Witness Printer took 4.12 ms. Allocated memory is still 1.3 GB. Free memory is still 882.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:43:25,292 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 688.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -141.5 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 109.42 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 121.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1331.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 987.6 MB in the end (delta: 91.7 MB). Peak memory consumption was 91.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12711.79 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 176.7 MB). Free memory was 987.6 MB in the beginning and 882.3 MB in the end (delta: 105.3 MB). Peak memory consumption was 282.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.12 ms. Allocated memory is still 1.3 GB. Free memory is still 882.3 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={-3: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={-3: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={-3:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={-3:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={-3: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={-3:0}] [L1242] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={-3:0}] [L1247] EXPR s->version VAL [init=1, SSLv3_client_data={-3:0}] [L1247] COND FALSE !((s->version & 65280) != 768) [L1253] s->type = 4096 [L1254] EXPR s->init_buf VAL [init=1, SSLv3_client_data={-3:0}] [L1254] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1272] COND FALSE !(! tmp___4) VAL [init=1, SSLv3_client_data={-3: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={-3:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-3:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={-3:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={-3:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={-3: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={-3: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={-3: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={-3:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={-3:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={-3:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={-3: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={-3:0}] [L1322] COND FALSE !(ret <= 0) [L1327] s->hit VAL [init=1, SSLv3_client_data={-3:0}] [L1327] COND FALSE !(s->hit) [L1330] s->state = 4400 VAL [init=1, SSLv3_client_data={-3:0}] [L1332] s->init_num = 0 VAL [init=1, SSLv3_client_data={-3:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-3:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={-3:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={-3:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1152] COND FALSE !(s->state == 4384) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1155] COND FALSE !(s->state == 4385) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={-3: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={-3: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={-3:0}] [L1345] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={-3:0}] [L1351] s->state = 4416 [L1352] s->init_num = 0 VAL [init=1, SSLv3_client_data={-3:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-3:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={-3:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={-3:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1152] COND FALSE !(s->state == 4384) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1155] COND FALSE !(s->state == 4385) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1158] COND FALSE !(s->state == 4400) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1161] COND FALSE !(s->state == 4401) [L1164] EXPR s->state VAL [init=1, SSLv3_client_data={-3: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={-3:0}] [L1362] COND FALSE !(ret <= 0) [L1367] s->state = 4432 [L1368] s->init_num = 0 VAL [init=1, SSLv3_client_data={-3:0}] [L1369] COND FALSE !(! tmp___6) VAL [init=1, SSLv3_client_data={-3:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-3:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={-3:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={-3:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1152] COND FALSE !(s->state == 4384) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1155] COND FALSE !(s->state == 4385) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1158] COND FALSE !(s->state == 4400) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1161] COND FALSE !(s->state == 4401) [L1164] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1164] COND FALSE !(s->state == 4416) [L1167] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1167] COND FALSE !(s->state == 4417) [L1170] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1170] COND TRUE s->state == 4432 [L1378] ret = __VERIFIER_nondet_int() [L1379] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_client_data={-3:0}] [L1641] __VERIFIER_error() VAL [init=1, SSLv3_client_data={-3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 129 locations, 1 error locations. Result: UNSAFE, OverallTime: 12.6s, 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.5s 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.7s SatisfiabilityAnalysisTime, 1.1s 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-cad4683 [2019-11-15 22:43:27,357 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:43:27,359 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:43:27,377 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:43:27,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:43:27,378 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:43:27,380 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:43:27,389 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:43:27,393 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:43:27,397 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:43:27,399 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:43:27,401 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:43:27,402 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:43:27,404 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:43:27,405 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:43:27,406 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:43:27,407 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:43:27,409 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:43:27,411 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:43:27,414 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:43:27,417 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:43:27,419 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:43:27,421 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:43:27,424 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:43:27,426 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:43:27,427 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:43:27,427 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:43:27,430 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:43:27,430 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:43:27,431 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:43:27,432 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:43:27,432 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:43:27,433 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:43:27,433 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:43:27,435 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:43:27,435 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:43:27,436 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:43:27,436 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:43:27,436 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:43:27,437 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:43:27,438 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:43:27,439 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1c843fcb-78b5-48d1-bafd-de0c29d2c12d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 22:43:27,464 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:43:27,473 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:43:27,475 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:43:27,475 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:43:27,475 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:43:27,475 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:43:27,476 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:43:27,476 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:43:27,476 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:43:27,476 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:43:27,477 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:43:27,477 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:43:27,477 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 22:43:27,481 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 22:43:27,481 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:43:27,482 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:43:27,482 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:43:27,482 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:43:27,482 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:43:27,483 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:43:27,483 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:43:27,483 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:43:27,483 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:43:27,483 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:43:27,484 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:43:27,484 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:43:27,484 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 22:43:27,484 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 22:43:27,485 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:43:27,485 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 22:43:27,485 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_1c843fcb-78b5-48d1-bafd-de0c29d2c12d/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-15 22:43:27,521 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:43:27,529 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:43:27,536 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:43:27,537 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:43:27,537 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:43:27,538 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1c843fcb-78b5-48d1-bafd-de0c29d2c12d/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_clnt.blast.02.i.cil-1.c [2019-11-15 22:43:27,586 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1c843fcb-78b5-48d1-bafd-de0c29d2c12d/bin/uautomizer/data/8cd99cb1f/1d2c290f6c9b417bb3450e673845f349/FLAG6872b4e87 [2019-11-15 22:43:28,096 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:43:28,099 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1c843fcb-78b5-48d1-bafd-de0c29d2c12d/sv-benchmarks/c/ssh/s3_clnt.blast.02.i.cil-1.c [2019-11-15 22:43:28,127 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1c843fcb-78b5-48d1-bafd-de0c29d2c12d/bin/uautomizer/data/8cd99cb1f/1d2c290f6c9b417bb3450e673845f349/FLAG6872b4e87 [2019-11-15 22:43:28,317 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1c843fcb-78b5-48d1-bafd-de0c29d2c12d/bin/uautomizer/data/8cd99cb1f/1d2c290f6c9b417bb3450e673845f349 [2019-11-15 22:43:28,320 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:43:28,321 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:43:28,321 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:43:28,322 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:43:28,325 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:43:28,326 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:43:28" (1/1) ... [2019-11-15 22:43:28,328 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@723b8083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:28, skipping insertion in model container [2019-11-15 22:43:28,329 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:43:28" (1/1) ... [2019-11-15 22:43:28,335 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:43:28,396 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:43:28,856 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:43:28,889 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:43:29,058 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:43:29,090 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:43:29,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:29 WrapperNode [2019-11-15 22:43:29,091 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:43:29,092 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:43:29,092 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:43:29,092 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:43:29,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:29" (1/1) ... [2019-11-15 22:43:29,151 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:29" (1/1) ... [2019-11-15 22:43:29,209 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:43:29,210 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:43:29,210 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:43:29,210 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:43:29,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:29" (1/1) ... [2019-11-15 22:43:29,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:29" (1/1) ... [2019-11-15 22:43:29,227 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:29" (1/1) ... [2019-11-15 22:43:29,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:29" (1/1) ... [2019-11-15 22:43:29,276 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:29" (1/1) ... [2019-11-15 22:43:29,285 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:29" (1/1) ... [2019-11-15 22:43:29,289 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:29" (1/1) ... [2019-11-15 22:43:29,298 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:43:29,299 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:43:29,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:43:29,299 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:43:29,300 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1c843fcb-78b5-48d1-bafd-de0c29d2c12d/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:43:29,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 22:43:29,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:43:29,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 22:43:29,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 22:43:29,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:43:29,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:43:29,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:43:29,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 22:43:29,644 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 22:43:34,137 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-15 22:43:34,138 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-15 22:43:34,139 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:43:34,139 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 22:43:34,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:43:34 BoogieIcfgContainer [2019-11-15 22:43:34,141 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:43:34,142 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:43:34,142 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:43:34,145 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:43:34,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:43:28" (1/3) ... [2019-11-15 22:43:34,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e3b5c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:43:34, skipping insertion in model container [2019-11-15 22:43:34,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:29" (2/3) ... [2019-11-15 22:43:34,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e3b5c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:43:34, skipping insertion in model container [2019-11-15 22:43:34,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:43:34" (3/3) ... [2019-11-15 22:43:34,149 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.02.i.cil-1.c [2019-11-15 22:43:34,158 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:43:34,165 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:43:34,176 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:43:34,197 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:43:34,198 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:43:34,198 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:43:34,198 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:43:34,199 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:43:34,199 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:43:34,199 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:43:34,199 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:43:34,216 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2019-11-15 22:43:34,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 22:43:34,223 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:34,224 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:43:34,225 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:34,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:34,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2019-11-15 22:43:34,241 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:43:34,241 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2016206117] [2019-11-15 22:43:34,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1c843fcb-78b5-48d1-bafd-de0c29d2c12d/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:43:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:34,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:43:34,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:43:34,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:43:34,496 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:43:34,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:43:34,516 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2016206117] [2019-11-15 22:43:34,516 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:34,517 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 22:43:34,517 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489128339] [2019-11-15 22:43:34,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:43:34,524 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:43:34,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:43:34,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:43:34,541 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 4 states. [2019-11-15 22:43:34,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:34,718 INFO L93 Difference]: Finished difference Result 485 states and 819 transitions. [2019-11-15 22:43:34,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:43:34,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-15 22:43:34,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:34,736 INFO L225 Difference]: With dead ends: 485 [2019-11-15 22:43:34,736 INFO L226 Difference]: Without dead ends: 312 [2019-11-15 22:43:34,740 INFO L600 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-15 22:43:34,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-11-15 22:43:34,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2019-11-15 22:43:34,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-11-15 22:43:34,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 467 transitions. [2019-11-15 22:43:34,798 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 467 transitions. Word has length 24 [2019-11-15 22:43:34,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:34,798 INFO L462 AbstractCegarLoop]: Abstraction has 312 states and 467 transitions. [2019-11-15 22:43:34,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:43:34,799 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 467 transitions. [2019-11-15 22:43:34,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 22:43:34,803 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:34,803 INFO L380 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-15 22:43:35,005 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:43:35,006 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:35,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:35,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1698457876, now seen corresponding path program 1 times [2019-11-15 22:43:35,007 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:43:35,007 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [334750598] [2019-11-15 22:43:35,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1c843fcb-78b5-48d1-bafd-de0c29d2c12d/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:43:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:35,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:43:35,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:43:35,262 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-15 22:43:35,263 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:43:35,280 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-15 22:43:35,281 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [334750598] [2019-11-15 22:43:35,281 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:35,281 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 22:43:35,282 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293635346] [2019-11-15 22:43:35,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:43:35,284 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:43:35,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:43:35,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:43:35,284 INFO L87 Difference]: Start difference. First operand 312 states and 467 transitions. Second operand 4 states. [2019-11-15 22:43:37,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:37,448 INFO L93 Difference]: Finished difference Result 718 states and 1080 transitions. [2019-11-15 22:43:37,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:43:37,450 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-15 22:43:37,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:37,455 INFO L225 Difference]: With dead ends: 718 [2019-11-15 22:43:37,455 INFO L226 Difference]: Without dead ends: 513 [2019-11-15 22:43:37,457 INFO L600 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-15 22:43:37,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-11-15 22:43:37,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2019-11-15 22:43:37,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2019-11-15 22:43:37,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 765 transitions. [2019-11-15 22:43:37,527 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 765 transitions. Word has length 60 [2019-11-15 22:43:37,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:37,528 INFO L462 AbstractCegarLoop]: Abstraction has 513 states and 765 transitions. [2019-11-15 22:43:37,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:43:37,532 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 765 transitions. [2019-11-15 22:43:37,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 22:43:37,544 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:37,545 INFO L380 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-15 22:43:37,747 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:43:37,750 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:37,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:37,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1093818034, now seen corresponding path program 1 times [2019-11-15 22:43:37,752 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:43:37,752 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [87775796] [2019-11-15 22:43:37,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1c843fcb-78b5-48d1-bafd-de0c29d2c12d/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:43:39,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:39,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 22:43:39,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:43:39,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:43:39,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:43:39,123 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:43:39,151 INFO L341 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2019-11-15 22:43:39,152 INFO L375 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-15 22:43:39,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:43:39,181 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:43:39,183 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-15 22:43:39,183 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:22 [2019-11-15 22:43:39,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:43:39,227 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:43:39,227 INFO L375 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-15 22:43:39,229 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:43:39,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:43:39,237 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:43:39,237 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:15 [2019-11-15 22:43:39,247 INFO L375 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-15 22:43:39,247 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:43:39,250 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:43:39,250 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-15 22:43:39,250 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:5 [2019-11-15 22:43:39,290 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-15 22:43:39,290 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:43:39,401 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-15 22:43:39,404 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [87775796] [2019-11-15 22:43:39,404 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:39,405 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 22:43:39,405 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746894407] [2019-11-15 22:43:39,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:43:39,408 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:43:39,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:43:39,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:43:39,410 INFO L87 Difference]: Start difference. First operand 513 states and 765 transitions. Second operand 6 states. [2019-11-15 22:43:44,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:44,040 INFO L93 Difference]: Finished difference Result 1453 states and 2175 transitions. [2019-11-15 22:43:44,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:43:44,041 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-11-15 22:43:44,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:44,048 INFO L225 Difference]: With dead ends: 1453 [2019-11-15 22:43:44,048 INFO L226 Difference]: Without dead ends: 1045 [2019-11-15 22:43:44,051 INFO L600 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-15 22:43:44,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2019-11-15 22:43:44,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 593. [2019-11-15 22:43:44,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-11-15 22:43:44,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 895 transitions. [2019-11-15 22:43:44,082 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 895 transitions. Word has length 98 [2019-11-15 22:43:44,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:44,082 INFO L462 AbstractCegarLoop]: Abstraction has 593 states and 895 transitions. [2019-11-15 22:43:44,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:43:44,083 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 895 transitions. [2019-11-15 22:43:44,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 22:43:44,085 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:44,085 INFO L380 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-15 22:43:44,298 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:43:44,298 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:44,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:44,299 INFO L82 PathProgramCache]: Analyzing trace with hash 517171299, now seen corresponding path program 1 times [2019-11-15 22:43:44,299 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:43:44,300 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1740182233] [2019-11-15 22:43:44,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1c843fcb-78b5-48d1-bafd-de0c29d2c12d/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-15 22:43:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:45,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 22:43:45,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:43:45,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:43:45,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:43:45,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:43:45,655 INFO L341 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2019-11-15 22:43:45,656 INFO L375 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-15 22:43:45,656 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:43:45,681 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:43:45,682 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-15 22:43:45,682 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:22 [2019-11-15 22:43:45,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:43:45,727 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:43:45,728 INFO L375 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-15 22:43:45,729 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:43:45,737 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:43:45,737 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:43:45,737 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:15 [2019-11-15 22:43:45,744 INFO L375 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-15 22:43:45,744 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:43:45,746 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:43:45,747 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-15 22:43:45,747 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:5 [2019-11-15 22:43:45,772 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-15 22:43:45,772 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:43:45,841 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-15 22:43:45,843 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1740182233] [2019-11-15 22:43:45,844 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:45,844 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 22:43:45,844 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506459848] [2019-11-15 22:43:45,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:43:45,845 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:43:45,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:43:45,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:43:45,846 INFO L87 Difference]: Start difference. First operand 593 states and 895 transitions. Second operand 6 states. [2019-11-15 22:43:48,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:48,680 INFO L93 Difference]: Finished difference Result 1497 states and 2249 transitions. [2019-11-15 22:43:48,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:43:48,682 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-11-15 22:43:48,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:48,688 INFO L225 Difference]: With dead ends: 1497 [2019-11-15 22:43:48,688 INFO L226 Difference]: Without dead ends: 1025 [2019-11-15 22:43:48,689 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 191 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-15 22:43:48,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2019-11-15 22:43:48,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 598. [2019-11-15 22:43:48,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-11-15 22:43:48,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 900 transitions. [2019-11-15 22:43:48,718 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 900 transitions. Word has length 99 [2019-11-15 22:43:48,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:48,719 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 900 transitions. [2019-11-15 22:43:48,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:43:48,719 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 900 transitions. [2019-11-15 22:43:48,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-15 22:43:48,721 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:48,722 INFO L380 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-15 22:43:48,930 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:43:48,930 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:48,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:48,931 INFO L82 PathProgramCache]: Analyzing trace with hash 924378278, now seen corresponding path program 1 times [2019-11-15 22:43:48,931 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:43:48,932 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [40974450] [2019-11-15 22:43:48,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1c843fcb-78b5-48d1-bafd-de0c29d2c12d/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-15 22:43:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:50,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 22:43:50,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:43:50,723 INFO L375 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-15 22:43:50,723 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:43:50,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:43:50,732 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:43:50,733 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-15 22:43:50,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:43:50,752 INFO L375 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-15 22:43:50,753 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:43:50,788 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:43:50,788 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:43:50,788 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-15 22:43:50,810 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:43:50,810 INFO L375 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-15 22:43:50,810 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:43:50,812 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:43:50,812 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-15 22:43:50,812 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 22:43:50,838 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-15 22:43:50,839 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:43:50,882 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-15 22:43:50,883 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [40974450] [2019-11-15 22:43:50,883 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:50,883 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [] total 8 [2019-11-15 22:43:50,883 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234244441] [2019-11-15 22:43:50,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:43:50,884 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:43:50,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:43:50,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:43:50,884 INFO L87 Difference]: Start difference. First operand 598 states and 900 transitions. Second operand 8 states. [2019-11-15 22:43:57,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:57,499 INFO L93 Difference]: Finished difference Result 2063 states and 3108 transitions. [2019-11-15 22:43:57,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:43:57,503 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 112 [2019-11-15 22:43:57,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:57,513 INFO L225 Difference]: With dead ends: 2063 [2019-11-15 22:43:57,514 INFO L226 Difference]: Without dead ends: 1472 [2019-11-15 22:43:57,515 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 216 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:43:57,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2019-11-15 22:43:57,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 770. [2019-11-15 22:43:57,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2019-11-15 22:43:57,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1182 transitions. [2019-11-15 22:43:57,555 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1182 transitions. Word has length 112 [2019-11-15 22:43:57,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:57,556 INFO L462 AbstractCegarLoop]: Abstraction has 770 states and 1182 transitions. [2019-11-15 22:43:57,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:43:57,556 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1182 transitions. [2019-11-15 22:43:57,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-15 22:43:57,558 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:57,558 INFO L380 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-15 22:43:57,758 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:43:57,759 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:57,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:57,759 INFO L82 PathProgramCache]: Analyzing trace with hash -761801560, now seen corresponding path program 1 times [2019-11-15 22:43:57,760 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:43:57,760 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [493452195] [2019-11-15 22:43:57,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1c843fcb-78b5-48d1-bafd-de0c29d2c12d/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-15 22:43:59,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:44:02,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:44:02,463 INFO L168 tionRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-15 22:44:02,463 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 22:44:02,687 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:44:02,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:44:02 BoogieIcfgContainer [2019-11-15 22:44:02,804 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:44:02,805 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:44:02,805 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:44:02,805 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:44:02,805 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:43:34" (3/4) ... [2019-11-15 22:44:02,808 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 22:44:02,906 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_1c843fcb-78b5-48d1-bafd-de0c29d2c12d/bin/uautomizer/witness.graphml [2019-11-15 22:44:02,907 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:44:02,908 INFO L168 Benchmark]: Toolchain (without parser) took 34587.51 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 276.3 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -135.8 MB). Peak memory consumption was 140.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:44:02,908 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:44:02,909 INFO L168 Benchmark]: CACSL2BoogieTranslator took 769.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -186.0 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:44:02,909 INFO L168 Benchmark]: Boogie Procedure Inliner took 117.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:44:02,909 INFO L168 Benchmark]: Boogie Preprocessor took 88.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:44:02,910 INFO L168 Benchmark]: RCFGBuilder took 4842.36 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: 90.0 MB). Peak memory consumption was 90.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:44:02,910 INFO L168 Benchmark]: TraceAbstraction took 28662.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 116.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -69.9 MB). Peak memory consumption was 46.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:44:02,910 INFO L168 Benchmark]: Witness Printer took 102.25 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.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:44:02,912 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 769.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -186.0 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 117.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 88.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4842.36 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: 90.0 MB). Peak memory consumption was 90.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28662.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 116.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -69.9 MB). Peak memory consumption was 46.5 MB. Max. memory is 11.5 GB. * Witness Printer took 102.25 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.1 MB). Peak memory consumption was 17.1 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={-1510471540: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={-1510471540: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={-1510471540:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540: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={-1510471540:0}] [L1242] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1247] EXPR s->version VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1247] COND FALSE !((s->version & 65280) != 768) [L1253] s->type = 4096 [L1254] EXPR s->init_buf VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1254] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1272] COND FALSE !(! tmp___4) VAL [init=1, SSLv3_client_data={-1510471540: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={-1510471540:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540: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={-1510471540: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={-1510471540: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={-1510471540:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540: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={-1510471540:0}] [L1322] COND FALSE !(ret <= 0) [L1327] s->hit VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1327] COND FALSE !(s->hit) [L1330] s->state = 4400 VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1332] s->init_num = 0 VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1152] COND FALSE !(s->state == 4384) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1155] COND FALSE !(s->state == 4385) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540: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={-1510471540: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={-1510471540:0}] [L1345] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1351] s->state = 4416 [L1352] s->init_num = 0 VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1152] COND FALSE !(s->state == 4384) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1155] COND FALSE !(s->state == 4385) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1158] COND FALSE !(s->state == 4400) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1161] COND FALSE !(s->state == 4401) [L1164] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540: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={-1510471540:0}] [L1362] COND FALSE !(ret <= 0) [L1367] s->state = 4432 [L1368] s->init_num = 0 VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1369] COND FALSE !(! tmp___6) VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1152] COND FALSE !(s->state == 4384) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1155] COND FALSE !(s->state == 4385) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1158] COND FALSE !(s->state == 4400) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1161] COND FALSE !(s->state == 4401) [L1164] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1164] COND FALSE !(s->state == 4416) [L1167] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1167] COND FALSE !(s->state == 4417) [L1170] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1170] COND TRUE s->state == 4432 [L1378] ret = __VERIFIER_nondet_int() [L1379] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1641] __VERIFIER_error() VAL [init=1, SSLv3_client_data={-1510471540:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 129 locations, 1 error locations. Result: UNSAFE, OverallTime: 28.6s, OverallIterations: 6, TraceHistogramMax: 6, AutomataDifference: 16.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 876 SDtfs, 1825 SDslu, 1840 SDs, 0 SdLazy, 1386 SolverSat, 226 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 14.7s 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.0s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 505 NumberOfCodeBlocks, 505 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 776 ConstructedInterpolants, 0 QuantifiedInterpolants, 187485 SizeOfPredicates, 21 NumberOfNonLiveVariables, 1063 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...