./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 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a52c36fd-251d-4323-b9d9-1df6c5b4d547/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a52c36fd-251d-4323-b9d9-1df6c5b4d547/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a52c36fd-251d-4323-b9d9-1df6c5b4d547/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a52c36fd-251d-4323-b9d9-1df6c5b4d547/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_a52c36fd-251d-4323-b9d9-1df6c5b4d547/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a52c36fd-251d-4323-b9d9-1df6c5b4d547/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_a52c36fd-251d-4323-b9d9-1df6c5b4d547/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a52c36fd-251d-4323-b9d9-1df6c5b4d547/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a52c36fd-251d-4323-b9d9-1df6c5b4d547/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a52c36fd-251d-4323-b9d9-1df6c5b4d547/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_a52c36fd-251d-4323-b9d9-1df6c5b4d547/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a52c36fd-251d-4323-b9d9-1df6c5b4d547/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 Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: Unsupported type(() : VOID) --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:45:23,409 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:45:23,411 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:45:23,421 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:45:23,422 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:45:23,423 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:45:23,424 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:45:23,426 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:45:23,430 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:45:23,434 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:45:23,435 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:45:23,437 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:45:23,443 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:45:23,444 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:45:23,445 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:45:23,446 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:45:23,447 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:45:23,447 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:45:23,449 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:45:23,451 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:45:23,452 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:45:23,454 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:45:23,455 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:45:23,455 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:45:23,458 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:45:23,459 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:45:23,459 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:45:23,460 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:45:23,460 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:45:23,461 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:45:23,461 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:45:23,462 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:45:23,463 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:45:23,463 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:45:23,466 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:45:23,466 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:45:23,467 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:45:23,467 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:45:23,468 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:45:23,471 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:45:23,473 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:45:23,473 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a52c36fd-251d-4323-b9d9-1df6c5b4d547/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:45:23,502 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:45:23,504 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:45:23,506 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:45:23,506 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:45:23,506 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:45:23,507 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:45:23,507 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:45:23,507 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:45:23,507 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:45:23,507 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:45:23,508 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:45:23,509 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:45:23,509 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:45:23,509 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:45:23,509 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:45:23,510 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:45:23,510 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:45:23,510 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:45:23,510 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:45:23,510 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:45:23,511 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:45:23,511 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:45:23,511 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:45:23,511 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:45:23,512 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:45:23,512 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:45:23,512 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:45:23,513 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:45:23,513 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_a52c36fd-251d-4323-b9d9-1df6c5b4d547/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-25 08:45:23,653 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:45:23,666 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:45:23,669 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:45:23,671 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:45:23,671 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:45:23,672 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a52c36fd-251d-4323-b9d9-1df6c5b4d547/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_clnt.blast.02.i.cil-1.c [2019-11-25 08:45:23,723 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a52c36fd-251d-4323-b9d9-1df6c5b4d547/bin/uautomizer/data/a0c2e5f18/ee4569ec315e4550a2e5369f7aefc00d/FLAG7f9294541 [2019-11-25 08:45:24,158 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:45:24,158 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a52c36fd-251d-4323-b9d9-1df6c5b4d547/sv-benchmarks/c/ssh/s3_clnt.blast.02.i.cil-1.c [2019-11-25 08:45:24,176 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a52c36fd-251d-4323-b9d9-1df6c5b4d547/bin/uautomizer/data/a0c2e5f18/ee4569ec315e4550a2e5369f7aefc00d/FLAG7f9294541 [2019-11-25 08:45:24,466 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a52c36fd-251d-4323-b9d9-1df6c5b4d547/bin/uautomizer/data/a0c2e5f18/ee4569ec315e4550a2e5369f7aefc00d [2019-11-25 08:45:24,469 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:45:24,470 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:45:24,471 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:45:24,471 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:45:24,474 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:45:24,475 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,478 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c739b2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24, skipping insertion in model container [2019-11-25 08:45:24,478 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,485 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:45:24,552 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:45:25,052 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:45:25,067 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:45:25,225 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:45:25,257 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:45:25,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:25 WrapperNode [2019-11-25 08:45:25,259 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:45:25,260 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:45:25,260 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:45:25,260 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:45:25,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:25" (1/1) ... [2019-11-25 08:45:25,304 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:25" (1/1) ... [2019-11-25 08:45:25,362 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:45:25,369 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:45:25,369 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:45:25,369 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:45:25,379 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:25" (1/1) ... [2019-11-25 08:45:25,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:25" (1/1) ... [2019-11-25 08:45:25,399 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:25" (1/1) ... [2019-11-25 08:45:25,404 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:25" (1/1) ... [2019-11-25 08:45:25,449 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:25" (1/1) ... [2019-11-25 08:45:25,462 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:25" (1/1) ... [2019-11-25 08:45:25,465 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:25" (1/1) ... [2019-11-25 08:45:25,470 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:45:25,470 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:45:25,471 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:45:25,471 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:45:25,472 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a52c36fd-251d-4323-b9d9-1df6c5b4d547/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-25 08:45:25,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-25 08:45:25,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:45:25,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 08:45:25,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 08:45:25,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-25 08:45:25,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 08:45:25,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:45:25,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:45:25,839 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 08:45:26,761 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-25 08:45:26,761 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-25 08:45:26,763 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:45:26,763 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-25 08:45:26,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:45:26 BoogieIcfgContainer [2019-11-25 08:45:26,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:45:26,767 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:45:26,767 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:45:26,769 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:45:26,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:45:24" (1/3) ... [2019-11-25 08:45:26,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@175f171c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:45:26, skipping insertion in model container [2019-11-25 08:45:26,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:25" (2/3) ... [2019-11-25 08:45:26,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@175f171c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:45:26, skipping insertion in model container [2019-11-25 08:45:26,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:45:26" (3/3) ... [2019-11-25 08:45:26,775 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.02.i.cil-1.c [2019-11-25 08:45:26,785 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:45:26,793 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:45:26,803 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:45:26,829 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:45:26,830 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:45:26,830 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:45:26,830 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:45:26,830 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:45:26,830 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:45:26,830 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:45:26,831 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:45:26,852 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2019-11-25 08:45:26,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-25 08:45:26,858 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:26,859 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:26,859 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:26,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:26,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2019-11-25 08:45:26,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:26,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651891646] [2019-11-25 08:45:26,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:26,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:27,124 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-25 08:45:27,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651891646] [2019-11-25 08:45:27,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:27,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:45:27,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922470347] [2019-11-25 08:45:27,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:45:27,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:27,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:45:27,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:45:27,149 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 4 states. [2019-11-25 08:45:27,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:27,517 INFO L93 Difference]: Finished difference Result 255 states and 430 transitions. [2019-11-25 08:45:27,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:45:27,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-25 08:45:27,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:27,541 INFO L225 Difference]: With dead ends: 255 [2019-11-25 08:45:27,541 INFO L226 Difference]: Without dead ends: 116 [2019-11-25 08:45:27,546 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:45:27,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-25 08:45:27,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-11-25 08:45:27,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-25 08:45:27,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2019-11-25 08:45:27,611 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 24 [2019-11-25 08:45:27,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:27,611 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2019-11-25 08:45:27,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:45:27,612 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2019-11-25 08:45:27,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-25 08:45:27,616 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:27,617 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:27,618 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:27,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:27,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1001988123, now seen corresponding path program 1 times [2019-11-25 08:45:27,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:27,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975839646] [2019-11-25 08:45:27,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:27,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:27,828 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-25 08:45:27,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975839646] [2019-11-25 08:45:27,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:27,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:45:27,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630118416] [2019-11-25 08:45:27,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:27,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:27,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:27,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:27,832 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand 3 states. [2019-11-25 08:45:27,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:27,878 INFO L93 Difference]: Finished difference Result 320 states and 482 transitions. [2019-11-25 08:45:27,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:27,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-25 08:45:27,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:27,882 INFO L225 Difference]: With dead ends: 320 [2019-11-25 08:45:27,882 INFO L226 Difference]: Without dead ends: 215 [2019-11-25 08:45:27,884 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:27,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-11-25 08:45:27,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2019-11-25 08:45:27,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-11-25 08:45:27,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 319 transitions. [2019-11-25 08:45:27,902 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 319 transitions. Word has length 38 [2019-11-25 08:45:27,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:27,903 INFO L462 AbstractCegarLoop]: Abstraction has 215 states and 319 transitions. [2019-11-25 08:45:27,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:27,904 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 319 transitions. [2019-11-25 08:45:27,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-25 08:45:27,906 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:27,907 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:27,907 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:27,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:27,907 INFO L82 PathProgramCache]: Analyzing trace with hash 996888307, now seen corresponding path program 1 times [2019-11-25 08:45:27,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:27,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666201210] [2019-11-25 08:45:27,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:28,003 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-25 08:45:28,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666201210] [2019-11-25 08:45:28,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:28,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:45:28,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596820882] [2019-11-25 08:45:28,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:28,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:28,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:28,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:28,006 INFO L87 Difference]: Start difference. First operand 215 states and 319 transitions. Second operand 3 states. [2019-11-25 08:45:28,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:28,084 INFO L93 Difference]: Finished difference Result 420 states and 630 transitions. [2019-11-25 08:45:28,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:28,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-25 08:45:28,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:28,088 INFO L225 Difference]: With dead ends: 420 [2019-11-25 08:45:28,089 INFO L226 Difference]: Without dead ends: 315 [2019-11-25 08:45:28,090 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:28,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-11-25 08:45:28,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2019-11-25 08:45:28,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-11-25 08:45:28,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 466 transitions. [2019-11-25 08:45:28,123 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 466 transitions. Word has length 53 [2019-11-25 08:45:28,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:28,123 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 466 transitions. [2019-11-25 08:45:28,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:28,124 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 466 transitions. [2019-11-25 08:45:28,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-25 08:45:28,126 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:28,126 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:28,127 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:28,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:28,127 INFO L82 PathProgramCache]: Analyzing trace with hash -973367758, now seen corresponding path program 1 times [2019-11-25 08:45:28,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:28,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106946006] [2019-11-25 08:45:28,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:28,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:28,321 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-25 08:45:28,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106946006] [2019-11-25 08:45:28,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:28,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:45:28,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738781135] [2019-11-25 08:45:28,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:45:28,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:28,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:45:28,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:45:28,324 INFO L87 Difference]: Start difference. First operand 315 states and 466 transitions. Second operand 4 states. [2019-11-25 08:45:28,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:28,979 INFO L93 Difference]: Finished difference Result 805 states and 1196 transitions. [2019-11-25 08:45:28,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:45:28,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-25 08:45:28,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:28,983 INFO L225 Difference]: With dead ends: 805 [2019-11-25 08:45:28,984 INFO L226 Difference]: Without dead ends: 500 [2019-11-25 08:45:28,985 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:45:28,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-11-25 08:45:29,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 365. [2019-11-25 08:45:29,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-11-25 08:45:29,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 552 transitions. [2019-11-25 08:45:29,003 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 552 transitions. Word has length 71 [2019-11-25 08:45:29,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:29,004 INFO L462 AbstractCegarLoop]: Abstraction has 365 states and 552 transitions. [2019-11-25 08:45:29,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:45:29,004 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 552 transitions. [2019-11-25 08:45:29,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-25 08:45:29,006 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:29,006 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:29,007 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:29,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:29,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1107381264, now seen corresponding path program 1 times [2019-11-25 08:45:29,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:29,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910331011] [2019-11-25 08:45:29,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:29,120 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-25 08:45:29,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910331011] [2019-11-25 08:45:29,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:29,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:45:29,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984209402] [2019-11-25 08:45:29,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:45:29,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:29,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:45:29,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:45:29,127 INFO L87 Difference]: Start difference. First operand 365 states and 552 transitions. Second operand 4 states. [2019-11-25 08:45:29,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:29,516 INFO L93 Difference]: Finished difference Result 805 states and 1217 transitions. [2019-11-25 08:45:29,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:45:29,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-25 08:45:29,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:29,520 INFO L225 Difference]: With dead ends: 805 [2019-11-25 08:45:29,520 INFO L226 Difference]: Without dead ends: 450 [2019-11-25 08:45:29,521 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:45:29,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-11-25 08:45:29,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 405. [2019-11-25 08:45:29,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-11-25 08:45:29,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 620 transitions. [2019-11-25 08:45:29,535 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 620 transitions. Word has length 71 [2019-11-25 08:45:29,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:29,536 INFO L462 AbstractCegarLoop]: Abstraction has 405 states and 620 transitions. [2019-11-25 08:45:29,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:45:29,536 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 620 transitions. [2019-11-25 08:45:29,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-25 08:45:29,537 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:29,538 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:29,538 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:29,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:29,538 INFO L82 PathProgramCache]: Analyzing trace with hash -114315255, now seen corresponding path program 1 times [2019-11-25 08:45:29,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:29,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974613031] [2019-11-25 08:45:29,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:29,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:29,621 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-25 08:45:29,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974613031] [2019-11-25 08:45:29,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:29,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:45:29,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886416808] [2019-11-25 08:45:29,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:45:29,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:29,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:45:29,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:45:29,624 INFO L87 Difference]: Start difference. First operand 405 states and 620 transitions. Second operand 4 states. [2019-11-25 08:45:30,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:30,110 INFO L93 Difference]: Finished difference Result 927 states and 1408 transitions. [2019-11-25 08:45:30,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:45:30,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-11-25 08:45:30,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:30,115 INFO L225 Difference]: With dead ends: 927 [2019-11-25 08:45:30,115 INFO L226 Difference]: Without dead ends: 532 [2019-11-25 08:45:30,116 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:45:30,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-11-25 08:45:30,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 407. [2019-11-25 08:45:30,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-25 08:45:30,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 622 transitions. [2019-11-25 08:45:30,136 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 622 transitions. Word has length 72 [2019-11-25 08:45:30,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:30,136 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 622 transitions. [2019-11-25 08:45:30,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:45:30,137 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 622 transitions. [2019-11-25 08:45:30,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-25 08:45:30,138 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:30,138 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:30,139 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:30,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:30,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1902129482, now seen corresponding path program 2 times [2019-11-25 08:45:30,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:30,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673766951] [2019-11-25 08:45:30,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:30,217 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-25 08:45:30,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673766951] [2019-11-25 08:45:30,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:30,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:45:30,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730178560] [2019-11-25 08:45:30,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:45:30,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:30,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:45:30,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:45:30,219 INFO L87 Difference]: Start difference. First operand 407 states and 622 transitions. Second operand 4 states. [2019-11-25 08:45:30,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:30,730 INFO L93 Difference]: Finished difference Result 927 states and 1406 transitions. [2019-11-25 08:45:30,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:45:30,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-25 08:45:30,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:30,735 INFO L225 Difference]: With dead ends: 927 [2019-11-25 08:45:30,736 INFO L226 Difference]: Without dead ends: 530 [2019-11-25 08:45:30,737 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:45:30,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-11-25 08:45:30,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 407. [2019-11-25 08:45:30,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-25 08:45:30,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 620 transitions. [2019-11-25 08:45:30,756 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 620 transitions. Word has length 85 [2019-11-25 08:45:30,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:30,756 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 620 transitions. [2019-11-25 08:45:30,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:45:30,757 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 620 transitions. [2019-11-25 08:45:30,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-25 08:45:30,763 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:30,763 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:30,764 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:30,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:30,764 INFO L82 PathProgramCache]: Analyzing trace with hash 793149036, now seen corresponding path program 1 times [2019-11-25 08:45:30,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:30,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766000745] [2019-11-25 08:45:30,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:30,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:30,902 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-25 08:45:30,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766000745] [2019-11-25 08:45:30,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:30,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:45:30,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029925507] [2019-11-25 08:45:30,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:45:30,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:30,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:45:30,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:45:30,904 INFO L87 Difference]: Start difference. First operand 407 states and 620 transitions. Second operand 4 states. [2019-11-25 08:45:31,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:31,401 INFO L93 Difference]: Finished difference Result 927 states and 1402 transitions. [2019-11-25 08:45:31,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:45:31,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-25 08:45:31,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:31,404 INFO L225 Difference]: With dead ends: 927 [2019-11-25 08:45:31,405 INFO L226 Difference]: Without dead ends: 530 [2019-11-25 08:45:31,406 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:45:31,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-11-25 08:45:31,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 407. [2019-11-25 08:45:31,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-25 08:45:31,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 618 transitions. [2019-11-25 08:45:31,418 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 618 transitions. Word has length 85 [2019-11-25 08:45:31,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:31,419 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 618 transitions. [2019-11-25 08:45:31,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:45:31,419 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 618 transitions. [2019-11-25 08:45:31,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-25 08:45:31,421 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:31,421 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:31,421 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:31,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:31,422 INFO L82 PathProgramCache]: Analyzing trace with hash 872770184, now seen corresponding path program 2 times [2019-11-25 08:45:31,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:31,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504766478] [2019-11-25 08:45:31,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:31,494 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-25 08:45:31,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504766478] [2019-11-25 08:45:31,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:31,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:45:31,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614252205] [2019-11-25 08:45:31,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:45:31,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:31,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:45:31,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:45:31,497 INFO L87 Difference]: Start difference. First operand 407 states and 618 transitions. Second operand 4 states. [2019-11-25 08:45:31,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:31,858 INFO L93 Difference]: Finished difference Result 847 states and 1277 transitions. [2019-11-25 08:45:31,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:45:31,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-25 08:45:31,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:31,862 INFO L225 Difference]: With dead ends: 847 [2019-11-25 08:45:31,862 INFO L226 Difference]: Without dead ends: 450 [2019-11-25 08:45:31,863 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:45:31,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-11-25 08:45:31,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 407. [2019-11-25 08:45:31,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-25 08:45:31,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 616 transitions. [2019-11-25 08:45:31,875 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 616 transitions. Word has length 85 [2019-11-25 08:45:31,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:31,875 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 616 transitions. [2019-11-25 08:45:31,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:45:31,876 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 616 transitions. [2019-11-25 08:45:31,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-25 08:45:31,878 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:31,878 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:31,879 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:31,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:31,879 INFO L82 PathProgramCache]: Analyzing trace with hash -236210262, now seen corresponding path program 1 times [2019-11-25 08:45:31,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:31,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599224302] [2019-11-25 08:45:31,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:31,964 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-25 08:45:31,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599224302] [2019-11-25 08:45:31,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:31,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:45:31,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343707408] [2019-11-25 08:45:31,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:45:31,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:31,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:45:31,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:45:31,970 INFO L87 Difference]: Start difference. First operand 407 states and 616 transitions. Second operand 4 states. [2019-11-25 08:45:32,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:32,355 INFO L93 Difference]: Finished difference Result 847 states and 1273 transitions. [2019-11-25 08:45:32,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:45:32,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-25 08:45:32,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:32,360 INFO L225 Difference]: With dead ends: 847 [2019-11-25 08:45:32,361 INFO L226 Difference]: Without dead ends: 450 [2019-11-25 08:45:32,362 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:45:32,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-11-25 08:45:32,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 407. [2019-11-25 08:45:32,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-25 08:45:32,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 614 transitions. [2019-11-25 08:45:32,373 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 614 transitions. Word has length 85 [2019-11-25 08:45:32,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:32,374 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 614 transitions. [2019-11-25 08:45:32,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:45:32,374 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 614 transitions. [2019-11-25 08:45:32,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-25 08:45:32,375 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:32,375 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:32,376 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:32,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:32,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1127790653, now seen corresponding path program 1 times [2019-11-25 08:45:32,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:32,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749459192] [2019-11-25 08:45:32,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:32,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:32,451 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-25 08:45:32,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749459192] [2019-11-25 08:45:32,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:32,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:45:32,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926431315] [2019-11-25 08:45:32,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:45:32,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:32,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:45:32,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:45:32,453 INFO L87 Difference]: Start difference. First operand 407 states and 614 transitions. Second operand 4 states. [2019-11-25 08:45:32,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:32,986 INFO L93 Difference]: Finished difference Result 927 states and 1390 transitions. [2019-11-25 08:45:32,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:45:32,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-25 08:45:32,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:32,990 INFO L225 Difference]: With dead ends: 927 [2019-11-25 08:45:32,990 INFO L226 Difference]: Without dead ends: 530 [2019-11-25 08:45:32,995 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:45:32,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-11-25 08:45:33,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 407. [2019-11-25 08:45:33,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-25 08:45:33,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 612 transitions. [2019-11-25 08:45:33,009 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 612 transitions. Word has length 86 [2019-11-25 08:45:33,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:33,010 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 612 transitions. [2019-11-25 08:45:33,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:45:33,010 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 612 transitions. [2019-11-25 08:45:33,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-25 08:45:33,011 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:33,012 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:33,012 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:33,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:33,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1321809477, now seen corresponding path program 1 times [2019-11-25 08:45:33,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:33,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875906137] [2019-11-25 08:45:33,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:33,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:33,092 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-25 08:45:33,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875906137] [2019-11-25 08:45:33,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:33,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:45:33,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487653717] [2019-11-25 08:45:33,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:45:33,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:33,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:45:33,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:45:33,094 INFO L87 Difference]: Start difference. First operand 407 states and 612 transitions. Second operand 4 states. [2019-11-25 08:45:33,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:33,506 INFO L93 Difference]: Finished difference Result 847 states and 1265 transitions. [2019-11-25 08:45:33,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:45:33,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-25 08:45:33,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:33,509 INFO L225 Difference]: With dead ends: 847 [2019-11-25 08:45:33,510 INFO L226 Difference]: Without dead ends: 450 [2019-11-25 08:45:33,511 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:45:33,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-11-25 08:45:33,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 407. [2019-11-25 08:45:33,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-25 08:45:33,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 610 transitions. [2019-11-25 08:45:33,549 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 610 transitions. Word has length 86 [2019-11-25 08:45:33,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:33,549 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 610 transitions. [2019-11-25 08:45:33,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:45:33,549 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 610 transitions. [2019-11-25 08:45:33,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-25 08:45:33,550 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:33,551 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:33,551 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:33,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:33,551 INFO L82 PathProgramCache]: Analyzing trace with hash -490798233, now seen corresponding path program 1 times [2019-11-25 08:45:33,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:33,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274273910] [2019-11-25 08:45:33,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:33,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:33,616 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-25 08:45:33,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274273910] [2019-11-25 08:45:33,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:33,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:45:33,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12649070] [2019-11-25 08:45:33,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:45:33,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:33,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:45:33,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:45:33,619 INFO L87 Difference]: Start difference. First operand 407 states and 610 transitions. Second operand 4 states. [2019-11-25 08:45:34,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:34,128 INFO L93 Difference]: Finished difference Result 927 states and 1382 transitions. [2019-11-25 08:45:34,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:45:34,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-25 08:45:34,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:34,132 INFO L225 Difference]: With dead ends: 927 [2019-11-25 08:45:34,132 INFO L226 Difference]: Without dead ends: 530 [2019-11-25 08:45:34,135 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:45:34,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-11-25 08:45:34,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 407. [2019-11-25 08:45:34,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-25 08:45:34,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 608 transitions. [2019-11-25 08:45:34,148 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 608 transitions. Word has length 87 [2019-11-25 08:45:34,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:34,148 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 608 transitions. [2019-11-25 08:45:34,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:45:34,149 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 608 transitions. [2019-11-25 08:45:34,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-25 08:45:34,150 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:34,150 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:34,151 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:34,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:34,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1383461914, now seen corresponding path program 1 times [2019-11-25 08:45:34,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:34,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783104943] [2019-11-25 08:45:34,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:34,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:34,210 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-25 08:45:34,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783104943] [2019-11-25 08:45:34,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:34,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:45:34,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061184178] [2019-11-25 08:45:34,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:45:34,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:34,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:45:34,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:45:34,212 INFO L87 Difference]: Start difference. First operand 407 states and 608 transitions. Second operand 4 states. [2019-11-25 08:45:34,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:34,712 INFO L93 Difference]: Finished difference Result 783 states and 1162 transitions. [2019-11-25 08:45:34,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:45:34,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-25 08:45:34,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:34,715 INFO L225 Difference]: With dead ends: 783 [2019-11-25 08:45:34,716 INFO L226 Difference]: Without dead ends: 530 [2019-11-25 08:45:34,718 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:45:34,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-11-25 08:45:34,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 407. [2019-11-25 08:45:34,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-25 08:45:34,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 606 transitions. [2019-11-25 08:45:34,730 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 606 transitions. Word has length 87 [2019-11-25 08:45:34,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:34,730 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 606 transitions. [2019-11-25 08:45:34,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:45:34,731 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 606 transitions. [2019-11-25 08:45:34,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-25 08:45:34,732 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:34,732 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:34,733 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:34,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:34,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1862605531, now seen corresponding path program 1 times [2019-11-25 08:45:34,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:34,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945657065] [2019-11-25 08:45:34,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:34,814 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-25 08:45:34,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945657065] [2019-11-25 08:45:34,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:34,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:45:34,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949565871] [2019-11-25 08:45:34,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:45:34,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:34,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:45:34,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:45:34,816 INFO L87 Difference]: Start difference. First operand 407 states and 606 transitions. Second operand 4 states. [2019-11-25 08:45:35,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:35,138 INFO L93 Difference]: Finished difference Result 847 states and 1253 transitions. [2019-11-25 08:45:35,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:45:35,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-25 08:45:35,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:35,143 INFO L225 Difference]: With dead ends: 847 [2019-11-25 08:45:35,143 INFO L226 Difference]: Without dead ends: 450 [2019-11-25 08:45:35,144 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:45:35,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-11-25 08:45:35,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 407. [2019-11-25 08:45:35,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-25 08:45:35,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 604 transitions. [2019-11-25 08:45:35,159 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 604 transitions. Word has length 87 [2019-11-25 08:45:35,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:35,160 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 604 transitions. [2019-11-25 08:45:35,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:45:35,160 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 604 transitions. [2019-11-25 08:45:35,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-25 08:45:35,161 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:35,162 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:35,162 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:35,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:35,162 INFO L82 PathProgramCache]: Analyzing trace with hash 11654616, now seen corresponding path program 1 times [2019-11-25 08:45:35,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:35,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422452053] [2019-11-25 08:45:35,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:35,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:35,231 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-25 08:45:35,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422452053] [2019-11-25 08:45:35,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:35,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:45:35,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202181066] [2019-11-25 08:45:35,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:45:35,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:35,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:45:35,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:45:35,239 INFO L87 Difference]: Start difference. First operand 407 states and 604 transitions. Second operand 4 states. [2019-11-25 08:45:35,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:35,558 INFO L93 Difference]: Finished difference Result 703 states and 1035 transitions. [2019-11-25 08:45:35,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:45:35,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-25 08:45:35,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:35,561 INFO L225 Difference]: With dead ends: 703 [2019-11-25 08:45:35,561 INFO L226 Difference]: Without dead ends: 450 [2019-11-25 08:45:35,562 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:45:35,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-11-25 08:45:35,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 407. [2019-11-25 08:45:35,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-25 08:45:35,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 602 transitions. [2019-11-25 08:45:35,573 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 602 transitions. Word has length 87 [2019-11-25 08:45:35,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:35,573 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 602 transitions. [2019-11-25 08:45:35,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:45:35,573 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 602 transitions. [2019-11-25 08:45:35,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-25 08:45:35,575 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:35,575 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:35,575 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:35,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:35,576 INFO L82 PathProgramCache]: Analyzing trace with hash 2132678238, now seen corresponding path program 1 times [2019-11-25 08:45:35,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:35,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782362879] [2019-11-25 08:45:35,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:35,638 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-25 08:45:35,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782362879] [2019-11-25 08:45:35,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:35,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:45:35,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657235046] [2019-11-25 08:45:35,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:45:35,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:35,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:45:35,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:45:35,641 INFO L87 Difference]: Start difference. First operand 407 states and 602 transitions. Second operand 4 states. [2019-11-25 08:45:36,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:36,165 INFO L93 Difference]: Finished difference Result 909 states and 1344 transitions. [2019-11-25 08:45:36,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:45:36,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-25 08:45:36,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:36,168 INFO L225 Difference]: With dead ends: 909 [2019-11-25 08:45:36,168 INFO L226 Difference]: Without dead ends: 512 [2019-11-25 08:45:36,169 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:45:36,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-11-25 08:45:36,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 407. [2019-11-25 08:45:36,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-25 08:45:36,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 600 transitions. [2019-11-25 08:45:36,183 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 600 transitions. Word has length 88 [2019-11-25 08:45:36,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:36,184 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 600 transitions. [2019-11-25 08:45:36,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:45:36,184 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 600 transitions. [2019-11-25 08:45:36,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-25 08:45:36,185 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:36,185 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:36,186 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:36,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:36,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1903796849, now seen corresponding path program 1 times [2019-11-25 08:45:36,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:36,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922181329] [2019-11-25 08:45:36,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:36,252 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-25 08:45:36,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922181329] [2019-11-25 08:45:36,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:36,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:45:36,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013993152] [2019-11-25 08:45:36,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:45:36,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:36,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:45:36,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:45:36,254 INFO L87 Difference]: Start difference. First operand 407 states and 600 transitions. Second operand 4 states. [2019-11-25 08:45:36,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:36,727 INFO L93 Difference]: Finished difference Result 758 states and 1119 transitions. [2019-11-25 08:45:36,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:45:36,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-25 08:45:36,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:36,731 INFO L225 Difference]: With dead ends: 758 [2019-11-25 08:45:36,731 INFO L226 Difference]: Without dead ends: 505 [2019-11-25 08:45:36,731 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:45:36,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-11-25 08:45:36,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 407. [2019-11-25 08:45:36,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-25 08:45:36,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 598 transitions. [2019-11-25 08:45:36,743 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 598 transitions. Word has length 88 [2019-11-25 08:45:36,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:36,743 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 598 transitions. [2019-11-25 08:45:36,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:45:36,744 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 598 transitions. [2019-11-25 08:45:36,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-25 08:45:36,745 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:36,745 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:36,746 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:36,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:36,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1738642336, now seen corresponding path program 1 times [2019-11-25 08:45:36,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:36,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644376718] [2019-11-25 08:45:36,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:36,807 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-25 08:45:36,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644376718] [2019-11-25 08:45:36,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:36,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:45:36,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63007471] [2019-11-25 08:45:36,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:45:36,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:36,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:45:36,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:45:36,810 INFO L87 Difference]: Start difference. First operand 407 states and 598 transitions. Second operand 4 states. [2019-11-25 08:45:37,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:37,109 INFO L93 Difference]: Finished difference Result 829 states and 1215 transitions. [2019-11-25 08:45:37,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:45:37,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-25 08:45:37,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:37,112 INFO L225 Difference]: With dead ends: 829 [2019-11-25 08:45:37,112 INFO L226 Difference]: Without dead ends: 432 [2019-11-25 08:45:37,112 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:45:37,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-11-25 08:45:37,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 407. [2019-11-25 08:45:37,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-25 08:45:37,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 596 transitions. [2019-11-25 08:45:37,125 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 596 transitions. Word has length 88 [2019-11-25 08:45:37,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:37,126 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 596 transitions. [2019-11-25 08:45:37,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:45:37,126 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 596 transitions. [2019-11-25 08:45:37,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-25 08:45:37,127 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:37,128 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:37,128 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:37,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:37,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1967523725, now seen corresponding path program 1 times [2019-11-25 08:45:37,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:37,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088459960] [2019-11-25 08:45:37,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:37,196 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-25 08:45:37,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088459960] [2019-11-25 08:45:37,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:37,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:45:37,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358395757] [2019-11-25 08:45:37,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:45:37,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:37,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:45:37,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:45:37,199 INFO L87 Difference]: Start difference. First operand 407 states and 596 transitions. Second operand 4 states. [2019-11-25 08:45:37,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:37,549 INFO L93 Difference]: Finished difference Result 678 states and 992 transitions. [2019-11-25 08:45:37,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:45:37,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-25 08:45:37,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:37,552 INFO L225 Difference]: With dead ends: 678 [2019-11-25 08:45:37,552 INFO L226 Difference]: Without dead ends: 425 [2019-11-25 08:45:37,553 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:45:37,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2019-11-25 08:45:37,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 407. [2019-11-25 08:45:37,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-25 08:45:37,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 594 transitions. [2019-11-25 08:45:37,564 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 594 transitions. Word has length 88 [2019-11-25 08:45:37,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:37,564 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 594 transitions. [2019-11-25 08:45:37,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:45:37,564 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 594 transitions. [2019-11-25 08:45:37,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-25 08:45:37,566 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:37,566 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:37,566 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:37,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:37,567 INFO L82 PathProgramCache]: Analyzing trace with hash 730673667, now seen corresponding path program 1 times [2019-11-25 08:45:37,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:37,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124346430] [2019-11-25 08:45:37,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:37,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:37,641 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-25 08:45:37,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124346430] [2019-11-25 08:45:37,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:37,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:45:37,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097332605] [2019-11-25 08:45:37,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:45:37,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:37,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:45:37,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:45:37,645 INFO L87 Difference]: Start difference. First operand 407 states and 594 transitions. Second operand 4 states. [2019-11-25 08:45:38,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:38,094 INFO L93 Difference]: Finished difference Result 902 states and 1319 transitions. [2019-11-25 08:45:38,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:45:38,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-25 08:45:38,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:38,097 INFO L225 Difference]: With dead ends: 902 [2019-11-25 08:45:38,097 INFO L226 Difference]: Without dead ends: 505 [2019-11-25 08:45:38,098 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:45:38,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-11-25 08:45:38,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 407. [2019-11-25 08:45:38,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-25 08:45:38,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 592 transitions. [2019-11-25 08:45:38,110 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 592 transitions. Word has length 89 [2019-11-25 08:45:38,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:38,110 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 592 transitions. [2019-11-25 08:45:38,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:45:38,110 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 592 transitions. [2019-11-25 08:45:38,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-25 08:45:38,112 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:38,112 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:38,112 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:38,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:38,112 INFO L82 PathProgramCache]: Analyzing trace with hash 978820161, now seen corresponding path program 1 times [2019-11-25 08:45:38,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:38,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257090751] [2019-11-25 08:45:38,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:38,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:38,171 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-25 08:45:38,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257090751] [2019-11-25 08:45:38,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:38,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:45:38,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10394291] [2019-11-25 08:45:38,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:38,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:38,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:38,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:38,173 INFO L87 Difference]: Start difference. First operand 407 states and 592 transitions. Second operand 3 states. [2019-11-25 08:45:38,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:38,211 INFO L93 Difference]: Finished difference Result 807 states and 1180 transitions. [2019-11-25 08:45:38,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:38,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-11-25 08:45:38,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:38,214 INFO L225 Difference]: With dead ends: 807 [2019-11-25 08:45:38,214 INFO L226 Difference]: Without dead ends: 556 [2019-11-25 08:45:38,215 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:38,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2019-11-25 08:45:38,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2019-11-25 08:45:38,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2019-11-25 08:45:38,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 809 transitions. [2019-11-25 08:45:38,228 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 809 transitions. Word has length 89 [2019-11-25 08:45:38,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:38,228 INFO L462 AbstractCegarLoop]: Abstraction has 556 states and 809 transitions. [2019-11-25 08:45:38,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:38,229 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 809 transitions. [2019-11-25 08:45:38,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-25 08:45:38,230 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:38,230 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:38,230 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:38,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:38,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1317014729, now seen corresponding path program 1 times [2019-11-25 08:45:38,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:38,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629026129] [2019-11-25 08:45:38,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:38,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:38,291 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-25 08:45:38,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629026129] [2019-11-25 08:45:38,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:38,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:45:38,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927313781] [2019-11-25 08:45:38,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:38,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:38,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:38,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:38,294 INFO L87 Difference]: Start difference. First operand 556 states and 809 transitions. Second operand 3 states. [2019-11-25 08:45:38,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:38,343 INFO L93 Difference]: Finished difference Result 1105 states and 1614 transitions. [2019-11-25 08:45:38,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:38,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-11-25 08:45:38,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:38,348 INFO L225 Difference]: With dead ends: 1105 [2019-11-25 08:45:38,348 INFO L226 Difference]: Without dead ends: 705 [2019-11-25 08:45:38,349 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:38,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2019-11-25 08:45:38,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2019-11-25 08:45:38,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2019-11-25 08:45:38,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1027 transitions. [2019-11-25 08:45:38,367 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1027 transitions. Word has length 91 [2019-11-25 08:45:38,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:38,368 INFO L462 AbstractCegarLoop]: Abstraction has 705 states and 1027 transitions. [2019-11-25 08:45:38,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:38,368 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1027 transitions. [2019-11-25 08:45:38,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-25 08:45:38,369 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:38,370 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:38,370 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:38,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:38,370 INFO L82 PathProgramCache]: Analyzing trace with hash -761801560, now seen corresponding path program 1 times [2019-11-25 08:45:38,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:38,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368116111] [2019-11-25 08:45:38,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:38,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:38,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:38,898 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:45:38,899 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-25 08:45:39,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:45:39 BoogieIcfgContainer [2019-11-25 08:45:39,039 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:45:39,040 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:45:39,040 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:45:39,040 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:45:39,041 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:45:26" (3/4) ... [2019-11-25 08:45:39,044 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-25 08:45:39,044 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:45:39,046 INFO L168 Benchmark]: Toolchain (without parser) took 14575.56 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 241.2 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -223.8 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:45:39,046 INFO L168 Benchmark]: CDTParser took 0.23 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-25 08:45:39,047 INFO L168 Benchmark]: CACSL2BoogieTranslator took 788.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -155.7 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:45:39,047 INFO L168 Benchmark]: Boogie Procedure Inliner took 109.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:45:39,047 INFO L168 Benchmark]: Boogie Preprocessor took 101.23 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:45:39,048 INFO L168 Benchmark]: RCFGBuilder took 1295.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 997.4 MB in the end (delta: 86.8 MB). Peak memory consumption was 86.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:45:39,048 INFO L168 Benchmark]: TraceAbstraction took 12272.88 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 116.4 MB). Free memory was 997.4 MB in the beginning and 1.2 GB in the end (delta: -171.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:45:39,049 INFO L168 Benchmark]: Witness Printer took 4.33 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:45:39,050 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 788.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -155.7 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 109.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 101.23 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1295.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 997.4 MB in the end (delta: 86.8 MB). Peak memory consumption was 86.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12272.88 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 116.4 MB). Free memory was 997.4 MB in the beginning and 1.2 GB in the end (delta: -171.1 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 4.33 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1641]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1336. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={9:0}] [L1065] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1069] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1070] s->ctx = malloc(sizeof(SSL_CTX)) [L1071] s->session = malloc(sizeof(SSL_SESSION)) [L1072] s->state = 12292 [L1073] s->version = __VERIFIER_nondet_int() [L1080] BUF_MEM *buf ; [L1081] unsigned long tmp ; [L1082] unsigned long l ; [L1083] long num1 ; [L1084] void (*cb)() ; [L1085] int ret ; [L1086] int new_state ; [L1087] int state ; [L1088] int skip ; [L1089] int tmp___1 = __VERIFIER_nondet_int() ; [L1090] int tmp___2 = __VERIFIER_nondet_int() ; [L1091] int tmp___3 = __VERIFIER_nondet_int() ; [L1092] int tmp___4 = __VERIFIER_nondet_int() ; [L1093] int tmp___5 = __VERIFIER_nondet_int() ; [L1094] int tmp___6 = __VERIFIER_nondet_int() ; [L1095] int tmp___7 = __VERIFIER_nondet_int() ; [L1096] int tmp___8 = __VERIFIER_nondet_int() ; [L1097] long tmp___9 = __VERIFIER_nondet_long() ; [L1098] int blastFlag ; [L1101] blastFlag = 0 [L1102] s->hit=__VERIFIER_nondet_int () [L1103] s->state = 12292 [L1104] tmp = __VERIFIER_nondet_int() [L1105] cb = (void (*)())((void *)0) [L1106] ret = -1 [L1107] skip = 0 [L1108] EXPR s->info_callback VAL [init=1, SSLv3_client_data={9:0}] [L1108] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1109] EXPR s->info_callback [L1109] cb = s->info_callback [L1117] EXPR s->in_handshake [L1117] s->in_handshake += 1 [L1118] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_client_data={9:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1131] COND TRUE s->state == 12292 [L1234] s->new_session = 1 [L1235] s->state = 4096 [L1236] EXPR s->ctx [L1236] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1236] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1241] s->server = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1242] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={9:0}] [L1247] EXPR s->version VAL [init=1, SSLv3_client_data={9:0}] [L1247] COND FALSE !((s->version & 65280) != 768) [L1253] s->type = 4096 [L1254] EXPR s->init_buf VAL [init=1, SSLv3_client_data={9:0}] [L1254] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1272] COND FALSE !(! tmp___4) VAL [init=1, SSLv3_client_data={9:0}] [L1278] COND FALSE !(! tmp___5) [L1284] s->state = 4368 [L1285] EXPR s->ctx [L1285] EXPR (s->ctx)->stats.sess_connect [L1285] (s->ctx)->stats.sess_connect += 1 [L1286] s->init_num = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1146] COND TRUE s->state == 4368 [L1290] s->shutdown = 0 [L1291] ret = __VERIFIER_nondet_int() [L1292] COND TRUE blastFlag == 0 [L1293] blastFlag = 1 VAL [init=1, SSLv3_client_data={9:0}] [L1301] COND FALSE !(ret <= 0) [L1306] s->state = 4384 [L1307] s->init_num = 0 [L1308] EXPR s->bbio [L1308] EXPR s->wbio VAL [init=1, SSLv3_client_data={9:0}] [L1308] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1152] COND TRUE s->state == 4384 [L1316] ret = __VERIFIER_nondet_int() [L1317] COND TRUE blastFlag == 1 [L1318] blastFlag = 2 VAL [init=1, SSLv3_client_data={9:0}] [L1322] COND FALSE !(ret <= 0) [L1327] s->hit VAL [init=1, SSLv3_client_data={9:0}] [L1327] COND FALSE !(s->hit) [L1330] s->state = 4400 VAL [init=1, SSLv3_client_data={9:0}] [L1332] s->init_num = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1152] COND FALSE !(s->state == 4384) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1155] COND FALSE !(s->state == 4385) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1158] COND TRUE s->state == 4400 [L1336] EXPR s->s3 [L1336] EXPR (s->s3)->tmp.new_cipher [L1336] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_client_data={9:0}] [L1336] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1339] ret = __VERIFIER_nondet_int() [L1340] COND TRUE blastFlag == 2 [L1341] blastFlag = 3 VAL [init=1, SSLv3_client_data={9:0}] [L1345] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={9:0}] [L1351] s->state = 4416 [L1352] s->init_num = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1152] COND FALSE !(s->state == 4384) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1155] COND FALSE !(s->state == 4385) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1158] COND FALSE !(s->state == 4400) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1161] COND FALSE !(s->state == 4401) [L1164] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1164] COND TRUE s->state == 4416 [L1356] ret = __VERIFIER_nondet_int() [L1357] COND TRUE blastFlag == 3 [L1358] blastFlag = 4 VAL [init=1, SSLv3_client_data={9:0}] [L1362] COND FALSE !(ret <= 0) [L1367] s->state = 4432 [L1368] s->init_num = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1369] COND FALSE !(! tmp___6) VAL [init=1, SSLv3_client_data={9:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1152] COND FALSE !(s->state == 4384) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1155] COND FALSE !(s->state == 4385) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1158] COND FALSE !(s->state == 4400) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1161] COND FALSE !(s->state == 4401) [L1164] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1164] COND FALSE !(s->state == 4416) [L1167] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1167] COND FALSE !(s->state == 4417) [L1170] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1170] COND TRUE s->state == 4432 [L1378] ret = __VERIFIER_nondet_int() [L1379] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_client_data={9:0}] [L1641] __VERIFIER_error() VAL [init=1, SSLv3_client_data={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 129 locations, 1 error locations. Result: UNSAFE, OverallTime: 12.2s, OverallIterations: 24, TraceHistogramMax: 6, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4890 SDtfs, 1774 SDslu, 6292 SDs, 0 SdLazy, 3593 SolverSat, 131 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.9s 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.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 1480 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1922 NumberOfCodeBlocks, 1922 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1787 ConstructedInterpolants, 0 QuantifiedInterpolants, 374650 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 1532/1532 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-6b5699a [2019-11-25 08:45:40,867 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:45:40,868 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:45:40,879 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:45:40,879 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:45:40,880 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:45:40,882 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:45:40,884 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:45:40,886 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:45:40,887 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:45:40,888 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:45:40,889 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:45:40,890 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:45:40,891 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:45:40,892 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:45:40,893 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:45:40,894 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:45:40,894 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:45:40,896 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:45:40,898 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:45:40,900 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:45:40,904 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:45:40,905 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:45:40,906 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:45:40,909 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:45:40,912 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:45:40,912 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:45:40,913 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:45:40,915 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:45:40,915 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:45:40,916 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:45:40,917 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:45:40,918 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:45:40,919 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:45:40,920 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:45:40,922 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:45:40,923 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:45:40,923 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:45:40,924 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:45:40,924 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:45:40,925 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:45:40,926 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a52c36fd-251d-4323-b9d9-1df6c5b4d547/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-25 08:45:40,943 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:45:40,943 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:45:40,944 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:45:40,945 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:45:40,945 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:45:40,945 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:45:40,945 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:45:40,946 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:45:40,946 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:45:40,946 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:45:40,946 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:45:40,947 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:45:40,947 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 08:45:40,947 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-25 08:45:40,947 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-25 08:45:40,948 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:45:40,948 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:45:40,948 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:45:40,948 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:45:40,949 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:45:40,949 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:45:40,949 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:45:40,949 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:45:40,950 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:45:40,950 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:45:40,950 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:45:40,950 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:45:40,951 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-25 08:45:40,951 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-25 08:45:40,951 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:45:40,951 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-25 08:45:40,952 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_a52c36fd-251d-4323-b9d9-1df6c5b4d547/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-25 08:45:41,212 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:45:41,222 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:45:41,224 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:45:41,225 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:45:41,226 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:45:41,226 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a52c36fd-251d-4323-b9d9-1df6c5b4d547/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_clnt.blast.02.i.cil-1.c [2019-11-25 08:45:41,277 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a52c36fd-251d-4323-b9d9-1df6c5b4d547/bin/uautomizer/data/bf79762cc/d4c27ebae8e4476fa561d2df75c2ec1d/FLAG7806f7461 [2019-11-25 08:45:41,775 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:45:41,775 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a52c36fd-251d-4323-b9d9-1df6c5b4d547/sv-benchmarks/c/ssh/s3_clnt.blast.02.i.cil-1.c [2019-11-25 08:45:41,793 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a52c36fd-251d-4323-b9d9-1df6c5b4d547/bin/uautomizer/data/bf79762cc/d4c27ebae8e4476fa561d2df75c2ec1d/FLAG7806f7461 [2019-11-25 08:45:42,248 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a52c36fd-251d-4323-b9d9-1df6c5b4d547/bin/uautomizer/data/bf79762cc/d4c27ebae8e4476fa561d2df75c2ec1d [2019-11-25 08:45:42,251 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:45:42,252 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:45:42,253 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:45:42,253 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:45:42,257 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:45:42,258 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:45:42" (1/1) ... [2019-11-25 08:45:42,260 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2acf2ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:42, skipping insertion in model container [2019-11-25 08:45:42,261 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:45:42" (1/1) ... [2019-11-25 08:45:42,268 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:45:42,348 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:45:42,613 INFO L965 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-25 08:45:42,613 INFO L968 CHandler]: at location: C: (SSL_METHOD *)((void *)0) [1038] [2019-11-25 08:45:42,614 INFO L969 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-25 08:45:42,631 INFO L965 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-25 08:45:42,631 INFO L968 CHandler]: at location: C: (SSL*)malloc(sizeof(SSL)) [1065] [2019-11-25 08:45:42,632 INFO L969 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-25 08:45:42,730 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.UnsupportedOperationException: Unsupported type(() : VOID) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.computeSize(TypeSizeAndOffsetComputer.java:205) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.constructBytesizeExpression(TypeSizeAndOffsetComputer.java:121) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:955) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:279) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:700) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:282) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1300) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:220) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:993) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:993) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:372) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1371) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:155) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3448) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2263) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:573) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:193) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:115) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:125) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-25 08:45:42,740 INFO L168 Benchmark]: Toolchain (without parser) took 487.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -195.2 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:45:42,741 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:45:42,742 INFO L168 Benchmark]: CACSL2BoogieTranslator took 484.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -195.2 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:45:42,744 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 484.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -195.2 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: UnsupportedOperationException: Unsupported type(() : VOID) de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: UnsupportedOperationException: Unsupported type(() : VOID): de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.computeSize(TypeSizeAndOffsetComputer.java:205) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...